17.12/8.07 YES 17.12/8.07 17.12/8.07 Ultimate: Cannot open display: 17.12/8.07 This is Ultimate 0.1.24-8dc7c08-m 17.12/8.07 [2019-03-29 01:52:46,469 INFO L170 SettingsManager]: Resetting all preferences to default values... 17.12/8.07 [2019-03-29 01:52:46,471 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 17.12/8.07 [2019-03-29 01:52:46,482 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 17.12/8.07 [2019-03-29 01:52:46,482 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 17.12/8.07 [2019-03-29 01:52:46,483 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 17.12/8.07 [2019-03-29 01:52:46,485 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 17.12/8.07 [2019-03-29 01:52:46,486 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 17.12/8.07 [2019-03-29 01:52:46,488 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 17.12/8.07 [2019-03-29 01:52:46,488 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 17.12/8.07 [2019-03-29 01:52:46,489 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 17.12/8.07 [2019-03-29 01:52:46,490 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 17.12/8.07 [2019-03-29 01:52:46,490 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 17.12/8.07 [2019-03-29 01:52:46,491 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 17.12/8.07 [2019-03-29 01:52:46,492 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 17.12/8.07 [2019-03-29 01:52:46,493 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 17.12/8.07 [2019-03-29 01:52:46,494 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 17.12/8.07 [2019-03-29 01:52:46,496 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 17.12/8.07 [2019-03-29 01:52:46,497 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 17.12/8.07 [2019-03-29 01:52:46,499 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 17.12/8.07 [2019-03-29 01:52:46,500 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 17.12/8.07 [2019-03-29 01:52:46,502 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 17.12/8.07 [2019-03-29 01:52:46,504 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 17.12/8.07 [2019-03-29 01:52:46,504 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 17.12/8.07 [2019-03-29 01:52:46,504 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 17.12/8.07 [2019-03-29 01:52:46,505 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 17.12/8.07 [2019-03-29 01:52:46,505 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 17.12/8.07 [2019-03-29 01:52:46,506 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 17.12/8.07 [2019-03-29 01:52:46,506 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 17.12/8.07 [2019-03-29 01:52:46,507 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 17.12/8.07 [2019-03-29 01:52:46,508 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 17.12/8.07 [2019-03-29 01:52:46,509 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 17.12/8.07 [2019-03-29 01:52:46,510 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 17.12/8.07 [2019-03-29 01:52:46,510 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 17.12/8.07 [2019-03-29 01:52:46,510 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 17.12/8.07 [2019-03-29 01:52:46,511 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 17.12/8.07 [2019-03-29 01:52:46,511 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 17.12/8.07 [2019-03-29 01:52:46,512 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 17.12/8.07 [2019-03-29 01:52:46,512 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 17.12/8.07 [2019-03-29 01:52:46,513 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 17.12/8.07 [2019-03-29 01:52:46,527 INFO L110 SettingsManager]: Loading preferences was successful 17.12/8.07 [2019-03-29 01:52:46,528 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 17.12/8.07 [2019-03-29 01:52:46,529 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 17.12/8.07 [2019-03-29 01:52:46,529 INFO L133 SettingsManager]: * Rewrite not-equals=true 17.12/8.07 [2019-03-29 01:52:46,529 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 17.12/8.07 [2019-03-29 01:52:46,529 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 17.12/8.07 [2019-03-29 01:52:46,530 INFO L133 SettingsManager]: * Use SBE=true 17.12/8.07 [2019-03-29 01:52:46,530 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 17.12/8.07 [2019-03-29 01:52:46,530 INFO L133 SettingsManager]: * Use old map elimination=false 17.12/8.07 [2019-03-29 01:52:46,530 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 17.12/8.07 [2019-03-29 01:52:46,530 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 17.12/8.07 [2019-03-29 01:52:46,530 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 17.12/8.07 [2019-03-29 01:52:46,531 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 17.12/8.07 [2019-03-29 01:52:46,531 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 17.12/8.07 [2019-03-29 01:52:46,531 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.12/8.07 [2019-03-29 01:52:46,531 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 17.12/8.07 [2019-03-29 01:52:46,531 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 17.12/8.07 [2019-03-29 01:52:46,531 INFO L133 SettingsManager]: * Check division by zero=IGNORE 17.12/8.07 [2019-03-29 01:52:46,532 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 17.12/8.07 [2019-03-29 01:52:46,532 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 17.12/8.07 [2019-03-29 01:52:46,532 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 17.12/8.07 [2019-03-29 01:52:46,532 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 17.12/8.07 [2019-03-29 01:52:46,532 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 17.12/8.07 [2019-03-29 01:52:46,533 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 17.12/8.07 [2019-03-29 01:52:46,533 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 17.12/8.07 [2019-03-29 01:52:46,533 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 17.12/8.07 [2019-03-29 01:52:46,533 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 17.12/8.07 [2019-03-29 01:52:46,533 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 17.12/8.07 [2019-03-29 01:52:46,533 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 17.12/8.07 [2019-03-29 01:52:46,559 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 17.12/8.07 [2019-03-29 01:52:46,572 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 17.12/8.07 [2019-03-29 01:52:46,576 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 17.12/8.07 [2019-03-29 01:52:46,577 INFO L271 PluginConnector]: Initializing CDTParser... 17.12/8.07 [2019-03-29 01:52:46,578 INFO L276 PluginConnector]: CDTParser initialized 17.12/8.07 [2019-03-29 01:52:46,578 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 17.12/8.07 [2019-03-29 01:52:46,640 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/9729d9a2f41c47b0963d9fc153806e72/FLAG41448ce67 17.12/8.07 [2019-03-29 01:52:46,988 INFO L307 CDTParser]: Found 1 translation units. 17.12/8.07 [2019-03-29 01:52:46,988 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 17.12/8.07 [2019-03-29 01:52:46,995 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/9729d9a2f41c47b0963d9fc153806e72/FLAG41448ce67 17.12/8.07 [2019-03-29 01:52:47,385 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/9729d9a2f41c47b0963d9fc153806e72 17.12/8.07 [2019-03-29 01:52:47,397 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 17.12/8.07 [2019-03-29 01:52:47,399 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 17.12/8.07 [2019-03-29 01:52:47,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 17.12/8.07 [2019-03-29 01:52:47,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 17.12/8.07 [2019-03-29 01:52:47,404 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 17.12/8.07 [2019-03-29 01:52:47,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 01:52:47" (1/1) ... 17.12/8.07 [2019-03-29 01:52:47,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45fc1d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:52:47, skipping insertion in model container 17.12/8.07 [2019-03-29 01:52:47,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 01:52:47" (1/1) ... 17.12/8.07 [2019-03-29 01:52:47,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 17.12/8.07 [2019-03-29 01:52:47,435 INFO L176 MainTranslator]: Built tables and reachable declarations 17.12/8.07 [2019-03-29 01:52:47,599 INFO L206 PostProcessor]: Analyzing one entry point: main 17.12/8.07 [2019-03-29 01:52:47,604 INFO L191 MainTranslator]: Completed pre-run 17.12/8.07 [2019-03-29 01:52:47,621 INFO L206 PostProcessor]: Analyzing one entry point: main 17.12/8.07 [2019-03-29 01:52:47,636 INFO L195 MainTranslator]: Completed translation 17.12/8.07 [2019-03-29 01:52:47,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:52:47 WrapperNode 17.12/8.07 [2019-03-29 01:52:47,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 17.12/8.07 [2019-03-29 01:52:47,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 17.12/8.07 [2019-03-29 01:52:47,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 17.12/8.07 [2019-03-29 01:52:47,638 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 17.12/8.07 [2019-03-29 01:52:47,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:52:47" (1/1) ... 17.12/8.07 [2019-03-29 01:52:47,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:52:47" (1/1) ... 17.12/8.07 [2019-03-29 01:52:47,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 17.12/8.07 [2019-03-29 01:52:47,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 17.12/8.07 [2019-03-29 01:52:47,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 17.12/8.07 [2019-03-29 01:52:47,734 INFO L276 PluginConnector]: Boogie Preprocessor initialized 17.12/8.07 [2019-03-29 01:52:47,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:52:47" (1/1) ... 17.12/8.07 [2019-03-29 01:52:47,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:52:47" (1/1) ... 17.12/8.07 [2019-03-29 01:52:47,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:52:47" (1/1) ... 17.12/8.07 [2019-03-29 01:52:47,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:52:47" (1/1) ... 17.12/8.07 [2019-03-29 01:52:47,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:52:47" (1/1) ... 17.12/8.07 [2019-03-29 01:52:47,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:52:47" (1/1) ... 17.12/8.07 [2019-03-29 01:52:47,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:52:47" (1/1) ... 17.12/8.07 [2019-03-29 01:52:47,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 17.12/8.07 [2019-03-29 01:52:47,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 17.12/8.07 [2019-03-29 01:52:47,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... 17.12/8.07 [2019-03-29 01:52:47,754 INFO L276 PluginConnector]: RCFGBuilder initialized 17.12/8.07 [2019-03-29 01:52:47,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:52:47" (1/1) ... 17.12/8.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.12/8.07 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 17.12/8.07 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 17.12/8.07 [2019-03-29 01:52:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 17.12/8.07 [2019-03-29 01:52:47,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 17.12/8.07 [2019-03-29 01:52:47,948 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 17.12/8.07 [2019-03-29 01:52:47,948 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 17.12/8.07 [2019-03-29 01:52:47,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:52:47 BoogieIcfgContainer 17.12/8.07 [2019-03-29 01:52:47,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 17.12/8.07 [2019-03-29 01:52:47,950 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 17.12/8.07 [2019-03-29 01:52:47,950 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 17.12/8.07 [2019-03-29 01:52:47,952 INFO L276 PluginConnector]: BlockEncodingV2 initialized 17.12/8.07 [2019-03-29 01:52:47,953 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:52:47" (1/1) ... 17.12/8.07 [2019-03-29 01:52:47,967 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 11 edges 17.12/8.07 [2019-03-29 01:52:47,969 INFO L258 BlockEncoder]: Using Remove infeasible edges 17.12/8.07 [2019-03-29 01:52:47,970 INFO L263 BlockEncoder]: Using Maximize final states 17.12/8.07 [2019-03-29 01:52:47,970 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 17.12/8.07 [2019-03-29 01:52:47,971 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 17.12/8.07 [2019-03-29 01:52:47,972 INFO L296 BlockEncoder]: Using Remove sink states 17.12/8.07 [2019-03-29 01:52:47,973 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 17.12/8.07 [2019-03-29 01:52:47,974 INFO L179 BlockEncoder]: Using Rewrite not-equals 17.12/8.07 [2019-03-29 01:52:47,990 INFO L185 BlockEncoder]: Using Use SBE 17.12/8.07 [2019-03-29 01:52:48,005 INFO L200 BlockEncoder]: SBE split 2 edges 17.12/8.07 [2019-03-29 01:52:48,010 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 17.12/8.07 [2019-03-29 01:52:48,012 INFO L71 MaximizeFinalStates]: 0 new accepting states 17.12/8.07 [2019-03-29 01:52:48,022 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 17.12/8.07 [2019-03-29 01:52:48,024 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states 17.12/8.07 [2019-03-29 01:52:48,025 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 17.12/8.07 [2019-03-29 01:52:48,025 INFO L71 MaximizeFinalStates]: 0 new accepting states 17.12/8.07 [2019-03-29 01:52:48,026 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 17.12/8.07 [2019-03-29 01:52:48,026 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 17.12/8.07 [2019-03-29 01:52:48,026 INFO L313 BlockEncoder]: Encoded RCFG 4 locations, 7 edges 17.12/8.07 [2019-03-29 01:52:48,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 01:52:48 BasicIcfg 17.12/8.07 [2019-03-29 01:52:48,027 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 17.12/8.07 [2019-03-29 01:52:48,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 17.12/8.07 [2019-03-29 01:52:48,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... 17.12/8.07 [2019-03-29 01:52:48,032 INFO L276 PluginConnector]: TraceAbstraction initialized 17.12/8.07 [2019-03-29 01:52:48,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 01:52:47" (1/4) ... 17.12/8.07 [2019-03-29 01:52:48,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c89977c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 01:52:48, skipping insertion in model container 17.12/8.07 [2019-03-29 01:52:48,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:52:47" (2/4) ... 17.12/8.07 [2019-03-29 01:52:48,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c89977c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 01:52:48, skipping insertion in model container 17.12/8.07 [2019-03-29 01:52:48,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:52:47" (3/4) ... 17.12/8.07 [2019-03-29 01:52:48,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c89977c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 01:52:48, skipping insertion in model container 17.12/8.07 [2019-03-29 01:52:48,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 01:52:48" (4/4) ... 17.12/8.07 [2019-03-29 01:52:48,036 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 17.12/8.07 [2019-03-29 01:52:48,046 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 17.12/8.07 [2019-03-29 01:52:48,054 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 17.12/8.07 [2019-03-29 01:52:48,071 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 17.12/8.07 [2019-03-29 01:52:48,100 INFO L133 ementStrategyFactory]: Using default assertion order modulation 17.12/8.07 [2019-03-29 01:52:48,100 INFO L382 AbstractCegarLoop]: Interprodecural is true 17.12/8.07 [2019-03-29 01:52:48,101 INFO L383 AbstractCegarLoop]: Hoare is true 17.12/8.07 [2019-03-29 01:52:48,101 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 17.12/8.07 [2019-03-29 01:52:48,101 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 17.12/8.07 [2019-03-29 01:52:48,101 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 17.12/8.07 [2019-03-29 01:52:48,101 INFO L387 AbstractCegarLoop]: Difference is false 17.12/8.07 [2019-03-29 01:52:48,102 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 17.12/8.07 [2019-03-29 01:52:48,102 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 17.12/8.07 [2019-03-29 01:52:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. 17.12/8.07 [2019-03-29 01:52:48,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 17.12/8.07 [2019-03-29 01:52:48,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. 17.12/8.07 [2019-03-29 01:52:48,174 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 17.12/8.07 [2019-03-29 01:52:48,174 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 29) no Hoare annotation was computed. 17.12/8.07 [2019-03-29 01:52:48,175 INFO L451 ceAbstractionStarter]: At program point L26-2(lines 22 30) the Hoare annotation is: true 17.12/8.07 [2019-03-29 01:52:48,175 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 29) no Hoare annotation was computed. 17.12/8.07 [2019-03-29 01:52:48,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 01:52:48 BasicIcfg 17.12/8.07 [2019-03-29 01:52:48,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 17.12/8.07 [2019-03-29 01:52:48,184 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 17.12/8.07 [2019-03-29 01:52:48,184 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 17.12/8.07 [2019-03-29 01:52:48,188 INFO L276 PluginConnector]: BuchiAutomizer initialized 17.12/8.07 [2019-03-29 01:52:48,189 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.12/8.07 [2019-03-29 01:52:48,189 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.03 01:52:47" (1/5) ... 17.12/8.07 [2019-03-29 01:52:48,190 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56d225c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 01:52:48, skipping insertion in model container 17.12/8.07 [2019-03-29 01:52:48,190 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.12/8.07 [2019-03-29 01:52:48,190 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:52:47" (2/5) ... 17.12/8.07 [2019-03-29 01:52:48,191 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56d225c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 01:52:48, skipping insertion in model container 17.12/8.07 [2019-03-29 01:52:48,191 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.12/8.07 [2019-03-29 01:52:48,191 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:52:47" (3/5) ... 17.12/8.07 [2019-03-29 01:52:48,191 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56d225c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 01:52:48, skipping insertion in model container 17.12/8.07 [2019-03-29 01:52:48,191 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.12/8.07 [2019-03-29 01:52:48,192 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 01:52:48" (4/5) ... 17.12/8.07 [2019-03-29 01:52:48,192 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56d225c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 01:52:48, skipping insertion in model container 17.12/8.07 [2019-03-29 01:52:48,192 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.12/8.07 [2019-03-29 01:52:48,192 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 01:52:48" (5/5) ... 17.12/8.07 [2019-03-29 01:52:48,194 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 17.12/8.07 [2019-03-29 01:52:48,224 INFO L133 ementStrategyFactory]: Using default assertion order modulation 17.12/8.07 [2019-03-29 01:52:48,225 INFO L374 BuchiCegarLoop]: Interprodecural is true 17.12/8.07 [2019-03-29 01:52:48,225 INFO L375 BuchiCegarLoop]: Hoare is true 17.12/8.07 [2019-03-29 01:52:48,225 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 17.12/8.07 [2019-03-29 01:52:48,225 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 17.12/8.07 [2019-03-29 01:52:48,225 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 17.12/8.07 [2019-03-29 01:52:48,225 INFO L379 BuchiCegarLoop]: Difference is false 17.12/8.07 [2019-03-29 01:52:48,226 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 17.12/8.07 [2019-03-29 01:52:48,226 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 17.12/8.07 [2019-03-29 01:52:48,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 17.12/8.07 [2019-03-29 01:52:48,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 17.12/8.07 [2019-03-29 01:52:48,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.12/8.07 [2019-03-29 01:52:48,247 INFO L119 BuchiIsEmpty]: Starting construction of run 17.12/8.07 [2019-03-29 01:52:48,253 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.12/8.07 [2019-03-29 01:52:48,254 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 17.12/8.07 [2019-03-29 01:52:48,254 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 17.12/8.07 [2019-03-29 01:52:48,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 17.12/8.07 [2019-03-29 01:52:48,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 17.12/8.07 [2019-03-29 01:52:48,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.12/8.07 [2019-03-29 01:52:48,255 INFO L119 BuchiIsEmpty]: Starting construction of run 17.12/8.07 [2019-03-29 01:52:48,255 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.12/8.07 [2019-03-29 01:52:48,255 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 17.12/8.07 [2019-03-29 01:52:48,260 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [32] ULTIMATE.startENTRY-->L26-2: Formula: (and (= v_ULTIMATE.start_main_~p~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~q~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_1, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~p~0, ULTIMATE.start_main_~q~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3] 6#L26-2true 17.12/8.07 [2019-03-29 01:52:48,261 INFO L796 eck$LassoCheckResult]: Loop: 6#L26-2true [48] L26-2-->L23: Formula: (and (< 0 v_ULTIMATE.start_main_~q~0_10) (< 0 v_ULTIMATE.start_main_~p~0_10) (> v_ULTIMATE.start_main_~p~0_10 v_ULTIMATE.start_main_~q~0_10)) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_10} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_10} AuxVars[] AssignedVars[] 5#L23true [33] L23-->L26-2: Formula: (and (= v_ULTIMATE.start_main_~q~0_11 (+ v_ULTIMATE.start_main_~q~0_12 (- 1))) (= v_ULTIMATE.start_main_~p~0_11 |v_ULTIMATE.start_main_#t~nondet2_3|) (< v_ULTIMATE.start_main_~q~0_12 v_ULTIMATE.start_main_~p~0_12)) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_12, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_12, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_11, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_11, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~p~0, ULTIMATE.start_main_~q~0, ULTIMATE.start_main_#t~nondet2] 6#L26-2true 17.12/8.07 [2019-03-29 01:52:48,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.12/8.07 [2019-03-29 01:52:48,267 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 1 times 17.12/8.07 [2019-03-29 01:52:48,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.12/8.07 [2019-03-29 01:52:48,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.12/8.07 [2019-03-29 01:52:48,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:48,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:48,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:48,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.12/8.07 [2019-03-29 01:52:48,343 INFO L82 PathProgramCache]: Analyzing trace with hash 2482, now seen corresponding path program 1 times 17.12/8.07 [2019-03-29 01:52:48,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.12/8.07 [2019-03-29 01:52:48,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.12/8.07 [2019-03-29 01:52:48,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:48,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:48,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:48,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.12/8.07 [2019-03-29 01:52:48,359 INFO L82 PathProgramCache]: Analyzing trace with hash 62064, now seen corresponding path program 1 times 17.12/8.07 [2019-03-29 01:52:48,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.12/8.07 [2019-03-29 01:52:48,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.12/8.07 [2019-03-29 01:52:48,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:48,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:48,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:48,439 INFO L216 LassoAnalysis]: Preferences: 17.12/8.07 [2019-03-29 01:52:48,440 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.12/8.07 [2019-03-29 01:52:48,440 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.12/8.07 [2019-03-29 01:52:48,440 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.12/8.07 [2019-03-29 01:52:48,440 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.12/8.07 [2019-03-29 01:52:48,440 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.12/8.07 [2019-03-29 01:52:48,441 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.12/8.07 [2019-03-29 01:52:48,441 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.12/8.07 [2019-03-29 01:52:48,441 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 17.12/8.07 [2019-03-29 01:52:48,441 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.12/8.07 [2019-03-29 01:52:48,441 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.12/8.07 [2019-03-29 01:52:48,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.12/8.07 [2019-03-29 01:52:48,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.12/8.07 [2019-03-29 01:52:48,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.12/8.07 [2019-03-29 01:52:48,579 INFO L300 LassoAnalysis]: Preprocessing complete. 17.12/8.07 [2019-03-29 01:52:48,580 INFO L412 LassoAnalysis]: Checking for nontermination... 17.12/8.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.12/8.07 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.12/8.07 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.12/8.07 [2019-03-29 01:52:48,587 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.12/8.07 [2019-03-29 01:52:48,587 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.12/8.07 [2019-03-29 01:52:48,620 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.12/8.07 [2019-03-29 01:52:48,621 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.12/8.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.12/8.07 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.12/8.07 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.12/8.07 [2019-03-29 01:52:48,627 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.12/8.07 [2019-03-29 01:52:48,628 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.12/8.07 [2019-03-29 01:52:48,655 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.12/8.07 [2019-03-29 01:52:48,655 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.12/8.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.12/8.07 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.12/8.07 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.12/8.07 [2019-03-29 01:52:48,661 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.12/8.07 [2019-03-29 01:52:48,661 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.12/8.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.12/8.07 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.12/8.07 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.12/8.07 [2019-03-29 01:52:48,696 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.12/8.07 [2019-03-29 01:52:48,696 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.12/8.07 [2019-03-29 01:52:48,736 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 17.12/8.07 [2019-03-29 01:52:48,738 INFO L216 LassoAnalysis]: Preferences: 17.12/8.07 [2019-03-29 01:52:48,738 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.12/8.07 [2019-03-29 01:52:48,739 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.12/8.07 [2019-03-29 01:52:48,739 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.12/8.07 [2019-03-29 01:52:48,739 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.12/8.07 [2019-03-29 01:52:48,739 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.12/8.07 [2019-03-29 01:52:48,739 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.12/8.07 [2019-03-29 01:52:48,739 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.12/8.07 [2019-03-29 01:52:48,739 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 17.12/8.07 [2019-03-29 01:52:48,740 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.12/8.07 [2019-03-29 01:52:48,740 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.12/8.07 [2019-03-29 01:52:48,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.12/8.07 [2019-03-29 01:52:48,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.12/8.07 [2019-03-29 01:52:48,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.12/8.07 [2019-03-29 01:52:48,851 INFO L300 LassoAnalysis]: Preprocessing complete. 17.12/8.07 [2019-03-29 01:52:48,857 INFO L497 LassoAnalysis]: Using template 'affine'. 17.12/8.07 [2019-03-29 01:52:48,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.12/8.07 Termination analysis: LINEAR_WITH_GUESSES 17.12/8.07 Number of strict supporting invariants: 0 17.12/8.07 Number of non-strict supporting invariants: 1 17.12/8.07 Consider only non-deceasing supporting invariants: true 17.12/8.07 Simplify termination arguments: true 17.12/8.07 Simplify supporting invariants: trueOverapproximate stem: false 17.12/8.07 [2019-03-29 01:52:48,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.12/8.07 [2019-03-29 01:52:48,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.12/8.07 [2019-03-29 01:52:48,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.12/8.07 [2019-03-29 01:52:48,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.12/8.07 [2019-03-29 01:52:48,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 17.12/8.07 [2019-03-29 01:52:48,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 17.12/8.07 [2019-03-29 01:52:48,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.12/8.07 [2019-03-29 01:52:48,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.12/8.07 Termination analysis: LINEAR_WITH_GUESSES 17.12/8.07 Number of strict supporting invariants: 0 17.12/8.07 Number of non-strict supporting invariants: 1 17.12/8.07 Consider only non-deceasing supporting invariants: true 17.12/8.07 Simplify termination arguments: true 17.12/8.07 Simplify supporting invariants: trueOverapproximate stem: false 17.12/8.07 [2019-03-29 01:52:48,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.12/8.07 [2019-03-29 01:52:48,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.12/8.07 [2019-03-29 01:52:48,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.12/8.07 [2019-03-29 01:52:48,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.12/8.07 [2019-03-29 01:52:48,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 17.12/8.07 [2019-03-29 01:52:48,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 17.12/8.07 [2019-03-29 01:52:48,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.12/8.07 [2019-03-29 01:52:48,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.12/8.07 Termination analysis: LINEAR_WITH_GUESSES 17.12/8.07 Number of strict supporting invariants: 0 17.12/8.07 Number of non-strict supporting invariants: 1 17.12/8.07 Consider only non-deceasing supporting invariants: true 17.12/8.07 Simplify termination arguments: true 17.12/8.07 Simplify supporting invariants: trueOverapproximate stem: false 17.12/8.07 [2019-03-29 01:52:48,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.12/8.07 [2019-03-29 01:52:48,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.12/8.07 [2019-03-29 01:52:48,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.12/8.07 [2019-03-29 01:52:48,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.12/8.07 [2019-03-29 01:52:48,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.12/8.07 [2019-03-29 01:52:48,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.12/8.07 [2019-03-29 01:52:48,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.12/8.07 [2019-03-29 01:52:48,902 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.12/8.07 [2019-03-29 01:52:48,911 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 17.12/8.07 [2019-03-29 01:52:48,911 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 17.12/8.07 [2019-03-29 01:52:48,913 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.12/8.07 [2019-03-29 01:52:48,914 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 17.12/8.07 [2019-03-29 01:52:48,914 INFO L518 LassoAnalysis]: Proved termination. 17.12/8.07 [2019-03-29 01:52:48,914 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.12/8.07 Ranking function f(ULTIMATE.start_main_~q~0) = 1*ULTIMATE.start_main_~q~0 17.12/8.07 Supporting invariants [] 17.12/8.07 [2019-03-29 01:52:48,916 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 17.12/8.07 [2019-03-29 01:52:48,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.12/8.07 [2019-03-29 01:52:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.12/8.07 [2019-03-29 01:52:48,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 17.12/8.07 [2019-03-29 01:52:48,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.12/8.07 [2019-03-29 01:52:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.12/8.07 [2019-03-29 01:52:48,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 17.12/8.07 [2019-03-29 01:52:48,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.12/8.07 [2019-03-29 01:52:48,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.12/8.07 [2019-03-29 01:52:48,997 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 17.12/8.07 [2019-03-29 01:52:49,002 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 2 loop predicates 17.12/8.07 [2019-03-29 01:52:49,003 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states. Second operand 3 states. 17.12/8.07 [2019-03-29 01:52:49,060 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states.. Second operand 3 states. Result 13 states and 26 transitions. Complement of second has 4 states. 17.12/8.07 [2019-03-29 01:52:49,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 17.12/8.07 [2019-03-29 01:52:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 17.12/8.07 [2019-03-29 01:52:49,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. 17.12/8.07 [2019-03-29 01:52:49,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 1 letters. Loop has 2 letters. 17.12/8.07 [2019-03-29 01:52:49,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.12/8.07 [2019-03-29 01:52:49,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 3 letters. Loop has 2 letters. 17.12/8.07 [2019-03-29 01:52:49,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.12/8.07 [2019-03-29 01:52:49,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 1 letters. Loop has 4 letters. 17.12/8.07 [2019-03-29 01:52:49,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.12/8.07 [2019-03-29 01:52:49,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 26 transitions. 17.12/8.07 [2019-03-29 01:52:49,075 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 17.12/8.07 [2019-03-29 01:52:49,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 26 transitions. 17.12/8.07 [2019-03-29 01:52:49,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 17.12/8.07 [2019-03-29 01:52:49,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 17.12/8.07 [2019-03-29 01:52:49,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 26 transitions. 17.12/8.07 [2019-03-29 01:52:49,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 17.12/8.07 [2019-03-29 01:52:49,082 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 26 transitions. 17.12/8.07 [2019-03-29 01:52:49,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 26 transitions. 17.12/8.07 [2019-03-29 01:52:49,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. 17.12/8.07 [2019-03-29 01:52:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 17.12/8.07 [2019-03-29 01:52:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. 17.12/8.07 [2019-03-29 01:52:49,112 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 25 transitions. 17.12/8.07 [2019-03-29 01:52:49,112 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 25 transitions. 17.12/8.07 [2019-03-29 01:52:49,112 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 17.12/8.07 [2019-03-29 01:52:49,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 25 transitions. 17.12/8.07 [2019-03-29 01:52:49,113 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 17.12/8.07 [2019-03-29 01:52:49,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.12/8.07 [2019-03-29 01:52:49,113 INFO L119 BuchiIsEmpty]: Starting construction of run 17.12/8.07 [2019-03-29 01:52:49,114 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 17.12/8.07 [2019-03-29 01:52:49,114 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.12/8.07 [2019-03-29 01:52:49,114 INFO L794 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L26-2: Formula: (and (= v_ULTIMATE.start_main_~p~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~q~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_1, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~p~0, ULTIMATE.start_main_~q~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3] 55#L26-2 [47] L26-2-->L23: Formula: (and (< 0 v_ULTIMATE.start_main_~q~0_10) (< 0 v_ULTIMATE.start_main_~p~0_10) (< v_ULTIMATE.start_main_~p~0_10 v_ULTIMATE.start_main_~q~0_10)) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_10} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_10} AuxVars[] AssignedVars[] 56#L23 17.12/8.07 [2019-03-29 01:52:49,115 INFO L796 eck$LassoCheckResult]: Loop: 56#L23 [42] L23-->L26: Formula: (>= v_ULTIMATE.start_main_~q~0_13 v_ULTIMATE.start_main_~p~0_13) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_13, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_13} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_13, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_13} AuxVars[] AssignedVars[] 57#L26 [43] L26-->L26-2: Formula: (>= v_ULTIMATE.start_main_~p~0_8 v_ULTIMATE.start_main_~q~0_8) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_8, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_8} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_8, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_8} AuxVars[] AssignedVars[] 60#L26-2 [48] L26-2-->L23: Formula: (and (< 0 v_ULTIMATE.start_main_~q~0_10) (< 0 v_ULTIMATE.start_main_~p~0_10) (> v_ULTIMATE.start_main_~p~0_10 v_ULTIMATE.start_main_~q~0_10)) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_10} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_10} AuxVars[] AssignedVars[] 56#L23 17.12/8.07 [2019-03-29 01:52:49,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.12/8.07 [2019-03-29 01:52:49,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2000, now seen corresponding path program 1 times 17.12/8.07 [2019-03-29 01:52:49,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.12/8.07 [2019-03-29 01:52:49,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.12/8.07 [2019-03-29 01:52:49,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:49,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.12/8.07 [2019-03-29 01:52:49,124 INFO L82 PathProgramCache]: Analyzing trace with hash 71534, now seen corresponding path program 1 times 17.12/8.07 [2019-03-29 01:52:49,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.12/8.07 [2019-03-29 01:52:49,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.12/8.07 [2019-03-29 01:52:49,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.12/8.07 [2019-03-29 01:52:49,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.12/8.07 [2019-03-29 01:52:49,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.12/8.07 [2019-03-29 01:52:49,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 17.12/8.07 [2019-03-29 01:52:49,161 INFO L811 eck$LassoCheckResult]: loop already infeasible 17.12/8.07 [2019-03-29 01:52:49,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 17.12/8.07 [2019-03-29 01:52:49,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 17.12/8.07 [2019-03-29 01:52:49,165 INFO L87 Difference]: Start difference. First operand 12 states and 25 transitions. cyclomatic complexity: 16 Second operand 3 states. 17.12/8.07 [2019-03-29 01:52:49,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.12/8.07 [2019-03-29 01:52:49,192 INFO L93 Difference]: Finished difference Result 16 states and 27 transitions. 17.12/8.07 [2019-03-29 01:52:49,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 17.12/8.07 [2019-03-29 01:52:49,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 27 transitions. 17.12/8.07 [2019-03-29 01:52:49,195 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 17.12/8.07 [2019-03-29 01:52:49,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 13 states and 21 transitions. 17.12/8.07 [2019-03-29 01:52:49,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 17.12/8.07 [2019-03-29 01:52:49,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 17.12/8.07 [2019-03-29 01:52:49,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 21 transitions. 17.12/8.07 [2019-03-29 01:52:49,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 17.12/8.07 [2019-03-29 01:52:49,197 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 21 transitions. 17.12/8.07 [2019-03-29 01:52:49,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 21 transitions. 17.12/8.07 [2019-03-29 01:52:49,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. 17.12/8.07 [2019-03-29 01:52:49,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 17.12/8.07 [2019-03-29 01:52:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. 17.12/8.07 [2019-03-29 01:52:49,199 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 16 transitions. 17.12/8.07 [2019-03-29 01:52:49,199 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 16 transitions. 17.12/8.07 [2019-03-29 01:52:49,199 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 17.12/8.07 [2019-03-29 01:52:49,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 16 transitions. 17.12/8.07 [2019-03-29 01:52:49,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 17.12/8.07 [2019-03-29 01:52:49,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.12/8.07 [2019-03-29 01:52:49,200 INFO L119 BuchiIsEmpty]: Starting construction of run 17.12/8.07 [2019-03-29 01:52:49,200 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 17.12/8.07 [2019-03-29 01:52:49,201 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.12/8.07 [2019-03-29 01:52:49,201 INFO L794 eck$LassoCheckResult]: Stem: 87#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L26-2: Formula: (and (= v_ULTIMATE.start_main_~p~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~q~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_1, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~p~0, ULTIMATE.start_main_~q~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3] 88#L26-2 [47] L26-2-->L23: Formula: (and (< 0 v_ULTIMATE.start_main_~q~0_10) (< 0 v_ULTIMATE.start_main_~p~0_10) (< v_ULTIMATE.start_main_~p~0_10 v_ULTIMATE.start_main_~q~0_10)) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_10} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_10} AuxVars[] AssignedVars[] 89#L23 17.12/8.07 [2019-03-29 01:52:49,201 INFO L796 eck$LassoCheckResult]: Loop: 89#L23 [42] L23-->L26: Formula: (>= v_ULTIMATE.start_main_~q~0_13 v_ULTIMATE.start_main_~p~0_13) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_13, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_13} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_13, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_13} AuxVars[] AssignedVars[] 84#L26 [43] L26-->L26-2: Formula: (>= v_ULTIMATE.start_main_~p~0_8 v_ULTIMATE.start_main_~q~0_8) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_8, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_8} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_8, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_8} AuxVars[] AssignedVars[] 85#L26-2 [47] L26-2-->L23: Formula: (and (< 0 v_ULTIMATE.start_main_~q~0_10) (< 0 v_ULTIMATE.start_main_~p~0_10) (< v_ULTIMATE.start_main_~p~0_10 v_ULTIMATE.start_main_~q~0_10)) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_10} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_10} AuxVars[] AssignedVars[] 89#L23 17.12/8.07 [2019-03-29 01:52:49,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.12/8.07 [2019-03-29 01:52:49,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2000, now seen corresponding path program 2 times 17.12/8.07 [2019-03-29 01:52:49,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.12/8.07 [2019-03-29 01:52:49,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.12/8.07 [2019-03-29 01:52:49,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:49,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.12/8.07 [2019-03-29 01:52:49,210 INFO L82 PathProgramCache]: Analyzing trace with hash 71533, now seen corresponding path program 1 times 17.12/8.07 [2019-03-29 01:52:49,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.12/8.07 [2019-03-29 01:52:49,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.12/8.07 [2019-03-29 01:52:49,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.12/8.07 [2019-03-29 01:52:49,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.12/8.07 [2019-03-29 01:52:49,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.12/8.07 [2019-03-29 01:52:49,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 17.12/8.07 [2019-03-29 01:52:49,221 INFO L811 eck$LassoCheckResult]: loop already infeasible 17.12/8.07 [2019-03-29 01:52:49,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 17.12/8.07 [2019-03-29 01:52:49,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 17.12/8.07 [2019-03-29 01:52:49,222 INFO L87 Difference]: Start difference. First operand 9 states and 16 transitions. cyclomatic complexity: 9 Second operand 3 states. 17.12/8.07 [2019-03-29 01:52:49,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.12/8.07 [2019-03-29 01:52:49,239 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. 17.12/8.07 [2019-03-29 01:52:49,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 17.12/8.07 [2019-03-29 01:52:49,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. 17.12/8.07 [2019-03-29 01:52:49,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 17.12/8.07 [2019-03-29 01:52:49,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 8 states and 11 transitions. 17.12/8.07 [2019-03-29 01:52:49,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 17.12/8.07 [2019-03-29 01:52:49,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 17.12/8.07 [2019-03-29 01:52:49,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. 17.12/8.07 [2019-03-29 01:52:49,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.12/8.07 [2019-03-29 01:52:49,243 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. 17.12/8.07 [2019-03-29 01:52:49,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. 17.12/8.07 [2019-03-29 01:52:49,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. 17.12/8.07 [2019-03-29 01:52:49,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 17.12/8.07 [2019-03-29 01:52:49,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. 17.12/8.07 [2019-03-29 01:52:49,245 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. 17.12/8.07 [2019-03-29 01:52:49,245 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. 17.12/8.07 [2019-03-29 01:52:49,245 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 17.12/8.07 [2019-03-29 01:52:49,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. 17.12/8.07 [2019-03-29 01:52:49,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 17.12/8.07 [2019-03-29 01:52:49,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.12/8.07 [2019-03-29 01:52:49,246 INFO L119 BuchiIsEmpty]: Starting construction of run 17.12/8.07 [2019-03-29 01:52:49,246 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 17.12/8.07 [2019-03-29 01:52:49,246 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.12/8.07 [2019-03-29 01:52:49,246 INFO L794 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L26-2: Formula: (and (= v_ULTIMATE.start_main_~p~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~q~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_1, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~p~0, ULTIMATE.start_main_~q~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3] 113#L26-2 [47] L26-2-->L23: Formula: (and (< 0 v_ULTIMATE.start_main_~q~0_10) (< 0 v_ULTIMATE.start_main_~p~0_10) (< v_ULTIMATE.start_main_~p~0_10 v_ULTIMATE.start_main_~q~0_10)) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_10} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_10} AuxVars[] AssignedVars[] 117#L23 17.12/8.07 [2019-03-29 01:52:49,247 INFO L796 eck$LassoCheckResult]: Loop: 117#L23 [42] L23-->L26: Formula: (>= v_ULTIMATE.start_main_~q~0_13 v_ULTIMATE.start_main_~p~0_13) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_13, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_13} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_13, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_13} AuxVars[] AssignedVars[] 110#L26 [30] L26-->L26-2: Formula: (and (= v_ULTIMATE.start_main_~q~0_6 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~p~0_7 v_ULTIMATE.start_main_~q~0_7) (= v_ULTIMATE.start_main_~p~0_6 (+ v_ULTIMATE.start_main_~p~0_7 (- 1)))) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_7, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_7, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_6, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_6, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~p~0, ULTIMATE.start_main_~q~0, ULTIMATE.start_main_#t~nondet3] 111#L26-2 [47] L26-2-->L23: Formula: (and (< 0 v_ULTIMATE.start_main_~q~0_10) (< 0 v_ULTIMATE.start_main_~p~0_10) (< v_ULTIMATE.start_main_~p~0_10 v_ULTIMATE.start_main_~q~0_10)) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_10} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_10} AuxVars[] AssignedVars[] 117#L23 17.12/8.07 [2019-03-29 01:52:49,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.12/8.07 [2019-03-29 01:52:49,247 INFO L82 PathProgramCache]: Analyzing trace with hash 2000, now seen corresponding path program 3 times 17.12/8.07 [2019-03-29 01:52:49,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.12/8.07 [2019-03-29 01:52:49,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.12/8.07 [2019-03-29 01:52:49,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:49,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.12/8.07 [2019-03-29 01:52:49,255 INFO L82 PathProgramCache]: Analyzing trace with hash 71130, now seen corresponding path program 1 times 17.12/8.07 [2019-03-29 01:52:49,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.12/8.07 [2019-03-29 01:52:49,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.12/8.07 [2019-03-29 01:52:49,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:49,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.12/8.07 [2019-03-29 01:52:49,263 INFO L82 PathProgramCache]: Analyzing trace with hash 59623339, now seen corresponding path program 1 times 17.12/8.07 [2019-03-29 01:52:49,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.12/8.07 [2019-03-29 01:52:49,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.12/8.07 [2019-03-29 01:52:49,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:49,306 INFO L216 LassoAnalysis]: Preferences: 17.12/8.07 [2019-03-29 01:52:49,307 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.12/8.07 [2019-03-29 01:52:49,307 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.12/8.07 [2019-03-29 01:52:49,307 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.12/8.07 [2019-03-29 01:52:49,307 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.12/8.07 [2019-03-29 01:52:49,307 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.12/8.07 [2019-03-29 01:52:49,308 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.12/8.07 [2019-03-29 01:52:49,308 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.12/8.07 [2019-03-29 01:52:49,308 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 17.12/8.07 [2019-03-29 01:52:49,308 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.12/8.07 [2019-03-29 01:52:49,308 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.12/8.07 [2019-03-29 01:52:49,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.12/8.07 [2019-03-29 01:52:49,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.12/8.07 [2019-03-29 01:52:49,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.12/8.07 [2019-03-29 01:52:49,411 INFO L300 LassoAnalysis]: Preprocessing complete. 17.12/8.07 [2019-03-29 01:52:49,412 INFO L412 LassoAnalysis]: Checking for nontermination... 17.12/8.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.12/8.07 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.12/8.07 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.12/8.07 [2019-03-29 01:52:49,421 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.12/8.07 [2019-03-29 01:52:49,422 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.12/8.07 [2019-03-29 01:52:49,452 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.12/8.07 [2019-03-29 01:52:49,452 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.12/8.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.12/8.07 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.12/8.07 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.12/8.07 [2019-03-29 01:52:49,467 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.12/8.07 [2019-03-29 01:52:49,467 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.12/8.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.12/8.07 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.12/8.07 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.12/8.07 [2019-03-29 01:52:49,502 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.12/8.07 [2019-03-29 01:52:49,502 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.12/8.07 [2019-03-29 01:52:49,707 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 17.12/8.07 [2019-03-29 01:52:49,710 INFO L216 LassoAnalysis]: Preferences: 17.12/8.07 [2019-03-29 01:52:49,723 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.12/8.07 [2019-03-29 01:52:49,723 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.12/8.07 [2019-03-29 01:52:49,723 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.12/8.07 [2019-03-29 01:52:49,723 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.12/8.07 [2019-03-29 01:52:49,724 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.12/8.07 [2019-03-29 01:52:49,724 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.12/8.07 [2019-03-29 01:52:49,724 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.12/8.07 [2019-03-29 01:52:49,724 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 17.12/8.07 [2019-03-29 01:52:49,724 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.12/8.07 [2019-03-29 01:52:49,724 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.12/8.07 [2019-03-29 01:52:49,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.12/8.07 [2019-03-29 01:52:49,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.12/8.07 [2019-03-29 01:52:49,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.12/8.07 [2019-03-29 01:52:49,807 INFO L300 LassoAnalysis]: Preprocessing complete. 17.12/8.07 [2019-03-29 01:52:49,807 INFO L497 LassoAnalysis]: Using template 'affine'. 17.12/8.07 [2019-03-29 01:52:49,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.12/8.07 Termination analysis: LINEAR_WITH_GUESSES 17.12/8.07 Number of strict supporting invariants: 0 17.12/8.07 Number of non-strict supporting invariants: 1 17.12/8.07 Consider only non-deceasing supporting invariants: true 17.12/8.07 Simplify termination arguments: true 17.12/8.07 Simplify supporting invariants: trueOverapproximate stem: false 17.12/8.07 [2019-03-29 01:52:49,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.12/8.07 [2019-03-29 01:52:49,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.12/8.07 [2019-03-29 01:52:49,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.12/8.07 [2019-03-29 01:52:49,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.12/8.07 [2019-03-29 01:52:49,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 17.12/8.07 [2019-03-29 01:52:49,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 17.12/8.07 [2019-03-29 01:52:49,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.12/8.07 [2019-03-29 01:52:49,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.12/8.07 Termination analysis: LINEAR_WITH_GUESSES 17.12/8.07 Number of strict supporting invariants: 0 17.12/8.07 Number of non-strict supporting invariants: 1 17.12/8.07 Consider only non-deceasing supporting invariants: true 17.12/8.07 Simplify termination arguments: true 17.12/8.07 Simplify supporting invariants: trueOverapproximate stem: false 17.12/8.07 [2019-03-29 01:52:49,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.12/8.07 [2019-03-29 01:52:49,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.12/8.07 [2019-03-29 01:52:49,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.12/8.07 [2019-03-29 01:52:49,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.12/8.07 [2019-03-29 01:52:49,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.12/8.07 [2019-03-29 01:52:49,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.12/8.07 [2019-03-29 01:52:49,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.12/8.07 [2019-03-29 01:52:49,825 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.12/8.07 [2019-03-29 01:52:49,837 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 17.12/8.07 [2019-03-29 01:52:49,838 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 17.12/8.07 [2019-03-29 01:52:49,838 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.12/8.07 [2019-03-29 01:52:49,838 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 17.12/8.07 [2019-03-29 01:52:49,839 INFO L518 LassoAnalysis]: Proved termination. 17.12/8.07 [2019-03-29 01:52:49,839 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.12/8.07 Ranking function f(ULTIMATE.start_main_~p~0) = 1*ULTIMATE.start_main_~p~0 17.12/8.07 Supporting invariants [] 17.12/8.07 [2019-03-29 01:52:49,839 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 17.12/8.07 [2019-03-29 01:52:49,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.12/8.07 [2019-03-29 01:52:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.12/8.07 [2019-03-29 01:52:49,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core 17.12/8.07 [2019-03-29 01:52:49,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.12/8.07 [2019-03-29 01:52:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.12/8.07 [2019-03-29 01:52:49,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core 17.12/8.07 [2019-03-29 01:52:49,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.12/8.07 [2019-03-29 01:52:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.12/8.07 [2019-03-29 01:52:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.12/8.07 [2019-03-29 01:52:49,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core 17.12/8.07 [2019-03-29 01:52:49,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.12/8.07 [2019-03-29 01:52:49,917 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 17.12/8.07 [2019-03-29 01:52:49,917 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 17.12/8.07 [2019-03-29 01:52:49,917 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 4 states. 17.12/8.07 [2019-03-29 01:52:49,965 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 15 states and 19 transitions. Complement of second has 7 states. 17.12/8.07 [2019-03-29 01:52:49,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states 17.12/8.07 [2019-03-29 01:52:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 17.12/8.07 [2019-03-29 01:52:49,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. 17.12/8.07 [2019-03-29 01:52:49,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 3 letters. 17.12/8.07 [2019-03-29 01:52:49,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.12/8.07 [2019-03-29 01:52:49,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. 17.12/8.07 [2019-03-29 01:52:49,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.12/8.07 [2019-03-29 01:52:49,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 6 letters. 17.12/8.07 [2019-03-29 01:52:49,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.12/8.07 [2019-03-29 01:52:49,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. 17.12/8.07 [2019-03-29 01:52:49,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 17.12/8.07 [2019-03-29 01:52:49,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 15 transitions. 17.12/8.07 [2019-03-29 01:52:49,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 17.12/8.07 [2019-03-29 01:52:49,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 17.12/8.07 [2019-03-29 01:52:49,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. 17.12/8.07 [2019-03-29 01:52:49,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.12/8.07 [2019-03-29 01:52:49,971 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. 17.12/8.07 [2019-03-29 01:52:49,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. 17.12/8.07 [2019-03-29 01:52:49,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. 17.12/8.07 [2019-03-29 01:52:49,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 17.12/8.07 [2019-03-29 01:52:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. 17.12/8.07 [2019-03-29 01:52:49,973 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. 17.12/8.07 [2019-03-29 01:52:49,973 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. 17.12/8.07 [2019-03-29 01:52:49,973 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 17.12/8.07 [2019-03-29 01:52:49,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. 17.12/8.07 [2019-03-29 01:52:49,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 17.12/8.07 [2019-03-29 01:52:49,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.12/8.07 [2019-03-29 01:52:49,974 INFO L119 BuchiIsEmpty]: Starting construction of run 17.12/8.07 [2019-03-29 01:52:49,974 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 17.12/8.07 [2019-03-29 01:52:49,974 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 17.12/8.07 [2019-03-29 01:52:49,975 INFO L794 eck$LassoCheckResult]: Stem: 185#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L26-2: Formula: (and (= v_ULTIMATE.start_main_~p~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~q~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_1, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~p~0, ULTIMATE.start_main_~q~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3] 186#L26-2 [47] L26-2-->L23: Formula: (and (< 0 v_ULTIMATE.start_main_~q~0_10) (< 0 v_ULTIMATE.start_main_~p~0_10) (< v_ULTIMATE.start_main_~p~0_10 v_ULTIMATE.start_main_~q~0_10)) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_10} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_10} AuxVars[] AssignedVars[] 191#L23 17.12/8.07 [2019-03-29 01:52:49,975 INFO L796 eck$LassoCheckResult]: Loop: 191#L23 [42] L23-->L26: Formula: (>= v_ULTIMATE.start_main_~q~0_13 v_ULTIMATE.start_main_~p~0_13) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_13, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_13} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_13, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_13} AuxVars[] AssignedVars[] 183#L26 [30] L26-->L26-2: Formula: (and (= v_ULTIMATE.start_main_~q~0_6 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~p~0_7 v_ULTIMATE.start_main_~q~0_7) (= v_ULTIMATE.start_main_~p~0_6 (+ v_ULTIMATE.start_main_~p~0_7 (- 1)))) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_7, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_7, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_6, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_6, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~p~0, ULTIMATE.start_main_~q~0, ULTIMATE.start_main_#t~nondet3] 184#L26-2 [48] L26-2-->L23: Formula: (and (< 0 v_ULTIMATE.start_main_~q~0_10) (< 0 v_ULTIMATE.start_main_~p~0_10) (> v_ULTIMATE.start_main_~p~0_10 v_ULTIMATE.start_main_~q~0_10)) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_10} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_10} AuxVars[] AssignedVars[] 187#L23 [33] L23-->L26-2: Formula: (and (= v_ULTIMATE.start_main_~q~0_11 (+ v_ULTIMATE.start_main_~q~0_12 (- 1))) (= v_ULTIMATE.start_main_~p~0_11 |v_ULTIMATE.start_main_#t~nondet2_3|) (< v_ULTIMATE.start_main_~q~0_12 v_ULTIMATE.start_main_~p~0_12)) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_12, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_12, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_11, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_11, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~p~0, ULTIMATE.start_main_~q~0, ULTIMATE.start_main_#t~nondet2] 188#L26-2 [47] L26-2-->L23: Formula: (and (< 0 v_ULTIMATE.start_main_~q~0_10) (< 0 v_ULTIMATE.start_main_~p~0_10) (< v_ULTIMATE.start_main_~p~0_10 v_ULTIMATE.start_main_~q~0_10)) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_10} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_10} AuxVars[] AssignedVars[] 191#L23 17.12/8.07 [2019-03-29 01:52:49,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.12/8.07 [2019-03-29 01:52:49,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2000, now seen corresponding path program 4 times 17.12/8.07 [2019-03-29 01:52:49,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.12/8.07 [2019-03-29 01:52:49,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.12/8.07 [2019-03-29 01:52:49,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:49,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.12/8.07 [2019-03-29 01:52:49,982 INFO L82 PathProgramCache]: Analyzing trace with hash 68357961, now seen corresponding path program 1 times 17.12/8.07 [2019-03-29 01:52:49,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.12/8.07 [2019-03-29 01:52:49,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.12/8.07 [2019-03-29 01:52:49,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:49,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.12/8.07 [2019-03-29 01:52:49,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1463455962, now seen corresponding path program 1 times 17.12/8.07 [2019-03-29 01:52:49,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.12/8.07 [2019-03-29 01:52:49,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.12/8.07 [2019-03-29 01:52:49,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:49,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.12/8.07 [2019-03-29 01:52:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:50,070 INFO L216 LassoAnalysis]: Preferences: 17.12/8.07 [2019-03-29 01:52:50,070 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.12/8.07 [2019-03-29 01:52:50,071 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.12/8.07 [2019-03-29 01:52:50,071 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.12/8.07 [2019-03-29 01:52:50,071 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.12/8.07 [2019-03-29 01:52:50,071 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.12/8.07 [2019-03-29 01:52:50,072 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.12/8.07 [2019-03-29 01:52:50,072 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.12/8.07 [2019-03-29 01:52:50,072 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 17.12/8.07 [2019-03-29 01:52:50,072 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.12/8.07 [2019-03-29 01:52:50,072 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.12/8.07 [2019-03-29 01:52:50,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.12/8.07 [2019-03-29 01:52:50,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.12/8.07 [2019-03-29 01:52:50,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.12/8.07 [2019-03-29 01:52:50,150 INFO L300 LassoAnalysis]: Preprocessing complete. 17.12/8.07 [2019-03-29 01:52:50,151 INFO L412 LassoAnalysis]: Checking for nontermination... 17.12/8.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.12/8.07 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.12/8.07 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.12/8.07 [2019-03-29 01:52:50,156 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.12/8.07 [2019-03-29 01:52:50,156 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.12/8.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.12/8.07 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.12/8.07 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.12/8.07 [2019-03-29 01:52:50,193 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.12/8.07 [2019-03-29 01:52:50,193 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.12/8.07 [2019-03-29 01:52:50,501 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 17.12/8.07 [2019-03-29 01:52:50,504 INFO L216 LassoAnalysis]: Preferences: 17.12/8.07 [2019-03-29 01:52:50,504 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.12/8.07 [2019-03-29 01:52:50,504 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.12/8.07 [2019-03-29 01:52:50,504 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.12/8.07 [2019-03-29 01:52:50,504 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.12/8.07 [2019-03-29 01:52:50,504 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.12/8.07 [2019-03-29 01:52:50,504 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.12/8.07 [2019-03-29 01:52:50,505 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.12/8.07 [2019-03-29 01:52:50,505 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 17.12/8.07 [2019-03-29 01:52:50,505 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.12/8.07 [2019-03-29 01:52:50,505 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.12/8.07 [2019-03-29 01:52:50,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.12/8.07 [2019-03-29 01:52:50,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.12/8.07 [2019-03-29 01:52:50,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.12/8.07 [2019-03-29 01:52:50,580 INFO L300 LassoAnalysis]: Preprocessing complete. 17.12/8.07 [2019-03-29 01:52:50,580 INFO L497 LassoAnalysis]: Using template 'affine'. 17.12/8.07 [2019-03-29 01:52:50,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.12/8.07 Termination analysis: LINEAR_WITH_GUESSES 17.12/8.07 Number of strict supporting invariants: 0 17.12/8.07 Number of non-strict supporting invariants: 1 17.12/8.07 Consider only non-deceasing supporting invariants: true 17.12/8.07 Simplify termination arguments: true 17.12/8.07 Simplify supporting invariants: trueOverapproximate stem: false 17.12/8.07 [2019-03-29 01:52:50,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.12/8.07 [2019-03-29 01:52:50,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.12/8.07 [2019-03-29 01:52:50,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.12/8.07 [2019-03-29 01:52:50,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.12/8.07 [2019-03-29 01:52:50,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.12/8.07 [2019-03-29 01:52:50,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.12/8.07 [2019-03-29 01:52:50,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.12/8.07 [2019-03-29 01:52:50,591 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.12/8.07 [2019-03-29 01:52:50,597 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 17.12/8.07 [2019-03-29 01:52:50,597 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. 17.12/8.07 [2019-03-29 01:52:50,597 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.12/8.07 [2019-03-29 01:52:50,598 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 17.12/8.07 [2019-03-29 01:52:50,598 INFO L518 LassoAnalysis]: Proved termination. 17.12/8.07 [2019-03-29 01:52:50,598 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.12/8.07 Ranking function f(ULTIMATE.start_main_~q~0) = 1*ULTIMATE.start_main_~q~0 17.12/8.07 Supporting invariants [] 17.12/8.07 [2019-03-29 01:52:50,599 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 17.12/8.07 [2019-03-29 01:52:50,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.12/8.07 [2019-03-29 01:52:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.12/8.07 [2019-03-29 01:52:50,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core 17.12/8.07 [2019-03-29 01:52:50,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.12/8.07 [2019-03-29 01:52:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.12/8.07 [2019-03-29 01:52:50,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjunts are in the unsatisfiable core 17.12/8.07 [2019-03-29 01:52:50,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.12/8.07 [2019-03-29 01:52:50,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.12/8.07 [2019-03-29 01:52:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.12/8.07 [2019-03-29 01:52:50,690 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 17.12/8.07 [2019-03-29 01:52:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.12/8.07 [2019-03-29 01:52:50,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core 17.12/8.07 [2019-03-29 01:52:50,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.12/8.07 [2019-03-29 01:52:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.12/8.07 [2019-03-29 01:52:50,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core 17.12/8.07 [2019-03-29 01:52:50,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.12/8.07 [2019-03-29 01:52:50,765 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 8 predicates after loop cannibalization 17.12/8.07 [2019-03-29 01:52:50,765 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 8 loop predicates 17.12/8.07 [2019-03-29 01:52:50,765 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 10 states and 14 transitions. cyclomatic complexity: 6 Second operand 6 states. 17.12/8.07 [2019-03-29 01:52:50,932 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 10 states and 14 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 25 states and 31 transitions. Complement of second has 21 states. 17.12/8.07 [2019-03-29 01:52:50,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 2 accepting loop states 17.12/8.07 [2019-03-29 01:52:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 17.12/8.07 [2019-03-29 01:52:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. 17.12/8.07 [2019-03-29 01:52:50,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 2 letters. Loop has 5 letters. 17.12/8.07 [2019-03-29 01:52:50,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.12/8.07 [2019-03-29 01:52:50,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 7 letters. Loop has 5 letters. 17.12/8.07 [2019-03-29 01:52:50,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.12/8.07 [2019-03-29 01:52:50,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 2 letters. Loop has 10 letters. 17.12/8.07 [2019-03-29 01:52:50,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.12/8.07 [2019-03-29 01:52:50,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. 17.12/8.07 [2019-03-29 01:52:50,937 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 17.12/8.07 [2019-03-29 01:52:50,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. 17.12/8.07 [2019-03-29 01:52:50,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 17.12/8.07 [2019-03-29 01:52:50,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 17.12/8.07 [2019-03-29 01:52:50,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 17.12/8.07 [2019-03-29 01:52:50,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.12/8.07 [2019-03-29 01:52:50,938 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 17.12/8.07 [2019-03-29 01:52:50,938 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 17.12/8.07 [2019-03-29 01:52:50,938 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 17.12/8.07 [2019-03-29 01:52:50,939 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 17.12/8.07 [2019-03-29 01:52:50,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 17.12/8.07 [2019-03-29 01:52:50,939 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 17.12/8.07 [2019-03-29 01:52:50,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 17.12/8.07 [2019-03-29 01:52:50,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 01:52:50 BasicIcfg 17.12/8.07 [2019-03-29 01:52:50,945 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 17.12/8.07 [2019-03-29 01:52:50,946 INFO L168 Benchmark]: Toolchain (without parser) took 3547.65 ms. Allocated memory was 649.6 MB in the beginning and 753.4 MB in the end (delta: 103.8 MB). Free memory was 563.9 MB in the beginning and 662.0 MB in the end (delta: -98.1 MB). Peak memory consumption was 5.8 MB. Max. memory is 50.3 GB. 17.12/8.07 [2019-03-29 01:52:50,947 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 586.6 MB. There was no memory consumed. Max. memory is 50.3 GB. 17.12/8.07 [2019-03-29 01:52:50,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.12 ms. Allocated memory is still 649.6 MB. Free memory was 563.9 MB in the beginning and 554.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 17.12/8.07 [2019-03-29 01:52:50,949 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.44 ms. Allocated memory was 649.6 MB in the beginning and 679.0 MB in the end (delta: 29.4 MB). Free memory was 554.4 MB in the beginning and 646.6 MB in the end (delta: -92.2 MB). Peak memory consumption was 21.5 MB. Max. memory is 50.3 GB. 17.12/8.07 [2019-03-29 01:52:50,949 INFO L168 Benchmark]: Boogie Preprocessor took 20.28 ms. Allocated memory is still 679.0 MB. Free memory was 646.6 MB in the beginning and 643.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 17.12/8.07 [2019-03-29 01:52:50,950 INFO L168 Benchmark]: RCFGBuilder took 195.68 ms. Allocated memory is still 679.0 MB. Free memory was 643.6 MB in the beginning and 629.3 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. 17.12/8.07 [2019-03-29 01:52:50,950 INFO L168 Benchmark]: BlockEncodingV2 took 77.53 ms. Allocated memory is still 679.0 MB. Free memory was 629.3 MB in the beginning and 624.2 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 50.3 GB. 17.12/8.07 [2019-03-29 01:52:50,951 INFO L168 Benchmark]: TraceAbstraction took 155.38 ms. Allocated memory is still 679.0 MB. Free memory was 622.8 MB in the beginning and 614.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 17.12/8.07 [2019-03-29 01:52:50,951 INFO L168 Benchmark]: BuchiAutomizer took 2760.97 ms. Allocated memory was 679.0 MB in the beginning and 753.4 MB in the end (delta: 74.4 MB). Free memory was 614.7 MB in the beginning and 662.0 MB in the end (delta: -47.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 50.3 GB. 17.12/8.07 [2019-03-29 01:52:50,956 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 17.12/8.07 --- Results --- 17.12/8.07 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 17.12/8.07 - StatisticsResult: Initial Icfg 17.12/8.07 8 locations, 11 edges 17.12/8.07 - StatisticsResult: Encoded RCFG 17.12/8.07 4 locations, 7 edges 17.12/8.07 * Results from de.uni_freiburg.informatik.ultimate.core: 17.12/8.07 - StatisticsResult: Toolchain Benchmarks 17.12/8.07 Benchmark results are: 17.12/8.07 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 586.6 MB. There was no memory consumed. Max. memory is 50.3 GB. 17.12/8.07 * CACSL2BoogieTranslator took 237.12 ms. Allocated memory is still 649.6 MB. Free memory was 563.9 MB in the beginning and 554.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 17.12/8.07 * Boogie Procedure Inliner took 95.44 ms. Allocated memory was 649.6 MB in the beginning and 679.0 MB in the end (delta: 29.4 MB). Free memory was 554.4 MB in the beginning and 646.6 MB in the end (delta: -92.2 MB). Peak memory consumption was 21.5 MB. Max. memory is 50.3 GB. 17.12/8.07 * Boogie Preprocessor took 20.28 ms. Allocated memory is still 679.0 MB. Free memory was 646.6 MB in the beginning and 643.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 17.12/8.07 * RCFGBuilder took 195.68 ms. Allocated memory is still 679.0 MB. Free memory was 643.6 MB in the beginning and 629.3 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. 17.12/8.07 * BlockEncodingV2 took 77.53 ms. Allocated memory is still 679.0 MB. Free memory was 629.3 MB in the beginning and 624.2 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 50.3 GB. 17.12/8.07 * TraceAbstraction took 155.38 ms. Allocated memory is still 679.0 MB. Free memory was 622.8 MB in the beginning and 614.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 17.12/8.07 * BuchiAutomizer took 2760.97 ms. Allocated memory was 679.0 MB in the beginning and 753.4 MB in the end (delta: 74.4 MB). Free memory was 614.7 MB in the beginning and 662.0 MB in the end (delta: -47.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 50.3 GB. 17.12/8.07 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 17.12/8.07 - AllSpecificationsHoldResult: All specifications hold 17.12/8.07 We were not able to verify any specifiation because the program does not contain any specification. 17.12/8.07 - InvariantResult [Line: 22]: Loop Invariant 17.12/8.07 Derived loop invariant: 1 17.12/8.07 - StatisticsResult: Ultimate Automizer benchmark data 17.12/8.07 CFG has 1 procedures, 4 locations, 0 error locations. SAFE Result, 0.0s 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=4occurred 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, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 17.12/8.07 - StatisticsResult: Constructed decomposition of program 17.12/8.07 Your program was decomposed into 5 terminating modules (2 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function q and consists of 3 locations. One nondeterministic module has affine ranking function p and consists of 4 locations. One nondeterministic module has affine ranking function q and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. 17.12/8.07 - StatisticsResult: Timing statistics 17.12/8.07 BüchiAutomizer plugin needed 2.7s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/2 HoareTripleCheckerStatistics: 13 SDtfs, 38 SDslu, 0 SDs, 0 SdLazy, 118 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax162 hnf100 lsp61 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf93 smp100 dnf100 smp100 tf107 neg100 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s 17.12/8.07 - TerminationAnalysisResult: Termination proven 17.12/8.07 Buchi Automizer proved that your program is terminating 17.12/8.07 RESULT: Ultimate proved your program to be correct! 17.12/8.07 !SESSION 2019-03-29 01:52:44.118 ----------------------------------------------- 17.12/8.07 eclipse.buildId=unknown 17.12/8.07 java.version=1.8.0_181 17.12/8.07 java.vendor=Oracle Corporation 17.12/8.07 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 17.12/8.07 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 17.12/8.07 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 17.12/8.07 17.12/8.07 !ENTRY org.eclipse.core.resources 2 10035 2019-03-29 01:52:51.188 17.12/8.07 !MESSAGE The workspace will exit with unsaved changes in this session. 17.12/8.07 Received shutdown request... 17.12/8.07 Ultimate: 17.12/8.07 GTK+ Version Check 17.12/8.07 EOF