40.17/21.86 YES 40.17/21.86 40.17/21.86 Ultimate: Cannot open display: 40.17/21.86 This is Ultimate 0.1.24-8dc7c08-m 40.17/21.86 [2019-03-28 12:21:46,174 INFO L170 SettingsManager]: Resetting all preferences to default values... 40.17/21.86 [2019-03-28 12:21:46,176 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 40.17/21.86 [2019-03-28 12:21:46,187 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 40.17/21.86 [2019-03-28 12:21:46,187 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 40.17/21.86 [2019-03-28 12:21:46,188 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 40.17/21.86 [2019-03-28 12:21:46,189 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 40.17/21.86 [2019-03-28 12:21:46,191 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 40.17/21.86 [2019-03-28 12:21:46,193 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 40.17/21.86 [2019-03-28 12:21:46,193 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 40.17/21.86 [2019-03-28 12:21:46,194 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 40.17/21.86 [2019-03-28 12:21:46,194 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 40.17/21.86 [2019-03-28 12:21:46,195 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 40.17/21.86 [2019-03-28 12:21:46,196 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 40.17/21.86 [2019-03-28 12:21:46,197 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 40.17/21.86 [2019-03-28 12:21:46,198 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 40.17/21.86 [2019-03-28 12:21:46,199 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 40.17/21.86 [2019-03-28 12:21:46,201 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 40.17/21.86 [2019-03-28 12:21:46,203 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 40.17/21.86 [2019-03-28 12:21:46,204 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 40.17/21.86 [2019-03-28 12:21:46,205 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 40.17/21.86 [2019-03-28 12:21:46,206 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 40.17/21.86 [2019-03-28 12:21:46,208 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 40.17/21.86 [2019-03-28 12:21:46,208 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 40.17/21.86 [2019-03-28 12:21:46,209 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 40.17/21.86 [2019-03-28 12:21:46,209 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 40.17/21.86 [2019-03-28 12:21:46,210 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 40.17/21.86 [2019-03-28 12:21:46,211 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 40.17/21.86 [2019-03-28 12:21:46,211 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 40.17/21.86 [2019-03-28 12:21:46,212 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 40.17/21.86 [2019-03-28 12:21:46,212 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 40.17/21.86 [2019-03-28 12:21:46,213 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 40.17/21.86 [2019-03-28 12:21:46,214 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 40.17/21.86 [2019-03-28 12:21:46,214 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 40.17/21.86 [2019-03-28 12:21:46,215 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 40.17/21.86 [2019-03-28 12:21:46,215 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 40.17/21.86 [2019-03-28 12:21:46,215 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 40.17/21.86 [2019-03-28 12:21:46,216 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 40.17/21.86 [2019-03-28 12:21:46,217 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 40.17/21.86 [2019-03-28 12:21:46,217 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 40.17/21.86 [2019-03-28 12:21:46,232 INFO L110 SettingsManager]: Loading preferences was successful 40.17/21.86 [2019-03-28 12:21:46,232 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 40.17/21.86 [2019-03-28 12:21:46,233 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 40.17/21.86 [2019-03-28 12:21:46,233 INFO L133 SettingsManager]: * Rewrite not-equals=true 40.17/21.86 [2019-03-28 12:21:46,233 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 40.17/21.86 [2019-03-28 12:21:46,234 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 40.17/21.86 [2019-03-28 12:21:46,234 INFO L133 SettingsManager]: * Use SBE=true 40.17/21.86 [2019-03-28 12:21:46,234 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 40.17/21.86 [2019-03-28 12:21:46,234 INFO L133 SettingsManager]: * Use old map elimination=false 40.17/21.86 [2019-03-28 12:21:46,234 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 40.17/21.86 [2019-03-28 12:21:46,235 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 40.17/21.86 [2019-03-28 12:21:46,235 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 40.17/21.86 [2019-03-28 12:21:46,235 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 40.17/21.86 [2019-03-28 12:21:46,235 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 40.17/21.86 [2019-03-28 12:21:46,235 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.17/21.86 [2019-03-28 12:21:46,235 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 40.17/21.86 [2019-03-28 12:21:46,236 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 40.17/21.86 [2019-03-28 12:21:46,236 INFO L133 SettingsManager]: * Check division by zero=IGNORE 40.17/21.86 [2019-03-28 12:21:46,236 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 40.17/21.86 [2019-03-28 12:21:46,236 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 40.17/21.86 [2019-03-28 12:21:46,236 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 40.17/21.86 [2019-03-28 12:21:46,236 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 40.17/21.86 [2019-03-28 12:21:46,237 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 40.17/21.86 [2019-03-28 12:21:46,237 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 40.17/21.86 [2019-03-28 12:21:46,237 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 40.17/21.86 [2019-03-28 12:21:46,237 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 40.17/21.86 [2019-03-28 12:21:46,237 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 40.17/21.86 [2019-03-28 12:21:46,238 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 40.17/21.86 [2019-03-28 12:21:46,238 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 40.17/21.86 [2019-03-28 12:21:46,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 40.17/21.86 [2019-03-28 12:21:46,276 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 40.17/21.86 [2019-03-28 12:21:46,280 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 40.17/21.86 [2019-03-28 12:21:46,281 INFO L271 PluginConnector]: Initializing CDTParser... 40.17/21.86 [2019-03-28 12:21:46,282 INFO L276 PluginConnector]: CDTParser initialized 40.17/21.86 [2019-03-28 12:21:46,283 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 40.17/21.86 [2019-03-28 12:21:46,343 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/4d806701d83648c09ba662cd17eac2e0/FLAGb33093f15 40.17/21.86 [2019-03-28 12:21:46,683 INFO L307 CDTParser]: Found 1 translation units. 40.17/21.86 [2019-03-28 12:21:46,684 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 40.17/21.86 [2019-03-28 12:21:46,691 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/4d806701d83648c09ba662cd17eac2e0/FLAGb33093f15 40.17/21.86 [2019-03-28 12:21:47,098 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/4d806701d83648c09ba662cd17eac2e0 40.17/21.86 [2019-03-28 12:21:47,110 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 40.17/21.86 [2019-03-28 12:21:47,111 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 40.17/21.86 [2019-03-28 12:21:47,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 40.17/21.86 [2019-03-28 12:21:47,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 40.17/21.86 [2019-03-28 12:21:47,116 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 40.17/21.86 [2019-03-28 12:21:47,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:21:47" (1/1) ... 40.17/21.86 [2019-03-28 12:21:47,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eb9ece4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:21:47, skipping insertion in model container 40.17/21.86 [2019-03-28 12:21:47,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:21:47" (1/1) ... 40.17/21.86 [2019-03-28 12:21:47,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 40.17/21.86 [2019-03-28 12:21:47,148 INFO L176 MainTranslator]: Built tables and reachable declarations 40.17/21.86 [2019-03-28 12:21:47,308 INFO L206 PostProcessor]: Analyzing one entry point: main 40.17/21.86 [2019-03-28 12:21:47,312 INFO L191 MainTranslator]: Completed pre-run 40.17/21.86 [2019-03-28 12:21:47,329 INFO L206 PostProcessor]: Analyzing one entry point: main 40.17/21.86 [2019-03-28 12:21:47,344 INFO L195 MainTranslator]: Completed translation 40.17/21.86 [2019-03-28 12:21:47,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:21:47 WrapperNode 40.17/21.86 [2019-03-28 12:21:47,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 40.17/21.86 [2019-03-28 12:21:47,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 40.17/21.86 [2019-03-28 12:21:47,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 40.17/21.86 [2019-03-28 12:21:47,346 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 40.17/21.86 [2019-03-28 12:21:47,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:21:47" (1/1) ... 40.17/21.86 [2019-03-28 12:21:47,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:21:47" (1/1) ... 40.17/21.86 [2019-03-28 12:21:47,445 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 40.17/21.86 [2019-03-28 12:21:47,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 40.17/21.86 [2019-03-28 12:21:47,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 40.17/21.86 [2019-03-28 12:21:47,446 INFO L276 PluginConnector]: Boogie Preprocessor initialized 40.17/21.86 [2019-03-28 12:21:47,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:21:47" (1/1) ... 40.17/21.86 [2019-03-28 12:21:47,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:21:47" (1/1) ... 40.17/21.86 [2019-03-28 12:21:47,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:21:47" (1/1) ... 40.17/21.86 [2019-03-28 12:21:47,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:21:47" (1/1) ... 40.17/21.86 [2019-03-28 12:21:47,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:21:47" (1/1) ... 40.17/21.86 [2019-03-28 12:21:47,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:21:47" (1/1) ... 40.17/21.86 [2019-03-28 12:21:47,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:21:47" (1/1) ... 40.17/21.86 [2019-03-28 12:21:47,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 40.17/21.86 [2019-03-28 12:21:47,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 40.17/21.86 [2019-03-28 12:21:47,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... 40.17/21.86 [2019-03-28 12:21:47,463 INFO L276 PluginConnector]: RCFGBuilder initialized 40.17/21.86 [2019-03-28 12:21:47,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:21:47" (1/1) ... 40.17/21.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.17/21.86 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 40.17/21.86 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 40.17/21.86 [2019-03-28 12:21:47,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 40.17/21.86 [2019-03-28 12:21:47,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 40.17/21.86 [2019-03-28 12:21:47,527 INFO L130 BoogieDeclarations]: Found specification of procedure fibo 40.17/21.86 [2019-03-28 12:21:47,527 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo 40.17/21.86 [2019-03-28 12:21:47,658 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 40.17/21.86 [2019-03-28 12:21:47,658 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. 40.17/21.86 [2019-03-28 12:21:47,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:21:47 BoogieIcfgContainer 40.17/21.86 [2019-03-28 12:21:47,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 40.17/21.86 [2019-03-28 12:21:47,660 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 40.17/21.86 [2019-03-28 12:21:47,660 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 40.17/21.86 [2019-03-28 12:21:47,662 INFO L276 PluginConnector]: BlockEncodingV2 initialized 40.17/21.86 [2019-03-28 12:21:47,663 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:21:47" (1/1) ... 40.17/21.86 [2019-03-28 12:21:47,678 INFO L313 BlockEncoder]: Initial Icfg 17 locations, 21 edges 40.17/21.86 [2019-03-28 12:21:47,680 INFO L258 BlockEncoder]: Using Remove infeasible edges 40.17/21.86 [2019-03-28 12:21:47,680 INFO L263 BlockEncoder]: Using Maximize final states 40.17/21.86 [2019-03-28 12:21:47,681 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 40.17/21.86 [2019-03-28 12:21:47,681 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 40.17/21.86 [2019-03-28 12:21:47,683 INFO L296 BlockEncoder]: Using Remove sink states 40.17/21.86 [2019-03-28 12:21:47,684 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 40.17/21.86 [2019-03-28 12:21:47,684 INFO L179 BlockEncoder]: Using Rewrite not-equals 40.17/21.86 [2019-03-28 12:21:47,701 INFO L185 BlockEncoder]: Using Use SBE 40.17/21.86 [2019-03-28 12:21:47,716 INFO L200 BlockEncoder]: SBE split 2 edges 40.17/21.86 [2019-03-28 12:21:47,720 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 40.17/21.86 [2019-03-28 12:21:47,722 INFO L71 MaximizeFinalStates]: 0 new accepting states 40.17/21.86 [2019-03-28 12:21:47,732 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 40.17/21.86 [2019-03-28 12:21:47,735 INFO L70 RemoveSinkStates]: Removed 6 edges and 5 locations by removing sink states 40.17/21.86 [2019-03-28 12:21:47,737 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 40.17/21.86 [2019-03-28 12:21:47,737 INFO L71 MaximizeFinalStates]: 0 new accepting states 40.17/21.86 [2019-03-28 12:21:47,737 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 40.17/21.86 [2019-03-28 12:21:47,738 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 40.17/21.86 [2019-03-28 12:21:47,738 INFO L313 BlockEncoder]: Encoded RCFG 10 locations, 14 edges 40.17/21.86 [2019-03-28 12:21:47,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:21:47 BasicIcfg 40.17/21.86 [2019-03-28 12:21:47,739 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 40.17/21.86 [2019-03-28 12:21:47,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 40.17/21.86 [2019-03-28 12:21:47,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... 40.17/21.86 [2019-03-28 12:21:47,743 INFO L276 PluginConnector]: TraceAbstraction initialized 40.17/21.86 [2019-03-28 12:21:47,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:21:47" (1/4) ... 40.17/21.86 [2019-03-28 12:21:47,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f4ac12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:21:47, skipping insertion in model container 40.17/21.86 [2019-03-28 12:21:47,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:21:47" (2/4) ... 40.17/21.86 [2019-03-28 12:21:47,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f4ac12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:21:47, skipping insertion in model container 40.17/21.86 [2019-03-28 12:21:47,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:21:47" (3/4) ... 40.17/21.86 [2019-03-28 12:21:47,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f4ac12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:21:47, skipping insertion in model container 40.17/21.86 [2019-03-28 12:21:47,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:21:47" (4/4) ... 40.17/21.86 [2019-03-28 12:21:47,747 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 40.17/21.86 [2019-03-28 12:21:47,757 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 40.17/21.86 [2019-03-28 12:21:47,765 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 40.17/21.86 [2019-03-28 12:21:47,782 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 40.17/21.86 [2019-03-28 12:21:47,810 INFO L133 ementStrategyFactory]: Using default assertion order modulation 40.17/21.86 [2019-03-28 12:21:47,811 INFO L382 AbstractCegarLoop]: Interprodecural is true 40.17/21.86 [2019-03-28 12:21:47,811 INFO L383 AbstractCegarLoop]: Hoare is true 40.17/21.86 [2019-03-28 12:21:47,811 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 40.17/21.86 [2019-03-28 12:21:47,812 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 40.17/21.86 [2019-03-28 12:21:47,812 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 40.17/21.86 [2019-03-28 12:21:47,812 INFO L387 AbstractCegarLoop]: Difference is false 40.17/21.86 [2019-03-28 12:21:47,812 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 40.17/21.86 [2019-03-28 12:21:47,812 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 40.17/21.86 [2019-03-28 12:21:47,829 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. 40.17/21.86 [2019-03-28 12:21:47,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 40.17/21.86 [2019-03-28 12:21:47,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. 40.17/21.86 [2019-03-28 12:21:47,898 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 40.17/21.86 [2019-03-28 12:21:47,899 INFO L451 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: true 40.17/21.86 [2019-03-28 12:21:47,899 INFO L448 ceAbstractionStarter]: For program point fiboEXIT(lines 5 13) no Hoare annotation was computed. 40.17/21.87 [2019-03-28 12:21:47,899 INFO L451 ceAbstractionStarter]: At program point L11(line 11) the Hoare annotation is: true 40.17/21.87 [2019-03-28 12:21:47,899 INFO L451 ceAbstractionStarter]: At program point L11-1(line 11) the Hoare annotation is: true 40.17/21.87 [2019-03-28 12:21:47,899 INFO L448 ceAbstractionStarter]: For program point L11-2(line 11) no Hoare annotation was computed. 40.17/21.87 [2019-03-28 12:21:47,900 INFO L448 ceAbstractionStarter]: For program point L8(lines 8 12) no Hoare annotation was computed. 40.17/21.87 [2019-03-28 12:21:47,900 INFO L448 ceAbstractionStarter]: For program point L6(lines 6 12) no Hoare annotation was computed. 40.17/21.87 [2019-03-28 12:21:47,900 INFO L451 ceAbstractionStarter]: At program point fiboENTRY(lines 5 13) the Hoare annotation is: true 40.17/21.87 [2019-03-28 12:21:47,900 INFO L448 ceAbstractionStarter]: For program point fiboFINAL(lines 5 13) no Hoare annotation was computed. 40.17/21.87 [2019-03-28 12:21:47,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:21:47 BasicIcfg 40.17/21.87 [2019-03-28 12:21:47,904 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 40.17/21.87 [2019-03-28 12:21:47,904 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 40.17/21.87 [2019-03-28 12:21:47,905 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 40.17/21.87 [2019-03-28 12:21:47,908 INFO L276 PluginConnector]: BuchiAutomizer initialized 40.17/21.87 [2019-03-28 12:21:47,909 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 40.17/21.87 [2019-03-28 12:21:47,909 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:21:47" (1/5) ... 40.17/21.87 [2019-03-28 12:21:47,910 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1134b9bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:21:47, skipping insertion in model container 40.17/21.87 [2019-03-28 12:21:47,910 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 40.17/21.87 [2019-03-28 12:21:47,910 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:21:47" (2/5) ... 40.17/21.87 [2019-03-28 12:21:47,910 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1134b9bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:21:47, skipping insertion in model container 40.17/21.87 [2019-03-28 12:21:47,911 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 40.17/21.87 [2019-03-28 12:21:47,911 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:21:47" (3/5) ... 40.17/21.87 [2019-03-28 12:21:47,911 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1134b9bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:21:47, skipping insertion in model container 40.17/21.87 [2019-03-28 12:21:47,911 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 40.17/21.87 [2019-03-28 12:21:47,911 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:21:47" (4/5) ... 40.17/21.87 [2019-03-28 12:21:47,913 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1134b9bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:21:47, skipping insertion in model container 40.17/21.87 [2019-03-28 12:21:47,913 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 40.17/21.87 [2019-03-28 12:21:47,913 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:21:47" (5/5) ... 40.17/21.87 [2019-03-28 12:21:47,914 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 40.17/21.87 [2019-03-28 12:21:47,942 INFO L133 ementStrategyFactory]: Using default assertion order modulation 40.17/21.87 [2019-03-28 12:21:47,943 INFO L374 BuchiCegarLoop]: Interprodecural is true 40.17/21.87 [2019-03-28 12:21:47,943 INFO L375 BuchiCegarLoop]: Hoare is true 40.17/21.87 [2019-03-28 12:21:47,943 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 40.17/21.87 [2019-03-28 12:21:47,943 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 40.17/21.87 [2019-03-28 12:21:47,943 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 40.17/21.87 [2019-03-28 12:21:47,943 INFO L379 BuchiCegarLoop]: Difference is false 40.17/21.87 [2019-03-28 12:21:47,944 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 40.17/21.87 [2019-03-28 12:21:47,944 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 40.17/21.87 [2019-03-28 12:21:47,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. 40.17/21.87 [2019-03-28 12:21:47,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 40.17/21.87 [2019-03-28 12:21:47,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 40.17/21.87 [2019-03-28 12:21:47,970 INFO L119 BuchiIsEmpty]: Starting construction of run 40.17/21.87 [2019-03-28 12:21:47,977 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 40.17/21.87 [2019-03-28 12:21:47,977 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 40.17/21.87 [2019-03-28 12:21:47,978 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 40.17/21.87 [2019-03-28 12:21:47,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. 40.17/21.87 [2019-03-28 12:21:47,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 40.17/21.87 [2019-03-28 12:21:47,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 40.17/21.87 [2019-03-28 12:21:47,980 INFO L119 BuchiIsEmpty]: Starting construction of run 40.17/21.87 [2019-03-28 12:21:47,980 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 40.17/21.87 [2019-03-28 12:21:47,980 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 40.17/21.87 [2019-03-28 12:21:47,985 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [41] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 5) InVars {} OutVars{ULTIMATE.start_main_#t~ret2=|v_ULTIMATE.start_main_#t~ret2_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~result~0] 11#L25true [52] L25-->fiboENTRY: Formula: (= |v_fibo_#in~nInParam_1| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_1|} AuxVars[] AssignedVars[fibo_#in~n]< 7#fiboENTRYtrue 40.17/21.87 [2019-03-28 12:21:47,986 INFO L796 eck$LassoCheckResult]: Loop: 7#fiboENTRYtrue [45] fiboENTRY-->L6: Formula: (= v_fibo_~n_1 |v_fibo_#in~n_1|) InVars {fibo_#in~n=|v_fibo_#in~n_1|} OutVars{fibo_~n=v_fibo_~n_1, fibo_#in~n=|v_fibo_#in~n_1|} AuxVars[] AssignedVars[fibo_~n] 12#L6true [56] L6-->L8: Formula: (>= v_fibo_~n_3 1) InVars {fibo_~n=v_fibo_~n_3} OutVars{fibo_~n=v_fibo_~n_3} AuxVars[] AssignedVars[] 6#L8true [59] L8-->L11: Formula: (< v_fibo_~n_5 1) InVars {fibo_~n=v_fibo_~n_5} OutVars{fibo_~n=v_fibo_~n_5} AuxVars[] AssignedVars[] 10#L11true [51] L11-->fiboENTRY: Formula: (= |v_fibo_#in~nInParam_2| (+ v_fibo_~n_8 (- 1))) InVars {fibo_~n=v_fibo_~n_8} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_2|} AuxVars[] AssignedVars[fibo_#in~n]< 7#fiboENTRYtrue 40.17/21.87 [2019-03-28 12:21:47,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.17/21.87 [2019-03-28 12:21:47,992 INFO L82 PathProgramCache]: Analyzing trace with hash 2284, now seen corresponding path program 1 times 40.17/21.87 [2019-03-28 12:21:47,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 40.17/21.87 [2019-03-28 12:21:47,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 40.17/21.87 [2019-03-28 12:21:48,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.17/21.87 [2019-03-28 12:21:48,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.17/21.87 [2019-03-28 12:21:48,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.17/21.87 [2019-03-28 12:21:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.17/21.87 [2019-03-28 12:21:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.17/21.87 [2019-03-28 12:21:48,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.17/21.87 [2019-03-28 12:21:48,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2319812, now seen corresponding path program 1 times 40.17/21.87 [2019-03-28 12:21:48,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 40.17/21.87 [2019-03-28 12:21:48,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 40.17/21.87 [2019-03-28 12:21:48,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.17/21.87 [2019-03-28 12:21:48,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.17/21.87 [2019-03-28 12:21:48,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.17/21.87 [2019-03-28 12:21:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.17/21.87 [2019-03-28 12:21:48,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 40.17/21.87 [2019-03-28 12:21:48,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 40.17/21.87 [2019-03-28 12:21:48,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 40.17/21.87 [2019-03-28 12:21:48,118 INFO L811 eck$LassoCheckResult]: loop already infeasible 40.17/21.87 [2019-03-28 12:21:48,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 40.17/21.87 [2019-03-28 12:21:48,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 40.17/21.87 [2019-03-28 12:21:48,137 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. 40.17/21.87 [2019-03-28 12:21:48,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 40.17/21.87 [2019-03-28 12:21:48,160 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. 40.17/21.87 [2019-03-28 12:21:48,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 40.17/21.87 [2019-03-28 12:21:48,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. 40.17/21.87 [2019-03-28 12:21:48,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 40.17/21.87 [2019-03-28 12:21:48,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 16 transitions. 40.17/21.87 [2019-03-28 12:21:48,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 40.17/21.87 [2019-03-28 12:21:48,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 40.17/21.87 [2019-03-28 12:21:48,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. 40.17/21.87 [2019-03-28 12:21:48,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 40.17/21.87 [2019-03-28 12:21:48,178 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. 40.17/21.87 [2019-03-28 12:21:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. 40.17/21.87 [2019-03-28 12:21:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. 40.17/21.87 [2019-03-28 12:21:48,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 40.17/21.87 [2019-03-28 12:21:48,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. 40.17/21.87 [2019-03-28 12:21:48,210 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. 40.17/21.87 [2019-03-28 12:21:48,210 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. 40.17/21.87 [2019-03-28 12:21:48,210 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 40.17/21.87 [2019-03-28 12:21:48,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. 40.17/21.87 [2019-03-28 12:21:48,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 40.17/21.87 [2019-03-28 12:21:48,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 40.17/21.87 [2019-03-28 12:21:48,211 INFO L119 BuchiIsEmpty]: Starting construction of run 40.17/21.87 [2019-03-28 12:21:48,212 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 40.17/21.87 [2019-03-28 12:21:48,212 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 40.17/21.87 [2019-03-28 12:21:48,212 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 5) InVars {} OutVars{ULTIMATE.start_main_#t~ret2=|v_ULTIMATE.start_main_#t~ret2_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~result~0] 32#L25 [52] L25-->fiboENTRY: Formula: (= |v_fibo_#in~nInParam_1| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_1|} AuxVars[] AssignedVars[fibo_#in~n]< 39#fiboENTRY 40.17/21.87 [2019-03-28 12:21:48,213 INFO L796 eck$LassoCheckResult]: Loop: 39#fiboENTRY [45] fiboENTRY-->L6: Formula: (= v_fibo_~n_1 |v_fibo_#in~n_1|) InVars {fibo_#in~n=|v_fibo_#in~n_1|} OutVars{fibo_~n=v_fibo_~n_1, fibo_#in~n=|v_fibo_#in~n_1|} AuxVars[] AssignedVars[fibo_~n] 40#L6 [56] L6-->L8: Formula: (>= v_fibo_~n_3 1) InVars {fibo_~n=v_fibo_~n_3} OutVars{fibo_~n=v_fibo_~n_3} AuxVars[] AssignedVars[] 38#L8 [60] L8-->L11: Formula: (> v_fibo_~n_5 1) InVars {fibo_~n=v_fibo_~n_5} OutVars{fibo_~n=v_fibo_~n_5} AuxVars[] AssignedVars[] 34#L11 [51] L11-->fiboENTRY: Formula: (= |v_fibo_#in~nInParam_2| (+ v_fibo_~n_8 (- 1))) InVars {fibo_~n=v_fibo_~n_8} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_2|} AuxVars[] AssignedVars[fibo_#in~n]< 39#fiboENTRY 40.17/21.87 [2019-03-28 12:21:48,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.17/21.87 [2019-03-28 12:21:48,213 INFO L82 PathProgramCache]: Analyzing trace with hash 2284, now seen corresponding path program 2 times 40.17/21.87 [2019-03-28 12:21:48,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 40.17/21.87 [2019-03-28 12:21:48,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 40.17/21.87 [2019-03-28 12:21:48,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.17/21.87 [2019-03-28 12:21:48,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.17/21.87 [2019-03-28 12:21:48,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.17/21.87 [2019-03-28 12:21:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.17/21.87 [2019-03-28 12:21:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.17/21.87 [2019-03-28 12:21:48,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.17/21.87 [2019-03-28 12:21:48,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2319843, now seen corresponding path program 1 times 40.17/21.87 [2019-03-28 12:21:48,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 40.17/21.87 [2019-03-28 12:21:48,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 40.17/21.87 [2019-03-28 12:21:48,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.17/21.87 [2019-03-28 12:21:48,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 40.17/21.87 [2019-03-28 12:21:48,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.17/21.87 [2019-03-28 12:21:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.17/21.87 [2019-03-28 12:21:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.17/21.87 [2019-03-28 12:21:48,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.17/21.87 [2019-03-28 12:21:48,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2110718286, now seen corresponding path program 1 times 40.17/21.87 [2019-03-28 12:21:48,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 40.17/21.87 [2019-03-28 12:21:48,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 40.17/21.87 [2019-03-28 12:21:48,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.17/21.87 [2019-03-28 12:21:48,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.17/21.87 [2019-03-28 12:21:48,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.17/21.87 [2019-03-28 12:21:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.17/21.87 [2019-03-28 12:21:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.17/21.87 [2019-03-28 12:21:48,305 INFO L216 LassoAnalysis]: Preferences: 40.17/21.87 [2019-03-28 12:21:48,306 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 40.17/21.87 [2019-03-28 12:21:48,306 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 40.17/21.87 [2019-03-28 12:21:48,306 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 40.17/21.87 [2019-03-28 12:21:48,306 INFO L127 ssoRankerPreferences]: Use exernal solver: true 40.17/21.87 [2019-03-28 12:21:48,307 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.17/21.87 [2019-03-28 12:21:48,307 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 40.17/21.87 [2019-03-28 12:21:48,307 INFO L130 ssoRankerPreferences]: Path of dumped script: 40.17/21.87 [2019-03-28 12:21:48,307 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 40.17/21.87 [2019-03-28 12:21:48,307 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 40.17/21.87 [2019-03-28 12:21:48,308 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 40.17/21.87 [2019-03-28 12:21:48,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.17/21.87 [2019-03-28 12:21:48,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.17/21.87 [2019-03-28 12:21:48,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.17/21.87 [2019-03-28 12:21:48,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.17/21.87 [2019-03-28 12:21:48,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.17/21.87 [2019-03-28 12:21:48,395 INFO L300 LassoAnalysis]: Preprocessing complete. 40.17/21.87 [2019-03-28 12:21:48,396 INFO L412 LassoAnalysis]: Checking for nontermination... 40.17/21.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.17/21.87 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.17/21.87 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.17/21.87 [2019-03-28 12:21:48,402 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.17/21.87 [2019-03-28 12:21:48,402 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.17/21.87 [2019-03-28 12:21:48,411 INFO L445 LassoAnalysis]: Proved nontermination for one component. 40.17/21.87 [2019-03-28 12:21:48,411 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_~n=0} Honda state: {fibo_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 40.17/21.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.17/21.87 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.17/21.87 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.17/21.87 [2019-03-28 12:21:48,440 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.17/21.87 [2019-03-28 12:21:48,440 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.17/21.87 [2019-03-28 12:21:48,445 INFO L445 LassoAnalysis]: Proved nontermination for one component. 40.17/21.87 [2019-03-28 12:21:48,445 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 40.17/21.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.17/21.87 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.17/21.87 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.17/21.87 [2019-03-28 12:21:48,472 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.17/21.87 [2019-03-28 12:21:48,472 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.17/21.87 [2019-03-28 12:21:48,476 INFO L445 LassoAnalysis]: Proved nontermination for one component. 40.17/21.87 [2019-03-28 12:21:48,476 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 40.17/21.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.17/21.87 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.17/21.87 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.17/21.87 [2019-03-28 12:21:48,505 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.17/21.87 [2019-03-28 12:21:48,505 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.17/21.87 [2019-03-28 12:21:48,509 INFO L445 LassoAnalysis]: Proved nontermination for one component. 40.17/21.87 [2019-03-28 12:21:48,509 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 40.17/21.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.17/21.87 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.17/21.87 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.17/21.87 [2019-03-28 12:21:48,538 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.17/21.87 [2019-03-28 12:21:48,538 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.17/21.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.17/21.87 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.17/21.87 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.17/21.87 [2019-03-28 12:21:48,569 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 40.17/21.87 [2019-03-28 12:21:48,569 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.17/21.87 [2019-03-28 12:21:48,600 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 40.17/21.87 [2019-03-28 12:21:48,602 INFO L216 LassoAnalysis]: Preferences: 40.17/21.87 [2019-03-28 12:21:48,602 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 40.17/21.87 [2019-03-28 12:21:48,602 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 40.17/21.87 [2019-03-28 12:21:48,603 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 40.17/21.87 [2019-03-28 12:21:48,603 INFO L127 ssoRankerPreferences]: Use exernal solver: false 40.17/21.87 [2019-03-28 12:21:48,603 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 40.17/21.87 [2019-03-28 12:21:48,603 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 40.17/21.87 [2019-03-28 12:21:48,603 INFO L130 ssoRankerPreferences]: Path of dumped script: 40.17/21.87 [2019-03-28 12:21:48,603 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 40.17/21.87 [2019-03-28 12:21:48,604 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 40.17/21.87 [2019-03-28 12:21:48,604 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 40.17/21.87 [2019-03-28 12:21:48,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.17/21.87 [2019-03-28 12:21:48,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.17/21.87 [2019-03-28 12:21:48,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.17/21.87 [2019-03-28 12:21:48,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.17/21.87 [2019-03-28 12:21:48,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.17/21.87 [2019-03-28 12:21:48,659 INFO L300 LassoAnalysis]: Preprocessing complete. 40.17/21.87 [2019-03-28 12:21:48,665 INFO L497 LassoAnalysis]: Using template 'affine'. 40.17/21.87 [2019-03-28 12:21:48,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.17/21.87 Termination analysis: LINEAR_WITH_GUESSES 40.17/21.87 Number of strict supporting invariants: 0 40.17/21.87 Number of non-strict supporting invariants: 1 40.17/21.87 Consider only non-deceasing supporting invariants: true 40.17/21.87 Simplify termination arguments: true 40.17/21.87 Simplify supporting invariants: trueOverapproximate stem: false 40.17/21.87 [2019-03-28 12:21:48,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.17/21.87 [2019-03-28 12:21:48,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.17/21.87 [2019-03-28 12:21:48,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.17/21.87 [2019-03-28 12:21:48,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.17/21.87 [2019-03-28 12:21:48,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.17/21.87 [2019-03-28 12:21:48,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.17/21.87 [2019-03-28 12:21:48,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.17/21.87 [2019-03-28 12:21:48,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 40.17/21.87 [2019-03-28 12:21:48,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.17/21.87 Termination analysis: LINEAR_WITH_GUESSES 40.17/21.87 Number of strict supporting invariants: 0 40.17/21.87 Number of non-strict supporting invariants: 1 40.17/21.87 Consider only non-deceasing supporting invariants: true 40.17/21.87 Simplify termination arguments: true 40.17/21.87 Simplify supporting invariants: trueOverapproximate stem: false 40.17/21.87 [2019-03-28 12:21:48,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.17/21.87 [2019-03-28 12:21:48,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.17/21.87 [2019-03-28 12:21:48,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.17/21.87 [2019-03-28 12:21:48,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.17/21.87 [2019-03-28 12:21:48,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.17/21.87 [2019-03-28 12:21:48,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.17/21.87 [2019-03-28 12:21:48,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.17/21.87 [2019-03-28 12:21:48,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 40.17/21.87 [2019-03-28 12:21:48,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.17/21.87 Termination analysis: LINEAR_WITH_GUESSES 40.17/21.87 Number of strict supporting invariants: 0 40.17/21.87 Number of non-strict supporting invariants: 1 40.17/21.87 Consider only non-deceasing supporting invariants: true 40.17/21.87 Simplify termination arguments: true 40.17/21.87 Simplify supporting invariants: trueOverapproximate stem: false 40.17/21.87 [2019-03-28 12:21:48,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.17/21.87 [2019-03-28 12:21:48,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.17/21.87 [2019-03-28 12:21:48,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.17/21.87 [2019-03-28 12:21:48,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.17/21.87 [2019-03-28 12:21:48,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.17/21.87 [2019-03-28 12:21:48,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.17/21.87 [2019-03-28 12:21:48,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.17/21.87 [2019-03-28 12:21:48,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 40.17/21.87 [2019-03-28 12:21:48,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.17/21.87 Termination analysis: LINEAR_WITH_GUESSES 40.17/21.87 Number of strict supporting invariants: 0 40.17/21.87 Number of non-strict supporting invariants: 1 40.17/21.87 Consider only non-deceasing supporting invariants: true 40.17/21.87 Simplify termination arguments: true 40.17/21.87 Simplify supporting invariants: trueOverapproximate stem: false 40.17/21.87 [2019-03-28 12:21:48,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.17/21.87 [2019-03-28 12:21:48,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.17/21.87 [2019-03-28 12:21:48,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.17/21.87 [2019-03-28 12:21:48,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.17/21.87 [2019-03-28 12:21:48,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.17/21.87 [2019-03-28 12:21:48,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.17/21.87 [2019-03-28 12:21:48,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.17/21.87 [2019-03-28 12:21:48,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 40.17/21.87 [2019-03-28 12:21:48,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.17/21.87 Termination analysis: LINEAR_WITH_GUESSES 40.17/21.87 Number of strict supporting invariants: 0 40.17/21.87 Number of non-strict supporting invariants: 1 40.17/21.87 Consider only non-deceasing supporting invariants: true 40.17/21.87 Simplify termination arguments: true 40.17/21.87 Simplify supporting invariants: trueOverapproximate stem: false 40.17/21.87 [2019-03-28 12:21:48,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.17/21.87 [2019-03-28 12:21:48,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.17/21.87 [2019-03-28 12:21:48,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.17/21.87 [2019-03-28 12:21:48,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.17/21.87 [2019-03-28 12:21:48,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.17/21.87 [2019-03-28 12:21:48,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.17/21.87 [2019-03-28 12:21:48,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.17/21.87 [2019-03-28 12:21:48,695 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 40.17/21.87 [2019-03-28 12:21:48,700 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 40.17/21.87 [2019-03-28 12:21:48,700 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 40.17/21.87 [2019-03-28 12:21:48,702 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 40.17/21.87 [2019-03-28 12:21:48,702 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 40.17/21.87 [2019-03-28 12:21:48,703 INFO L518 LassoAnalysis]: Proved termination. 40.17/21.87 [2019-03-28 12:21:48,703 INFO L520 LassoAnalysis]: Termination argument consisting of: 40.17/21.87 Ranking function f(fibo_#in~n) = 1*fibo_#in~n 40.17/21.87 Supporting invariants [] 40.17/21.87 [2019-03-28 12:21:48,704 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 40.17/21.87 [2019-03-28 12:21:48,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.17/21.87 [2019-03-28 12:21:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.17/21.87 [2019-03-28 12:21:48,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core 40.17/21.87 [2019-03-28 12:21:48,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.17/21.87 [2019-03-28 12:21:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.17/21.87 [2019-03-28 12:21:48,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core 40.17/21.87 [2019-03-28 12:21:48,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.17/21.87 [2019-03-28 12:21:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 40.17/21.87 [2019-03-28 12:21:48,812 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 40.17/21.87 [2019-03-28 12:21:48,815 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 40.17/21.87 [2019-03-28 12:21:48,816 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. 40.17/21.87 [2019-03-28 12:21:48,905 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 44 states and 57 transitions. Complement of second has 16 states. 40.17/21.87 [2019-03-28 12:21:48,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 40.25/21.87 [2019-03-28 12:21:48,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 40.25/21.87 [2019-03-28 12:21:48,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. 40.25/21.87 [2019-03-28 12:21:48,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. 40.25/21.87 [2019-03-28 12:21:48,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/21.87 [2019-03-28 12:21:48,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 4 letters. 40.25/21.87 [2019-03-28 12:21:48,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/21.87 [2019-03-28 12:21:48,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 8 letters. 40.25/21.87 [2019-03-28 12:21:48,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/21.87 [2019-03-28 12:21:48,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 57 transitions. 40.25/21.87 [2019-03-28 12:21:48,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 40.25/21.87 [2019-03-28 12:21:48,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 26 states and 36 transitions. 40.25/21.87 [2019-03-28 12:21:48,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 40.25/21.87 [2019-03-28 12:21:48,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 40.25/21.87 [2019-03-28 12:21:48,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. 40.25/21.87 [2019-03-28 12:21:48,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 40.25/21.87 [2019-03-28 12:21:48,925 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. 40.25/21.87 [2019-03-28 12:21:48,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. 40.25/21.87 [2019-03-28 12:21:48,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. 40.25/21.87 [2019-03-28 12:21:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 40.25/21.87 [2019-03-28 12:21:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. 40.25/21.87 [2019-03-28 12:21:48,929 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. 40.25/21.87 [2019-03-28 12:21:48,929 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. 40.25/21.87 [2019-03-28 12:21:48,930 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 40.25/21.87 [2019-03-28 12:21:48,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. 40.25/21.87 [2019-03-28 12:21:48,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 40.25/21.87 [2019-03-28 12:21:48,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 40.25/21.87 [2019-03-28 12:21:48,931 INFO L119 BuchiIsEmpty]: Starting construction of run 40.25/21.87 [2019-03-28 12:21:48,932 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 40.25/21.87 [2019-03-28 12:21:48,932 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 40.25/21.87 [2019-03-28 12:21:48,933 INFO L794 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 5) InVars {} OutVars{ULTIMATE.start_main_#t~ret2=|v_ULTIMATE.start_main_#t~ret2_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~result~0] 147#L25 [52] L25-->fiboENTRY: Formula: (= |v_fibo_#in~nInParam_1| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_1|} AuxVars[] AssignedVars[fibo_#in~n]< 151#fiboENTRY [45] fiboENTRY-->L6: Formula: (= v_fibo_~n_1 |v_fibo_#in~n_1|) InVars {fibo_#in~n=|v_fibo_#in~n_1|} OutVars{fibo_~n=v_fibo_~n_1, fibo_#in~n=|v_fibo_#in~n_1|} AuxVars[] AssignedVars[fibo_~n] 152#L6 [56] L6-->L8: Formula: (>= v_fibo_~n_3 1) InVars {fibo_~n=v_fibo_~n_3} OutVars{fibo_~n=v_fibo_~n_3} AuxVars[] AssignedVars[] 163#L8 [60] L8-->L11: Formula: (> v_fibo_~n_5 1) InVars {fibo_~n=v_fibo_~n_5} OutVars{fibo_~n=v_fibo_~n_5} AuxVars[] AssignedVars[] 142#L11 [51] L11-->fiboENTRY: Formula: (= |v_fibo_#in~nInParam_2| (+ v_fibo_~n_8 (- 1))) InVars {fibo_~n=v_fibo_~n_8} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_2|} AuxVars[] AssignedVars[fibo_#in~n]< 153#fiboENTRY [45] fiboENTRY-->L6: Formula: (= v_fibo_~n_1 |v_fibo_#in~n_1|) InVars {fibo_#in~n=|v_fibo_#in~n_1|} OutVars{fibo_~n=v_fibo_~n_1, fibo_#in~n=|v_fibo_#in~n_1|} AuxVars[] AssignedVars[fibo_~n] 155#L6 [39] L6-->fiboFINAL: Formula: (and (= |v_fibo_#res_1| 0) (< v_fibo_~n_2 1)) InVars {fibo_~n=v_fibo_~n_2} OutVars{fibo_~n=v_fibo_~n_2, fibo_#res=|v_fibo_#res_1|} AuxVars[] AssignedVars[fibo_#res] 148#fiboFINAL [42] fiboFINAL-->fiboEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 141#fiboEXIT >[54] fiboEXIT-->L11-1: AOR: Formula: (= |v_fibo_#t~ret0_4| |v_fibo_#resOutParam_2|) InVars {fibo_#res=|v_fibo_#resOutParam_2|} OutVars{fibo_#t~ret0=|v_fibo_#t~ret0_4|} AuxVars[] AssignedVars[fibo_#t~ret0] LVA: Formula: (= |v_fibo_#in~nInParam_2| (+ v_fibo_~n_8 (- 1))) InVars {fibo_~n=v_fibo_~n_8} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_2|} AuxVars[] AssignedVars[fibo_#in~n] 144#L11-1 [47] L11-1-->fiboENTRY: Formula: (= |v_fibo_#in~nInParam_3| (+ v_fibo_~n_9 (- 2))) InVars {fibo_~n=v_fibo_~n_9} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_3|} AuxVars[] AssignedVars[fibo_#in~n]< 159#fiboENTRY 40.25/21.87 [2019-03-28 12:21:48,933 INFO L796 eck$LassoCheckResult]: Loop: 159#fiboENTRY [45] fiboENTRY-->L6: Formula: (= v_fibo_~n_1 |v_fibo_#in~n_1|) InVars {fibo_#in~n=|v_fibo_#in~n_1|} OutVars{fibo_~n=v_fibo_~n_1, fibo_#in~n=|v_fibo_#in~n_1|} AuxVars[] AssignedVars[fibo_~n] 162#L6 [56] L6-->L8: Formula: (>= v_fibo_~n_3 1) InVars {fibo_~n=v_fibo_~n_3} OutVars{fibo_~n=v_fibo_~n_3} AuxVars[] AssignedVars[] 161#L8 [60] L8-->L11: Formula: (> v_fibo_~n_5 1) InVars {fibo_~n=v_fibo_~n_5} OutVars{fibo_~n=v_fibo_~n_5} AuxVars[] AssignedVars[] 157#L11 [51] L11-->fiboENTRY: Formula: (= |v_fibo_#in~nInParam_2| (+ v_fibo_~n_8 (- 1))) InVars {fibo_~n=v_fibo_~n_8} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_2|} AuxVars[] AssignedVars[fibo_#in~n]< 159#fiboENTRY 40.25/21.87 [2019-03-28 12:21:48,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/21.87 [2019-03-28 12:21:48,934 INFO L82 PathProgramCache]: Analyzing trace with hash 135274491, now seen corresponding path program 1 times 40.25/21.87 [2019-03-28 12:21:48,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 40.25/21.87 [2019-03-28 12:21:48,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 40.25/21.87 [2019-03-28 12:21:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/21.87 [2019-03-28 12:21:48,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.25/21.87 [2019-03-28 12:21:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/21.87 [2019-03-28 12:21:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/21.87 [2019-03-28 12:21:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 40.25/21.87 [2019-03-28 12:21:48,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 40.25/21.87 [2019-03-28 12:21:48,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 40.25/21.87 [2019-03-28 12:21:48,968 INFO L799 eck$LassoCheckResult]: stem already infeasible 40.25/21.87 [2019-03-28 12:21:48,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/21.87 [2019-03-28 12:21:48,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2319843, now seen corresponding path program 2 times 40.25/21.87 [2019-03-28 12:21:48,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 40.25/21.87 [2019-03-28 12:21:48,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 40.25/21.87 [2019-03-28 12:21:48,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/21.87 [2019-03-28 12:21:48,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.25/21.87 [2019-03-28 12:21:48,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/21.87 [2019-03-28 12:21:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.25/21.87 [2019-03-28 12:21:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.25/21.87 [2019-03-28 12:21:49,013 INFO L216 LassoAnalysis]: Preferences: 40.25/21.87 [2019-03-28 12:21:49,014 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 40.25/21.87 [2019-03-28 12:21:49,014 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 40.25/21.87 [2019-03-28 12:21:49,014 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 40.25/21.87 [2019-03-28 12:21:49,014 INFO L127 ssoRankerPreferences]: Use exernal solver: true 40.25/21.87 [2019-03-28 12:21:49,014 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/21.87 [2019-03-28 12:21:49,014 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 40.25/21.87 [2019-03-28 12:21:49,015 INFO L130 ssoRankerPreferences]: Path of dumped script: 40.25/21.87 [2019-03-28 12:21:49,015 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 40.25/21.87 [2019-03-28 12:21:49,015 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 40.25/21.87 [2019-03-28 12:21:49,015 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 40.25/21.87 [2019-03-28 12:21:49,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:49,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:49,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:49,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:49,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:49,061 INFO L300 LassoAnalysis]: Preprocessing complete. 40.25/21.87 [2019-03-28 12:21:49,062 INFO L412 LassoAnalysis]: Checking for nontermination... 40.25/21.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/21.87 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/21.87 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/21.87 [2019-03-28 12:21:49,065 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.25/21.87 [2019-03-28 12:21:49,065 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/21.87 [2019-03-28 12:21:49,069 INFO L445 LassoAnalysis]: Proved nontermination for one component. 40.25/21.87 [2019-03-28 12:21:49,069 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 40.25/21.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/21.87 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/21.87 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/21.87 [2019-03-28 12:21:49,098 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.25/21.87 [2019-03-28 12:21:49,098 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/21.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/21.87 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/21.87 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/21.87 [2019-03-28 12:21:49,130 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 40.25/21.87 [2019-03-28 12:21:49,131 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/21.87 [2019-03-28 12:21:49,162 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 40.25/21.87 [2019-03-28 12:21:49,164 INFO L216 LassoAnalysis]: Preferences: 40.25/21.87 [2019-03-28 12:21:49,164 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 40.25/21.87 [2019-03-28 12:21:49,165 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 40.25/21.87 [2019-03-28 12:21:49,165 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 40.25/21.87 [2019-03-28 12:21:49,165 INFO L127 ssoRankerPreferences]: Use exernal solver: false 40.25/21.87 [2019-03-28 12:21:49,165 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 40.25/21.87 [2019-03-28 12:21:49,165 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 40.25/21.87 [2019-03-28 12:21:49,165 INFO L130 ssoRankerPreferences]: Path of dumped script: 40.25/21.87 [2019-03-28 12:21:49,166 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 40.25/21.87 [2019-03-28 12:21:49,166 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 40.25/21.87 [2019-03-28 12:21:49,166 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 40.25/21.87 [2019-03-28 12:21:49,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:49,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:49,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:49,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:49,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:49,240 INFO L300 LassoAnalysis]: Preprocessing complete. 40.25/21.87 [2019-03-28 12:21:49,241 INFO L497 LassoAnalysis]: Using template 'affine'. 40.25/21.87 [2019-03-28 12:21:49,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/21.87 Termination analysis: LINEAR_WITH_GUESSES 40.25/21.87 Number of strict supporting invariants: 0 40.25/21.87 Number of non-strict supporting invariants: 1 40.25/21.87 Consider only non-deceasing supporting invariants: true 40.25/21.87 Simplify termination arguments: true 40.25/21.87 Simplify supporting invariants: trueOverapproximate stem: false 40.25/21.87 [2019-03-28 12:21:49,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/21.87 [2019-03-28 12:21:49,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/21.87 [2019-03-28 12:21:49,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/21.87 [2019-03-28 12:21:49,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/21.87 [2019-03-28 12:21:49,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/21.87 [2019-03-28 12:21:49,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/21.87 [2019-03-28 12:21:49,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/21.87 [2019-03-28 12:21:49,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 40.25/21.87 [2019-03-28 12:21:49,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/21.87 Termination analysis: LINEAR_WITH_GUESSES 40.25/21.87 Number of strict supporting invariants: 0 40.25/21.87 Number of non-strict supporting invariants: 1 40.25/21.87 Consider only non-deceasing supporting invariants: true 40.25/21.87 Simplify termination arguments: true 40.25/21.87 Simplify supporting invariants: trueOverapproximate stem: false 40.25/21.87 [2019-03-28 12:21:49,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/21.87 [2019-03-28 12:21:49,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/21.87 [2019-03-28 12:21:49,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/21.87 [2019-03-28 12:21:49,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/21.87 [2019-03-28 12:21:49,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/21.87 [2019-03-28 12:21:49,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/21.87 [2019-03-28 12:21:49,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/21.87 [2019-03-28 12:21:49,253 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 40.25/21.87 [2019-03-28 12:21:49,256 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 40.25/21.87 [2019-03-28 12:21:49,256 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 40.25/21.87 [2019-03-28 12:21:49,257 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 40.25/21.87 [2019-03-28 12:21:49,257 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 40.25/21.87 [2019-03-28 12:21:49,257 INFO L518 LassoAnalysis]: Proved termination. 40.25/21.87 [2019-03-28 12:21:49,257 INFO L520 LassoAnalysis]: Termination argument consisting of: 40.25/21.87 Ranking function f(fibo_#in~n) = 1*fibo_#in~n 40.25/21.87 Supporting invariants [] 40.25/21.87 [2019-03-28 12:21:49,258 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 40.25/21.87 [2019-03-28 12:21:49,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/21.87 [2019-03-28 12:21:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/21.87 [2019-03-28 12:21:49,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core 40.25/21.87 [2019-03-28 12:21:49,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/21.87 [2019-03-28 12:21:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/21.87 [2019-03-28 12:21:49,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core 40.25/21.87 [2019-03-28 12:21:49,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/21.87 [2019-03-28 12:21:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 40.25/21.87 [2019-03-28 12:21:49,418 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 40.25/21.87 [2019-03-28 12:21:49,418 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates 40.25/21.87 [2019-03-28 12:21:49,419 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 23 states and 31 transitions. cyclomatic complexity: 10 Second operand 5 states. 40.25/21.87 [2019-03-28 12:21:49,597 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 23 states and 31 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 57 states and 80 transitions. Complement of second has 17 states. 40.25/21.87 [2019-03-28 12:21:49,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states 40.25/21.87 [2019-03-28 12:21:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 40.25/21.87 [2019-03-28 12:21:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. 40.25/21.87 [2019-03-28 12:21:49,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 11 letters. Loop has 4 letters. 40.25/21.87 [2019-03-28 12:21:49,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/21.87 [2019-03-28 12:21:49,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 15 letters. Loop has 4 letters. 40.25/21.87 [2019-03-28 12:21:49,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/21.87 [2019-03-28 12:21:49,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 11 letters. Loop has 8 letters. 40.25/21.87 [2019-03-28 12:21:49,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/21.87 [2019-03-28 12:21:49,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 80 transitions. 40.25/21.87 [2019-03-28 12:21:49,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 40.25/21.87 [2019-03-28 12:21:49,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 42 states and 61 transitions. 40.25/21.87 [2019-03-28 12:21:49,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 40.25/21.87 [2019-03-28 12:21:49,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 40.25/21.87 [2019-03-28 12:21:49,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 61 transitions. 40.25/21.87 [2019-03-28 12:21:49,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 40.25/21.87 [2019-03-28 12:21:49,609 INFO L706 BuchiCegarLoop]: Abstraction has 42 states and 61 transitions. 40.25/21.87 [2019-03-28 12:21:49,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 61 transitions. 40.25/21.87 [2019-03-28 12:21:49,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. 40.25/21.87 [2019-03-28 12:21:49,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 40.25/21.87 [2019-03-28 12:21:49,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. 40.25/21.87 [2019-03-28 12:21:49,615 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. 40.25/21.87 [2019-03-28 12:21:49,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 40.25/21.87 [2019-03-28 12:21:49,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 40.25/21.87 [2019-03-28 12:21:49,616 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 5 states. 40.25/21.87 [2019-03-28 12:21:49,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 40.25/21.87 [2019-03-28 12:21:49,683 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. 40.25/21.87 [2019-03-28 12:21:49,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 40.25/21.87 [2019-03-28 12:21:49,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 46 transitions. 40.25/21.87 [2019-03-28 12:21:49,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 40.25/21.87 [2019-03-28 12:21:49,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 34 states and 42 transitions. 40.25/21.87 [2019-03-28 12:21:49,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 40.25/21.87 [2019-03-28 12:21:49,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 40.25/21.87 [2019-03-28 12:21:49,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. 40.25/21.87 [2019-03-28 12:21:49,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 40.25/21.87 [2019-03-28 12:21:49,690 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. 40.25/21.87 [2019-03-28 12:21:49,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. 40.25/21.87 [2019-03-28 12:21:49,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. 40.25/21.87 [2019-03-28 12:21:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 40.25/21.87 [2019-03-28 12:21:49,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. 40.25/21.87 [2019-03-28 12:21:49,694 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. 40.25/21.87 [2019-03-28 12:21:49,694 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. 40.25/21.87 [2019-03-28 12:21:49,694 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 40.25/21.87 [2019-03-28 12:21:49,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 40 transitions. 40.25/21.87 [2019-03-28 12:21:49,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 40.25/21.87 [2019-03-28 12:21:49,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 40.25/21.87 [2019-03-28 12:21:49,696 INFO L119 BuchiIsEmpty]: Starting construction of run 40.25/21.87 [2019-03-28 12:21:49,697 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 40.25/21.87 [2019-03-28 12:21:49,697 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] 40.25/21.87 [2019-03-28 12:21:49,697 INFO L794 eck$LassoCheckResult]: Stem: 389#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 5) InVars {} OutVars{ULTIMATE.start_main_#t~ret2=|v_ULTIMATE.start_main_#t~ret2_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~result~0] 390#L25 [52] L25-->fiboENTRY: Formula: (= |v_fibo_#in~nInParam_1| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_1|} AuxVars[] AssignedVars[fibo_#in~n]< 405#fiboENTRY [45] fiboENTRY-->L6: Formula: (= v_fibo_~n_1 |v_fibo_#in~n_1|) InVars {fibo_#in~n=|v_fibo_#in~n_1|} OutVars{fibo_~n=v_fibo_~n_1, fibo_#in~n=|v_fibo_#in~n_1|} AuxVars[] AssignedVars[fibo_~n] 411#L6 [56] L6-->L8: Formula: (>= v_fibo_~n_3 1) InVars {fibo_~n=v_fibo_~n_3} OutVars{fibo_~n=v_fibo_~n_3} AuxVars[] AssignedVars[] 409#L8 [60] L8-->L11: Formula: (> v_fibo_~n_5 1) InVars {fibo_~n=v_fibo_~n_5} OutVars{fibo_~n=v_fibo_~n_5} AuxVars[] AssignedVars[] 403#L11 [51] L11-->fiboENTRY: Formula: (= |v_fibo_#in~nInParam_2| (+ v_fibo_~n_8 (- 1))) InVars {fibo_~n=v_fibo_~n_8} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_2|} AuxVars[] AssignedVars[fibo_#in~n]< 408#fiboENTRY [45] fiboENTRY-->L6: Formula: (= v_fibo_~n_1 |v_fibo_#in~n_1|) InVars {fibo_#in~n=|v_fibo_#in~n_1|} OutVars{fibo_~n=v_fibo_~n_1, fibo_#in~n=|v_fibo_#in~n_1|} AuxVars[] AssignedVars[fibo_~n] 414#L6 [56] L6-->L8: Formula: (>= v_fibo_~n_3 1) InVars {fibo_~n=v_fibo_~n_3} OutVars{fibo_~n=v_fibo_~n_3} AuxVars[] AssignedVars[] 415#L8 [43] L8-->fiboFINAL: Formula: (and (= v_fibo_~n_4 1) (= |v_fibo_#res_2| 1)) InVars {fibo_~n=v_fibo_~n_4} OutVars{fibo_~n=v_fibo_~n_4, fibo_#res=|v_fibo_#res_2|} AuxVars[] AssignedVars[fibo_#res] 410#fiboFINAL [42] fiboFINAL-->fiboEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 407#fiboEXIT >[54] fiboEXIT-->L11-1: AOR: Formula: (= |v_fibo_#t~ret0_4| |v_fibo_#resOutParam_2|) InVars {fibo_#res=|v_fibo_#resOutParam_2|} OutVars{fibo_#t~ret0=|v_fibo_#t~ret0_4|} AuxVars[] AssignedVars[fibo_#t~ret0] LVA: Formula: (= |v_fibo_#in~nInParam_2| (+ v_fibo_~n_8 (- 1))) InVars {fibo_~n=v_fibo_~n_8} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_2|} AuxVars[] AssignedVars[fibo_#in~n] 392#L11-1 [47] L11-1-->fiboENTRY: Formula: (= |v_fibo_#in~nInParam_3| (+ v_fibo_~n_9 (- 2))) InVars {fibo_~n=v_fibo_~n_9} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_3|} AuxVars[] AssignedVars[fibo_#in~n]< 396#fiboENTRY 40.25/21.87 [2019-03-28 12:21:49,698 INFO L796 eck$LassoCheckResult]: Loop: 396#fiboENTRY [45] fiboENTRY-->L6: Formula: (= v_fibo_~n_1 |v_fibo_#in~n_1|) InVars {fibo_#in~n=|v_fibo_#in~n_1|} OutVars{fibo_~n=v_fibo_~n_1, fibo_#in~n=|v_fibo_#in~n_1|} AuxVars[] AssignedVars[fibo_~n] 397#L6 [56] L6-->L8: Formula: (>= v_fibo_~n_3 1) InVars {fibo_~n=v_fibo_~n_3} OutVars{fibo_~n=v_fibo_~n_3} AuxVars[] AssignedVars[] 395#L8 [60] L8-->L11: Formula: (> v_fibo_~n_5 1) InVars {fibo_~n=v_fibo_~n_5} OutVars{fibo_~n=v_fibo_~n_5} AuxVars[] AssignedVars[] 387#L11 [51] L11-->fiboENTRY: Formula: (= |v_fibo_#in~nInParam_2| (+ v_fibo_~n_8 (- 1))) InVars {fibo_~n=v_fibo_~n_8} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_2|} AuxVars[] AssignedVars[fibo_#in~n]< 399#fiboENTRY [45] fiboENTRY-->L6: Formula: (= v_fibo_~n_1 |v_fibo_#in~n_1|) InVars {fibo_#in~n=|v_fibo_#in~n_1|} OutVars{fibo_~n=v_fibo_~n_1, fibo_#in~n=|v_fibo_#in~n_1|} AuxVars[] AssignedVars[fibo_~n] 400#L6 [56] L6-->L8: Formula: (>= v_fibo_~n_3 1) InVars {fibo_~n=v_fibo_~n_3} OutVars{fibo_~n=v_fibo_~n_3} AuxVars[] AssignedVars[] 417#L8 [43] L8-->fiboFINAL: Formula: (and (= v_fibo_~n_4 1) (= |v_fibo_#res_2| 1)) InVars {fibo_~n=v_fibo_~n_4} OutVars{fibo_~n=v_fibo_~n_4, fibo_#res=|v_fibo_#res_2|} AuxVars[] AssignedVars[fibo_#res] 416#fiboFINAL [42] fiboFINAL-->fiboEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 386#fiboEXIT >[54] fiboEXIT-->L11-1: AOR: Formula: (= |v_fibo_#t~ret0_4| |v_fibo_#resOutParam_2|) InVars {fibo_#res=|v_fibo_#resOutParam_2|} OutVars{fibo_#t~ret0=|v_fibo_#t~ret0_4|} AuxVars[] AssignedVars[fibo_#t~ret0] LVA: Formula: (= |v_fibo_#in~nInParam_2| (+ v_fibo_~n_8 (- 1))) InVars {fibo_~n=v_fibo_~n_8} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_2|} AuxVars[] AssignedVars[fibo_#in~n] 388#L11-1 [47] L11-1-->fiboENTRY: Formula: (= |v_fibo_#in~nInParam_3| (+ v_fibo_~n_9 (- 2))) InVars {fibo_~n=v_fibo_~n_9} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_3|} AuxVars[] AssignedVars[fibo_#in~n]< 396#fiboENTRY 40.25/21.87 [2019-03-28 12:21:49,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/21.87 [2019-03-28 12:21:49,698 INFO L82 PathProgramCache]: Analyzing trace with hash -85739695, now seen corresponding path program 1 times 40.25/21.87 [2019-03-28 12:21:49,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 40.25/21.87 [2019-03-28 12:21:49,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 40.25/21.87 [2019-03-28 12:21:49,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/21.87 [2019-03-28 12:21:49,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 40.25/21.87 [2019-03-28 12:21:49,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/21.87 [2019-03-28 12:21:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/21.87 [2019-03-28 12:21:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 40.25/21.87 [2019-03-28 12:21:49,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 40.25/21.87 [2019-03-28 12:21:49,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 40.25/21.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/21.87 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 40.25/21.87 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 40.25/21.87 [2019-03-28 12:21:49,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.25/21.87 [2019-03-28 12:21:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/21.87 [2019-03-28 12:21:49,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjunts are in the unsatisfiable core 40.25/21.87 [2019-03-28 12:21:49,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/21.87 [2019-03-28 12:21:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 40.25/21.87 [2019-03-28 12:21:49,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 40.25/21.87 [2019-03-28 12:21:49,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 40.25/21.87 [2019-03-28 12:21:49,798 INFO L799 eck$LassoCheckResult]: stem already infeasible 40.25/21.87 [2019-03-28 12:21:49,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/21.87 [2019-03-28 12:21:49,798 INFO L82 PathProgramCache]: Analyzing trace with hash 660445222, now seen corresponding path program 1 times 40.25/21.87 [2019-03-28 12:21:49,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 40.25/21.87 [2019-03-28 12:21:49,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 40.25/21.87 [2019-03-28 12:21:49,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/21.87 [2019-03-28 12:21:49,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.25/21.87 [2019-03-28 12:21:49,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/21.87 [2019-03-28 12:21:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.25/21.87 [2019-03-28 12:21:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.25/21.87 [2019-03-28 12:21:49,916 INFO L216 LassoAnalysis]: Preferences: 40.25/21.87 [2019-03-28 12:21:49,916 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 40.25/21.87 [2019-03-28 12:21:49,916 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 40.25/21.87 [2019-03-28 12:21:49,916 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 40.25/21.87 [2019-03-28 12:21:49,916 INFO L127 ssoRankerPreferences]: Use exernal solver: true 40.25/21.87 [2019-03-28 12:21:49,917 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/21.87 [2019-03-28 12:21:49,917 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 40.25/21.87 [2019-03-28 12:21:49,917 INFO L130 ssoRankerPreferences]: Path of dumped script: 40.25/21.87 [2019-03-28 12:21:49,917 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 40.25/21.87 [2019-03-28 12:21:49,917 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 40.25/21.87 [2019-03-28 12:21:49,917 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 40.25/21.87 [2019-03-28 12:21:49,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:49,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:49,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:49,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:49,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:49,951 INFO L300 LassoAnalysis]: Preprocessing complete. 40.25/21.87 [2019-03-28 12:21:49,951 INFO L412 LassoAnalysis]: Checking for nontermination... 40.25/21.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/21.87 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/21.87 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/21.87 [2019-03-28 12:21:49,954 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.25/21.87 [2019-03-28 12:21:49,954 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/21.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/21.87 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/21.87 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/21.87 [2019-03-28 12:21:49,984 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 40.25/21.87 [2019-03-28 12:21:49,984 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/21.87 [2019-03-28 12:21:49,989 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 40.25/21.87 [2019-03-28 12:21:50,013 INFO L216 LassoAnalysis]: Preferences: 40.25/21.87 [2019-03-28 12:21:50,013 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 40.25/21.87 [2019-03-28 12:21:50,014 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 40.25/21.87 [2019-03-28 12:21:50,014 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 40.25/21.87 [2019-03-28 12:21:50,014 INFO L127 ssoRankerPreferences]: Use exernal solver: false 40.25/21.87 [2019-03-28 12:21:50,014 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 40.25/21.87 [2019-03-28 12:21:50,014 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 40.25/21.87 [2019-03-28 12:21:50,014 INFO L130 ssoRankerPreferences]: Path of dumped script: 40.25/21.87 [2019-03-28 12:21:50,014 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 40.25/21.87 [2019-03-28 12:21:50,014 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 40.25/21.87 [2019-03-28 12:21:50,015 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 40.25/21.87 [2019-03-28 12:21:50,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:50,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:50,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:50,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:50,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:50,051 INFO L300 LassoAnalysis]: Preprocessing complete. 40.25/21.87 [2019-03-28 12:21:50,051 INFO L497 LassoAnalysis]: Using template 'affine'. 40.25/21.87 [2019-03-28 12:21:50,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/21.87 Termination analysis: LINEAR_WITH_GUESSES 40.25/21.87 Number of strict supporting invariants: 0 40.25/21.87 Number of non-strict supporting invariants: 1 40.25/21.87 Consider only non-deceasing supporting invariants: true 40.25/21.87 Simplify termination arguments: true 40.25/21.87 Simplify supporting invariants: trueOverapproximate stem: false 40.25/21.87 [2019-03-28 12:21:50,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/21.87 [2019-03-28 12:21:50,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/21.87 [2019-03-28 12:21:50,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/21.87 [2019-03-28 12:21:50,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/21.87 [2019-03-28 12:21:50,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/21.87 [2019-03-28 12:21:50,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/21.87 [2019-03-28 12:21:50,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/21.87 [2019-03-28 12:21:50,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 40.25/21.87 [2019-03-28 12:21:50,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/21.87 Termination analysis: LINEAR_WITH_GUESSES 40.25/21.87 Number of strict supporting invariants: 0 40.25/21.87 Number of non-strict supporting invariants: 1 40.25/21.87 Consider only non-deceasing supporting invariants: true 40.25/21.87 Simplify termination arguments: true 40.25/21.87 Simplify supporting invariants: trueOverapproximate stem: false 40.25/21.87 [2019-03-28 12:21:50,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/21.87 [2019-03-28 12:21:50,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/21.87 [2019-03-28 12:21:50,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/21.87 [2019-03-28 12:21:50,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/21.87 [2019-03-28 12:21:50,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/21.87 [2019-03-28 12:21:50,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/21.87 [2019-03-28 12:21:50,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/21.87 [2019-03-28 12:21:50,060 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 40.25/21.87 [2019-03-28 12:21:50,063 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 40.25/21.87 [2019-03-28 12:21:50,064 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 40.25/21.87 [2019-03-28 12:21:50,064 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 40.25/21.87 [2019-03-28 12:21:50,064 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 40.25/21.87 [2019-03-28 12:21:50,064 INFO L518 LassoAnalysis]: Proved termination. 40.25/21.87 [2019-03-28 12:21:50,065 INFO L520 LassoAnalysis]: Termination argument consisting of: 40.25/21.87 Ranking function f(fibo_#in~n) = 1*fibo_#in~n 40.25/21.87 Supporting invariants [] 40.25/21.87 [2019-03-28 12:21:50,065 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 40.25/21.87 [2019-03-28 12:21:50,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/21.87 [2019-03-28 12:21:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/21.87 [2019-03-28 12:21:50,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core 40.25/21.87 [2019-03-28 12:21:50,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/21.87 [2019-03-28 12:21:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/21.87 [2019-03-28 12:21:50,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core 40.25/21.87 [2019-03-28 12:21:50,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/21.87 [2019-03-28 12:21:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 40.25/21.87 [2019-03-28 12:21:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/21.87 [2019-03-28 12:21:50,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core 40.25/21.87 [2019-03-28 12:21:50,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/21.87 [2019-03-28 12:21:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.25/21.87 [2019-03-28 12:21:50,347 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 40.25/21.87 [2019-03-28 12:21:50,347 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 11 predicates after loop cannibalization 40.25/21.87 [2019-03-28 12:21:50,348 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 11 loop predicates 40.25/21.87 [2019-03-28 12:21:50,348 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 32 states and 40 transitions. cyclomatic complexity: 10 Second operand 6 states. 40.25/21.87 [2019-03-28 12:21:51,885 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 32 states and 40 transitions. cyclomatic complexity: 10. Second operand 6 states. Result 7293 states and 11760 transitions. Complement of second has 3018 states. 40.25/21.87 [2019-03-28 12:21:51,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 2 stem states 16 non-accepting loop states 1 accepting loop states 40.25/21.87 [2019-03-28 12:21:51,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 40.25/21.87 [2019-03-28 12:21:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. 40.25/21.87 [2019-03-28 12:21:51,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 102 transitions. Stem has 12 letters. Loop has 10 letters. 40.25/21.87 [2019-03-28 12:21:51,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/21.87 [2019-03-28 12:21:51,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 102 transitions. Stem has 22 letters. Loop has 10 letters. 40.25/21.87 [2019-03-28 12:21:51,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/21.87 [2019-03-28 12:21:51,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 102 transitions. Stem has 12 letters. Loop has 20 letters. 40.25/21.87 [2019-03-28 12:21:51,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/21.87 [2019-03-28 12:21:51,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7293 states and 11760 transitions. 40.25/21.87 [2019-03-28 12:21:52,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 40.25/21.87 [2019-03-28 12:21:52,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7293 states to 157 states and 212 transitions. 40.25/21.87 [2019-03-28 12:21:52,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 40.25/21.87 [2019-03-28 12:21:52,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 40.25/21.87 [2019-03-28 12:21:52,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 212 transitions. 40.25/21.87 [2019-03-28 12:21:52,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 40.25/21.87 [2019-03-28 12:21:52,047 INFO L706 BuchiCegarLoop]: Abstraction has 157 states and 212 transitions. 40.25/21.87 [2019-03-28 12:21:52,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 212 transitions. 40.25/21.87 [2019-03-28 12:21:52,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 99. 40.25/21.87 [2019-03-28 12:21:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. 40.25/21.87 [2019-03-28 12:21:52,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 128 transitions. 40.25/21.87 [2019-03-28 12:21:52,064 INFO L729 BuchiCegarLoop]: Abstraction has 99 states and 128 transitions. 40.25/21.87 [2019-03-28 12:21:52,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 40.25/21.87 [2019-03-28 12:21:52,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 40.25/21.87 [2019-03-28 12:21:52,065 INFO L87 Difference]: Start difference. First operand 99 states and 128 transitions. Second operand 7 states. 40.25/21.87 [2019-03-28 12:21:52,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 40.25/21.87 [2019-03-28 12:21:52,154 INFO L93 Difference]: Finished difference Result 106 states and 138 transitions. 40.25/21.87 [2019-03-28 12:21:52,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 40.25/21.87 [2019-03-28 12:21:52,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 138 transitions. 40.25/21.87 [2019-03-28 12:21:52,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 40.25/21.87 [2019-03-28 12:21:52,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 106 states and 138 transitions. 40.25/21.87 [2019-03-28 12:21:52,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 40.25/21.87 [2019-03-28 12:21:52,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 40.25/21.87 [2019-03-28 12:21:52,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 138 transitions. 40.25/21.87 [2019-03-28 12:21:52,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 40.25/21.87 [2019-03-28 12:21:52,164 INFO L706 BuchiCegarLoop]: Abstraction has 106 states and 138 transitions. 40.25/21.87 [2019-03-28 12:21:52,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 138 transitions. 40.25/21.87 [2019-03-28 12:21:52,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. 40.25/21.87 [2019-03-28 12:21:52,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. 40.25/21.87 [2019-03-28 12:21:52,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 126 transitions. 40.25/21.87 [2019-03-28 12:21:52,173 INFO L729 BuchiCegarLoop]: Abstraction has 98 states and 126 transitions. 40.25/21.87 [2019-03-28 12:21:52,174 INFO L609 BuchiCegarLoop]: Abstraction has 98 states and 126 transitions. 40.25/21.87 [2019-03-28 12:21:52,174 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 40.25/21.87 [2019-03-28 12:21:52,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 126 transitions. 40.25/21.87 [2019-03-28 12:21:52,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 40.25/21.87 [2019-03-28 12:21:52,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 40.25/21.87 [2019-03-28 12:21:52,175 INFO L119 BuchiIsEmpty]: Starting construction of run 40.25/21.87 [2019-03-28 12:21:52,176 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] 40.25/21.87 [2019-03-28 12:21:52,177 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 40.25/21.87 [2019-03-28 12:21:52,177 INFO L794 eck$LassoCheckResult]: Stem: 11134#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 5) InVars {} OutVars{ULTIMATE.start_main_#t~ret2=|v_ULTIMATE.start_main_#t~ret2_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~result~0] 11135#L25 [52] L25-->fiboENTRY: Formula: (= |v_fibo_#in~nInParam_1| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_1|} AuxVars[] AssignedVars[fibo_#in~n]< 11159#fiboENTRY [45] fiboENTRY-->L6: Formula: (= v_fibo_~n_1 |v_fibo_#in~n_1|) InVars {fibo_#in~n=|v_fibo_#in~n_1|} OutVars{fibo_~n=v_fibo_~n_1, fibo_#in~n=|v_fibo_#in~n_1|} AuxVars[] AssignedVars[fibo_~n] 11176#L6 [56] L6-->L8: Formula: (>= v_fibo_~n_3 1) InVars {fibo_~n=v_fibo_~n_3} OutVars{fibo_~n=v_fibo_~n_3} AuxVars[] AssignedVars[] 11173#L8 [60] L8-->L11: Formula: (> v_fibo_~n_5 1) InVars {fibo_~n=v_fibo_~n_5} OutVars{fibo_~n=v_fibo_~n_5} AuxVars[] AssignedVars[] 11170#L11 [51] L11-->fiboENTRY: Formula: (= |v_fibo_#in~nInParam_2| (+ v_fibo_~n_8 (- 1))) InVars {fibo_~n=v_fibo_~n_8} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_2|} AuxVars[] AssignedVars[fibo_#in~n]< 11171#fiboENTRY [45] fiboENTRY-->L6: Formula: (= v_fibo_~n_1 |v_fibo_#in~n_1|) InVars {fibo_#in~n=|v_fibo_#in~n_1|} OutVars{fibo_~n=v_fibo_~n_1, fibo_#in~n=|v_fibo_#in~n_1|} AuxVars[] AssignedVars[fibo_~n] 11180#L6 [56] L6-->L8: Formula: (>= v_fibo_~n_3 1) InVars {fibo_~n=v_fibo_~n_3} OutVars{fibo_~n=v_fibo_~n_3} AuxVars[] AssignedVars[] 11175#L8 [60] L8-->L11: Formula: (> v_fibo_~n_5 1) InVars {fibo_~n=v_fibo_~n_5} OutVars{fibo_~n=v_fibo_~n_5} AuxVars[] AssignedVars[] 11169#L11 [51] L11-->fiboENTRY: Formula: (= |v_fibo_#in~nInParam_2| (+ v_fibo_~n_8 (- 1))) InVars {fibo_~n=v_fibo_~n_8} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_2|} AuxVars[] AssignedVars[fibo_#in~n]< 11171#fiboENTRY [45] fiboENTRY-->L6: Formula: (= v_fibo_~n_1 |v_fibo_#in~n_1|) InVars {fibo_#in~n=|v_fibo_#in~n_1|} OutVars{fibo_~n=v_fibo_~n_1, fibo_#in~n=|v_fibo_#in~n_1|} AuxVars[] AssignedVars[fibo_~n] 11180#L6 [56] L6-->L8: Formula: (>= v_fibo_~n_3 1) InVars {fibo_~n=v_fibo_~n_3} OutVars{fibo_~n=v_fibo_~n_3} AuxVars[] AssignedVars[] 11175#L8 [60] L8-->L11: Formula: (> v_fibo_~n_5 1) InVars {fibo_~n=v_fibo_~n_5} OutVars{fibo_~n=v_fibo_~n_5} AuxVars[] AssignedVars[] 11169#L11 [51] L11-->fiboENTRY: Formula: (= |v_fibo_#in~nInParam_2| (+ v_fibo_~n_8 (- 1))) InVars {fibo_~n=v_fibo_~n_8} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_2|} AuxVars[] AssignedVars[fibo_#in~n]< 11171#fiboENTRY [45] fiboENTRY-->L6: Formula: (= v_fibo_~n_1 |v_fibo_#in~n_1|) InVars {fibo_#in~n=|v_fibo_#in~n_1|} OutVars{fibo_~n=v_fibo_~n_1, fibo_#in~n=|v_fibo_#in~n_1|} AuxVars[] AssignedVars[fibo_~n] 11181#L6 [56] L6-->L8: Formula: (>= v_fibo_~n_3 1) InVars {fibo_~n=v_fibo_~n_3} OutVars{fibo_~n=v_fibo_~n_3} AuxVars[] AssignedVars[] 11185#L8 [43] L8-->fiboFINAL: Formula: (and (= v_fibo_~n_4 1) (= |v_fibo_#res_2| 1)) InVars {fibo_~n=v_fibo_~n_4} OutVars{fibo_~n=v_fibo_~n_4, fibo_#res=|v_fibo_#res_2|} AuxVars[] AssignedVars[fibo_#res] 11184#fiboFINAL [42] fiboFINAL-->fiboEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 11183#fiboEXIT >[54] fiboEXIT-->L11-1: AOR: Formula: (= |v_fibo_#t~ret0_4| |v_fibo_#resOutParam_2|) InVars {fibo_#res=|v_fibo_#resOutParam_2|} OutVars{fibo_#t~ret0=|v_fibo_#t~ret0_4|} AuxVars[] AssignedVars[fibo_#t~ret0] LVA: Formula: (= |v_fibo_#in~nInParam_2| (+ v_fibo_~n_8 (- 1))) InVars {fibo_~n=v_fibo_~n_8} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_2|} AuxVars[] AssignedVars[fibo_#in~n] 11178#L11-1 [47] L11-1-->fiboENTRY: Formula: (= |v_fibo_#in~nInParam_3| (+ v_fibo_~n_9 (- 2))) InVars {fibo_~n=v_fibo_~n_9} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_3|} AuxVars[] AssignedVars[fibo_#in~n]< 11179#fiboENTRY [45] fiboENTRY-->L6: Formula: (= v_fibo_~n_1 |v_fibo_#in~n_1|) InVars {fibo_#in~n=|v_fibo_#in~n_1|} OutVars{fibo_~n=v_fibo_~n_1, fibo_#in~n=|v_fibo_#in~n_1|} AuxVars[] AssignedVars[fibo_~n] 11215#L6 [39] L6-->fiboFINAL: Formula: (and (= |v_fibo_#res_1| 0) (< v_fibo_~n_2 1)) InVars {fibo_~n=v_fibo_~n_2} OutVars{fibo_~n=v_fibo_~n_2, fibo_#res=|v_fibo_#res_1|} AuxVars[] AssignedVars[fibo_#res] 11221#fiboFINAL [42] fiboFINAL-->fiboEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 11216#fiboEXIT >[53] fiboEXIT-->L11-2: AOR: Formula: (= |v_fibo_#t~ret1_4| |v_fibo_#resOutParam_3|) InVars {fibo_#res=|v_fibo_#resOutParam_3|} OutVars{fibo_#t~ret1=|v_fibo_#t~ret1_4|} AuxVars[] AssignedVars[fibo_#t~ret1] LVA: Formula: (= |v_fibo_#in~nInParam_3| (+ v_fibo_~n_9 (- 2))) InVars {fibo_~n=v_fibo_~n_9} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_3|} AuxVars[] AssignedVars[fibo_#in~n] 11174#L11-2 [46] L11-2-->fiboFINAL: Formula: (= |v_fibo_#res_3| (+ |v_fibo_#t~ret0_3| |v_fibo_#t~ret1_3|)) InVars {fibo_#t~ret0=|v_fibo_#t~ret0_3|, fibo_#t~ret1=|v_fibo_#t~ret1_3|} OutVars{fibo_#t~ret0=|v_fibo_#t~ret0_2|, fibo_#t~ret1=|v_fibo_#t~ret1_2|, fibo_#res=|v_fibo_#res_3|} AuxVars[] AssignedVars[fibo_#t~ret0, fibo_#t~ret1, fibo_#res] 11172#fiboFINAL [42] fiboFINAL-->fiboEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 11168#fiboEXIT >[54] fiboEXIT-->L11-1: AOR: Formula: (= |v_fibo_#t~ret0_4| |v_fibo_#resOutParam_2|) InVars {fibo_#res=|v_fibo_#resOutParam_2|} OutVars{fibo_#t~ret0=|v_fibo_#t~ret0_4|} AuxVars[] AssignedVars[fibo_#t~ret0] LVA: Formula: (= |v_fibo_#in~nInParam_2| (+ v_fibo_~n_8 (- 1))) InVars {fibo_~n=v_fibo_~n_8} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_2|} AuxVars[] AssignedVars[fibo_#in~n] 11137#L11-1 [47] L11-1-->fiboENTRY: Formula: (= |v_fibo_#in~nInParam_3| (+ v_fibo_~n_9 (- 2))) InVars {fibo_~n=v_fibo_~n_9} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_3|} AuxVars[] AssignedVars[fibo_#in~n]< 11149#fiboENTRY [45] fiboENTRY-->L6: Formula: (= v_fibo_~n_1 |v_fibo_#in~n_1|) InVars {fibo_#in~n=|v_fibo_#in~n_1|} OutVars{fibo_~n=v_fibo_~n_1, fibo_#in~n=|v_fibo_#in~n_1|} AuxVars[] AssignedVars[fibo_~n] 11150#L6 [56] L6-->L8: Formula: (>= v_fibo_~n_3 1) InVars {fibo_~n=v_fibo_~n_3} OutVars{fibo_~n=v_fibo_~n_3} AuxVars[] AssignedVars[] 11208#L8 [60] L8-->L11: Formula: (> v_fibo_~n_5 1) InVars {fibo_~n=v_fibo_~n_5} OutVars{fibo_~n=v_fibo_~n_5} AuxVars[] AssignedVars[] 11126#L11 [51] L11-->fiboENTRY: Formula: (= |v_fibo_#in~nInParam_2| (+ v_fibo_~n_8 (- 1))) InVars {fibo_~n=v_fibo_~n_8} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_2|} AuxVars[] AssignedVars[fibo_#in~n]< 11158#fiboENTRY [45] fiboENTRY-->L6: Formula: (= v_fibo_~n_1 |v_fibo_#in~n_1|) InVars {fibo_#in~n=|v_fibo_#in~n_1|} OutVars{fibo_~n=v_fibo_~n_1, fibo_#in~n=|v_fibo_#in~n_1|} AuxVars[] AssignedVars[fibo_~n] 11211#L6 [56] L6-->L8: Formula: (>= v_fibo_~n_3 1) InVars {fibo_~n=v_fibo_~n_3} OutVars{fibo_~n=v_fibo_~n_3} AuxVars[] AssignedVars[] 11212#L8 [60] L8-->L11: Formula: (> v_fibo_~n_5 1) InVars {fibo_~n=v_fibo_~n_5} OutVars{fibo_~n=v_fibo_~n_5} AuxVars[] AssignedVars[] 11128#L11 40.25/21.87 [2019-03-28 12:21:52,178 INFO L796 eck$LassoCheckResult]: Loop: 11128#L11 [51] L11-->fiboENTRY: Formula: (= |v_fibo_#in~nInParam_2| (+ v_fibo_~n_8 (- 1))) InVars {fibo_~n=v_fibo_~n_8} OutVars{fibo_#in~n=|v_fibo_#in~nInParam_2|} AuxVars[] AssignedVars[fibo_#in~n]< 11158#fiboENTRY [45] fiboENTRY-->L6: Formula: (= v_fibo_~n_1 |v_fibo_#in~n_1|) InVars {fibo_#in~n=|v_fibo_#in~n_1|} OutVars{fibo_~n=v_fibo_~n_1, fibo_#in~n=|v_fibo_#in~n_1|} AuxVars[] AssignedVars[fibo_~n] 11211#L6 [56] L6-->L8: Formula: (>= v_fibo_~n_3 1) InVars {fibo_~n=v_fibo_~n_3} OutVars{fibo_~n=v_fibo_~n_3} AuxVars[] AssignedVars[] 11212#L8 [60] L8-->L11: Formula: (> v_fibo_~n_5 1) InVars {fibo_~n=v_fibo_~n_5} OutVars{fibo_~n=v_fibo_~n_5} AuxVars[] AssignedVars[] 11128#L11 40.25/21.87 [2019-03-28 12:21:52,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/21.87 [2019-03-28 12:21:52,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2070963968, now seen corresponding path program 1 times 40.25/21.87 [2019-03-28 12:21:52,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 40.25/21.87 [2019-03-28 12:21:52,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 40.25/21.87 [2019-03-28 12:21:52,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/21.87 [2019-03-28 12:21:52,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.25/21.87 [2019-03-28 12:21:52,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/21.87 [2019-03-28 12:21:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/21.87 [2019-03-28 12:21:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 39 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. 40.25/21.87 [2019-03-28 12:21:52,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 40.25/21.87 [2019-03-28 12:21:52,292 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 40.25/21.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/21.87 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 40.25/21.87 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 40.25/21.87 [2019-03-28 12:21:52,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.25/21.87 [2019-03-28 12:21:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/21.87 [2019-03-28 12:21:52,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core 40.25/21.87 [2019-03-28 12:21:52,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/21.87 [2019-03-28 12:21:52,417 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 34 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. 40.25/21.87 [2019-03-28 12:21:52,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 40.25/21.87 [2019-03-28 12:21:52,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 40.25/21.87 [2019-03-28 12:21:52,446 INFO L799 eck$LassoCheckResult]: stem already infeasible 40.25/21.87 [2019-03-28 12:21:52,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/21.87 [2019-03-28 12:21:52,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2487903, now seen corresponding path program 3 times 40.25/21.87 [2019-03-28 12:21:52,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 40.25/21.87 [2019-03-28 12:21:52,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 40.25/21.87 [2019-03-28 12:21:52,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/21.87 [2019-03-28 12:21:52,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.25/21.87 [2019-03-28 12:21:52,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/21.87 [2019-03-28 12:21:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.25/21.87 [2019-03-28 12:21:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.25/21.87 [2019-03-28 12:21:52,493 INFO L216 LassoAnalysis]: Preferences: 40.25/21.87 [2019-03-28 12:21:52,494 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 40.25/21.87 [2019-03-28 12:21:52,494 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 40.25/21.87 [2019-03-28 12:21:52,494 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 40.25/21.87 [2019-03-28 12:21:52,494 INFO L127 ssoRankerPreferences]: Use exernal solver: true 40.25/21.87 [2019-03-28 12:21:52,494 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/21.87 [2019-03-28 12:21:52,494 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 40.25/21.87 [2019-03-28 12:21:52,494 INFO L130 ssoRankerPreferences]: Path of dumped script: 40.25/21.87 [2019-03-28 12:21:52,494 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 40.25/21.87 [2019-03-28 12:21:52,495 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 40.25/21.87 [2019-03-28 12:21:52,495 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 40.25/21.87 [2019-03-28 12:21:52,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:52,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:52,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:52,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:21:52,541 INFO L300 LassoAnalysis]: Preprocessing complete. 40.25/21.87 [2019-03-28 12:21:52,541 INFO L412 LassoAnalysis]: Checking for nontermination... 40.25/21.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/21.87 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/21.87 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/21.87 [2019-03-28 12:21:52,547 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.25/21.87 [2019-03-28 12:21:52,547 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/21.87 [2019-03-28 12:21:52,551 INFO L445 LassoAnalysis]: Proved nontermination for one component. 40.25/21.87 [2019-03-28 12:21:52,552 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 40.25/21.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/21.87 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/21.87 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/21.87 [2019-03-28 12:21:52,580 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.25/21.87 [2019-03-28 12:21:52,580 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/21.87 [2019-03-28 12:21:52,583 INFO L445 LassoAnalysis]: Proved nontermination for one component. 40.25/21.87 [2019-03-28 12:21:52,584 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 40.25/21.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/21.87 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/21.87 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/21.87 [2019-03-28 12:21:52,612 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.25/21.87 [2019-03-28 12:21:52,612 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/21.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/21.87 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/21.87 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/21.87 [2019-03-28 12:21:52,649 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 40.25/21.87 [2019-03-28 12:21:52,649 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/21.87 [2019-03-28 12:22:03,349 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 40.25/21.87 [2019-03-28 12:22:03,352 INFO L216 LassoAnalysis]: Preferences: 40.25/21.87 [2019-03-28 12:22:03,353 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 40.25/21.87 [2019-03-28 12:22:03,353 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 40.25/21.87 [2019-03-28 12:22:03,353 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 40.25/21.87 [2019-03-28 12:22:03,353 INFO L127 ssoRankerPreferences]: Use exernal solver: false 40.25/21.87 [2019-03-28 12:22:03,353 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 40.25/21.87 [2019-03-28 12:22:03,353 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 40.25/21.87 [2019-03-28 12:22:03,353 INFO L130 ssoRankerPreferences]: Path of dumped script: 40.25/21.87 [2019-03-28 12:22:03,353 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 40.25/21.87 [2019-03-28 12:22:03,354 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 40.25/21.87 [2019-03-28 12:22:03,354 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 40.25/21.87 [2019-03-28 12:22:03,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:22:03,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:22:03,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:22:03,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/21.87 [2019-03-28 12:22:03,390 INFO L300 LassoAnalysis]: Preprocessing complete. 40.25/21.87 [2019-03-28 12:22:03,390 INFO L497 LassoAnalysis]: Using template 'affine'. 40.25/21.87 [2019-03-28 12:22:03,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/21.87 Termination analysis: LINEAR_WITH_GUESSES 40.25/21.87 Number of strict supporting invariants: 0 40.25/21.87 Number of non-strict supporting invariants: 1 40.25/21.87 Consider only non-deceasing supporting invariants: true 40.25/21.87 Simplify termination arguments: true 40.25/21.87 Simplify supporting invariants: trueOverapproximate stem: false 40.25/21.87 [2019-03-28 12:22:03,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/21.87 [2019-03-28 12:22:03,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/21.87 [2019-03-28 12:22:03,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/21.87 [2019-03-28 12:22:03,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/21.87 [2019-03-28 12:22:03,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/21.87 [2019-03-28 12:22:03,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/21.87 [2019-03-28 12:22:03,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/21.87 [2019-03-28 12:22:03,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 40.25/21.87 [2019-03-28 12:22:03,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/21.87 Termination analysis: LINEAR_WITH_GUESSES 40.25/21.87 Number of strict supporting invariants: 0 40.25/21.87 Number of non-strict supporting invariants: 1 40.25/21.87 Consider only non-deceasing supporting invariants: true 40.25/21.87 Simplify termination arguments: true 40.25/21.87 Simplify supporting invariants: trueOverapproximate stem: false 40.25/21.87 [2019-03-28 12:22:03,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/21.87 [2019-03-28 12:22:03,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/21.87 [2019-03-28 12:22:03,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/21.87 [2019-03-28 12:22:03,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/21.87 [2019-03-28 12:22:03,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/21.87 [2019-03-28 12:22:03,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/21.87 [2019-03-28 12:22:03,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/21.87 [2019-03-28 12:22:03,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 40.25/21.87 [2019-03-28 12:22:03,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/21.87 Termination analysis: LINEAR_WITH_GUESSES 40.25/21.87 Number of strict supporting invariants: 0 40.25/21.87 Number of non-strict supporting invariants: 1 40.25/21.87 Consider only non-deceasing supporting invariants: true 40.25/21.87 Simplify termination arguments: true 40.25/21.87 Simplify supporting invariants: trueOverapproximate stem: false 40.25/21.87 [2019-03-28 12:22:03,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/21.87 [2019-03-28 12:22:03,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/21.87 [2019-03-28 12:22:03,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/21.87 [2019-03-28 12:22:03,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/21.87 [2019-03-28 12:22:03,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/21.87 [2019-03-28 12:22:03,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/21.87 [2019-03-28 12:22:03,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/21.87 [2019-03-28 12:22:03,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 40.25/21.87 [2019-03-28 12:22:03,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/21.87 Termination analysis: LINEAR_WITH_GUESSES 40.25/21.87 Number of strict supporting invariants: 0 40.25/21.87 Number of non-strict supporting invariants: 1 40.25/21.87 Consider only non-deceasing supporting invariants: true 40.25/21.87 Simplify termination arguments: true 40.25/21.87 Simplify supporting invariants: trueOverapproximate stem: false 40.25/21.87 [2019-03-28 12:22:03,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/21.87 [2019-03-28 12:22:03,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/21.87 [2019-03-28 12:22:03,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/21.87 [2019-03-28 12:22:03,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/21.87 [2019-03-28 12:22:03,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/21.87 [2019-03-28 12:22:03,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/21.87 [2019-03-28 12:22:03,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/21.87 [2019-03-28 12:22:03,405 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 40.25/21.87 [2019-03-28 12:22:03,408 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 40.25/21.87 [2019-03-28 12:22:03,409 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 40.25/21.87 [2019-03-28 12:22:03,409 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 40.25/21.87 [2019-03-28 12:22:03,409 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 40.25/21.87 [2019-03-28 12:22:03,409 INFO L518 LassoAnalysis]: Proved termination. 40.25/21.87 [2019-03-28 12:22:03,409 INFO L520 LassoAnalysis]: Termination argument consisting of: 40.25/21.87 Ranking function f(fibo_~n) = 1*fibo_~n 40.25/21.87 Supporting invariants [] 40.25/21.87 [2019-03-28 12:22:03,410 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 40.25/21.87 [2019-03-28 12:22:03,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/21.87 [2019-03-28 12:22:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/21.87 [2019-03-28 12:22:03,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjunts are in the unsatisfiable core 40.25/21.87 [2019-03-28 12:22:03,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/21.87 [2019-03-28 12:22:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/21.87 [2019-03-28 12:22:03,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core 40.25/21.87 [2019-03-28 12:22:03,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/21.87 [2019-03-28 12:22:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 40.25/21.87 [2019-03-28 12:22:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/21.87 [2019-03-28 12:22:03,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core 40.25/21.87 [2019-03-28 12:22:03,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/21.87 [2019-03-28 12:22:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/21.87 [2019-03-28 12:22:03,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core 40.25/21.87 [2019-03-28 12:22:03,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/21.87 [2019-03-28 12:22:03,749 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 7 predicates after loop cannibalization 40.25/21.87 [2019-03-28 12:22:03,749 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 7 loop predicates 40.25/21.87 [2019-03-28 12:22:03,750 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 98 states and 126 transitions. cyclomatic complexity: 31 Second operand 6 states. 40.25/21.87 [2019-03-28 12:22:04,109 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 98 states and 126 transitions. cyclomatic complexity: 31. Second operand 6 states. Result 1347 states and 1748 transitions. Complement of second has 428 states. 40.25/21.87 [2019-03-28 12:22:04,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 8 non-accepting loop states 2 accepting loop states 40.25/21.87 [2019-03-28 12:22:04,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 40.25/21.87 [2019-03-28 12:22:04,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. 40.25/21.87 [2019-03-28 12:22:04,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 50 transitions. Stem has 35 letters. Loop has 4 letters. 40.25/21.87 [2019-03-28 12:22:04,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/21.87 [2019-03-28 12:22:04,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 50 transitions. Stem has 39 letters. Loop has 4 letters. 40.25/21.87 [2019-03-28 12:22:04,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/21.87 [2019-03-28 12:22:04,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 50 transitions. Stem has 35 letters. Loop has 8 letters. 40.25/21.87 [2019-03-28 12:22:04,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/21.87 [2019-03-28 12:22:04,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1347 states and 1748 transitions. 40.25/21.87 [2019-03-28 12:22:04,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 40.25/21.87 [2019-03-28 12:22:04,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1347 states to 264 states and 376 transitions. 40.25/21.87 [2019-03-28 12:22:04,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 40.25/21.87 [2019-03-28 12:22:04,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 161 40.25/21.87 [2019-03-28 12:22:04,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 264 states and 376 transitions. 40.25/21.87 [2019-03-28 12:22:04,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 40.25/21.87 [2019-03-28 12:22:04,142 INFO L706 BuchiCegarLoop]: Abstraction has 264 states and 376 transitions. 40.25/21.87 [2019-03-28 12:22:04,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states and 376 transitions. 40.25/21.87 [2019-03-28 12:22:04,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 229. 40.25/21.87 [2019-03-28 12:22:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. 40.25/21.87 [2019-03-28 12:22:04,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 302 transitions. 40.25/21.87 [2019-03-28 12:22:04,160 INFO L729 BuchiCegarLoop]: Abstraction has 229 states and 302 transitions. 40.25/21.87 [2019-03-28 12:22:04,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 40.25/21.87 [2019-03-28 12:22:04,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 40.25/21.87 [2019-03-28 12:22:04,161 INFO L87 Difference]: Start difference. First operand 229 states and 302 transitions. Second operand 17 states. 40.25/21.87 [2019-03-28 12:22:04,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 40.25/21.87 [2019-03-28 12:22:04,535 INFO L93 Difference]: Finished difference Result 184 states and 221 transitions. 40.25/21.87 [2019-03-28 12:22:04,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 40.25/21.87 [2019-03-28 12:22:04,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 221 transitions. 40.25/21.87 [2019-03-28 12:22:04,540 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 40.25/21.87 [2019-03-28 12:22:04,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 0 states and 0 transitions. 40.25/21.87 [2019-03-28 12:22:04,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 40.25/21.87 [2019-03-28 12:22:04,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 40.25/21.87 [2019-03-28 12:22:04,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 40.25/21.87 [2019-03-28 12:22:04,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 40.25/21.87 [2019-03-28 12:22:04,541 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 40.25/21.87 [2019-03-28 12:22:04,541 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 40.25/21.87 [2019-03-28 12:22:04,541 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 40.25/21.87 [2019-03-28 12:22:04,541 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 40.25/21.87 [2019-03-28 12:22:04,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 40.25/21.87 [2019-03-28 12:22:04,541 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 40.25/21.87 [2019-03-28 12:22:04,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 40.25/21.87 [2019-03-28 12:22:04,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:22:04 BasicIcfg 40.25/21.87 [2019-03-28 12:22:04,549 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 40.25/21.87 [2019-03-28 12:22:04,549 INFO L168 Benchmark]: Toolchain (without parser) took 17438.95 ms. Allocated memory was 649.6 MB in the beginning and 872.9 MB in the end (delta: 223.3 MB). Free memory was 557.1 MB in the beginning and 530.2 MB in the end (delta: 26.8 MB). Peak memory consumption was 250.2 MB. Max. memory is 50.3 GB. 40.25/21.87 [2019-03-28 12:22:04,551 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 40.25/21.87 [2019-03-28 12:22:04,551 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.27 ms. Allocated memory is still 649.6 MB. Free memory was 557.1 MB in the beginning and 547.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 40.25/21.87 [2019-03-28 12:22:04,552 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.32 ms. Allocated memory was 649.6 MB in the beginning and 667.9 MB in the end (delta: 18.4 MB). Free memory was 547.4 MB in the beginning and 634.8 MB in the end (delta: -87.5 MB). Peak memory consumption was 20.1 MB. Max. memory is 50.3 GB. 40.25/21.87 [2019-03-28 12:22:04,553 INFO L168 Benchmark]: Boogie Preprocessor took 17.28 ms. Allocated memory is still 667.9 MB. Free memory was 634.8 MB in the beginning and 633.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 40.25/21.87 [2019-03-28 12:22:04,553 INFO L168 Benchmark]: RCFGBuilder took 196.52 ms. Allocated memory is still 667.9 MB. Free memory was 633.7 MB in the beginning and 618.8 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 50.3 GB. 40.25/21.87 [2019-03-28 12:22:04,554 INFO L168 Benchmark]: BlockEncodingV2 took 78.64 ms. Allocated memory is still 667.9 MB. Free memory was 618.8 MB in the beginning and 613.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 40.25/21.87 [2019-03-28 12:22:04,554 INFO L168 Benchmark]: TraceAbstraction took 164.34 ms. Allocated memory is still 667.9 MB. Free memory was 613.4 MB in the beginning and 602.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 40.25/21.87 [2019-03-28 12:22:04,554 INFO L168 Benchmark]: BuchiAutomizer took 16644.35 ms. Allocated memory was 667.9 MB in the beginning and 872.9 MB in the end (delta: 205.0 MB). Free memory was 602.6 MB in the beginning and 530.2 MB in the end (delta: 72.3 MB). Peak memory consumption was 277.3 MB. Max. memory is 50.3 GB. 40.25/21.87 [2019-03-28 12:22:04,558 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 40.25/21.87 --- Results --- 40.25/21.87 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 40.25/21.87 - StatisticsResult: Initial Icfg 40.25/21.87 17 locations, 21 edges 40.25/21.87 - StatisticsResult: Encoded RCFG 40.25/21.87 10 locations, 14 edges 40.25/21.87 * Results from de.uni_freiburg.informatik.ultimate.core: 40.25/21.87 - StatisticsResult: Toolchain Benchmarks 40.25/21.87 Benchmark results are: 40.25/21.87 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 40.25/21.87 * CACSL2BoogieTranslator took 233.27 ms. Allocated memory is still 649.6 MB. Free memory was 557.1 MB in the beginning and 547.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 40.25/21.87 * Boogie Procedure Inliner took 99.32 ms. Allocated memory was 649.6 MB in the beginning and 667.9 MB in the end (delta: 18.4 MB). Free memory was 547.4 MB in the beginning and 634.8 MB in the end (delta: -87.5 MB). Peak memory consumption was 20.1 MB. Max. memory is 50.3 GB. 40.25/21.87 * Boogie Preprocessor took 17.28 ms. Allocated memory is still 667.9 MB. Free memory was 634.8 MB in the beginning and 633.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 40.25/21.87 * RCFGBuilder took 196.52 ms. Allocated memory is still 667.9 MB. Free memory was 633.7 MB in the beginning and 618.8 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 50.3 GB. 40.25/21.87 * BlockEncodingV2 took 78.64 ms. Allocated memory is still 667.9 MB. Free memory was 618.8 MB in the beginning and 613.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 40.25/21.87 * TraceAbstraction took 164.34 ms. Allocated memory is still 667.9 MB. Free memory was 613.4 MB in the beginning and 602.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 40.25/21.87 * BuchiAutomizer took 16644.35 ms. Allocated memory was 667.9 MB in the beginning and 872.9 MB in the end (delta: 205.0 MB). Free memory was 602.6 MB in the beginning and 530.2 MB in the end (delta: 72.3 MB). Peak memory consumption was 277.3 MB. Max. memory is 50.3 GB. 40.25/21.87 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 40.25/21.87 - AllSpecificationsHoldResult: All specifications hold 40.25/21.87 We were not able to verify any specifiation because the program does not contain any specification. 40.25/21.87 - StatisticsResult: Ultimate Automizer benchmark data 40.25/21.87 CFG has 2 procedures, 10 locations, 0 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 4 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 40.25/21.87 - StatisticsResult: Constructed decomposition of program 40.25/21.87 Your program was decomposed into 8 terminating modules (4 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function \old(n) and consists of 6 locations. One nondeterministic module has affine ranking function \old(n) and consists of 20 locations. One nondeterministic module has affine ranking function n and consists of 12 locations. 4 modules have a trivial ranking function, the largest among these consists of 17 locations. 40.25/21.87 - StatisticsResult: Timing statistics 40.25/21.87 BüchiAutomizer plugin needed 16.6s and 6 iterations. TraceHistogramMax:7. Analysis of lassos took 12.5s. Construction of modules took 0.6s. Büchi inclusion checks took 3.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 118 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 98 states and ocurred in iteration 4. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/3 HoareTripleCheckerStatistics: 120 SDtfs, 292 SDslu, 235 SDs, 0 SdLazy, 649 SolverSat, 244 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq174 hnf91 smp100 dnf100 smp100 tf112 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 10.9s 40.25/21.87 - TerminationAnalysisResult: Termination proven 40.25/21.87 Buchi Automizer proved that your program is terminating 40.25/21.87 RESULT: Ultimate proved your program to be correct! 40.25/21.87 !SESSION 2019-03-28 12:21:43.854 ----------------------------------------------- 40.25/21.87 eclipse.buildId=unknown 40.25/21.87 java.version=1.8.0_181 40.25/21.87 java.vendor=Oracle Corporation 40.25/21.87 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 40.25/21.87 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 40.25/21.87 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 40.25/21.87 40.25/21.87 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:22:04.793 40.25/21.87 !MESSAGE The workspace will exit with unsaved changes in this session. 40.25/21.87 Received shutdown request... 40.25/21.87 Ultimate: 40.25/21.87 GTK+ Version Check 40.25/21.87 EOF