NO Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 05:21:10,401 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 05:21:10,403 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 05:21:10,414 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 05:21:10,414 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 05:21:10,415 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 05:21:10,416 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 05:21:10,418 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 05:21:10,420 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 05:21:10,420 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 05:21:10,421 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 05:21:10,421 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 05:21:10,422 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 05:21:10,423 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 05:21:10,424 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 05:21:10,425 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 05:21:10,426 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 05:21:10,427 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 05:21:10,429 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 05:21:10,430 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 05:21:10,431 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 05:21:10,432 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 05:21:10,434 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 05:21:10,435 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 05:21:10,435 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 05:21:10,436 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 05:21:10,436 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 05:21:10,437 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 05:21:10,437 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 05:21:10,438 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 05:21:10,438 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 05:21:10,439 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 05:21:10,440 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 05:21:10,440 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 05:21:10,441 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 05:21:10,441 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 05:21:10,441 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 05:21:10,442 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 05:21:10,443 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 05:21:10,443 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 05:21:10,457 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 05:21:10,457 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 05:21:10,458 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 05:21:10,458 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 05:21:10,459 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 05:21:10,459 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:21:10,459 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 05:21:10,459 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 05:21:10,459 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 05:21:10,459 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 05:21:10,460 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 05:21:10,460 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 05:21:10,460 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 05:21:10,460 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 05:21:10,460 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:21:10,460 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 05:21:10,460 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 05:21:10,461 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 05:21:10,461 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 05:21:10,461 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 05:21:10,461 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 05:21:10,461 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 05:21:10,461 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 05:21:10,462 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 05:21:10,462 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 05:21:10,462 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 05:21:10,462 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 05:21:10,462 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 05:21:10,462 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 05:21:10,489 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 05:21:10,501 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 05:21:10,505 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 05:21:10,506 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 05:21:10,507 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 05:21:10,507 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 05:21:10,620 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/ccc4147dc06a4ad7b9bcd0afb890d6eb/FLAGb6aea1a8b [2020-06-22 05:21:10,950 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 05:21:10,951 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 05:21:10,958 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/ccc4147dc06a4ad7b9bcd0afb890d6eb/FLAGb6aea1a8b [2020-06-22 05:21:11,362 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/ccc4147dc06a4ad7b9bcd0afb890d6eb [2020-06-22 05:21:11,374 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 05:21:11,375 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 05:21:11,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 05:21:11,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 05:21:11,381 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 05:21:11,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:21:11" (1/1) ... [2020-06-22 05:21:11,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63149cff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:21:11, skipping insertion in model container [2020-06-22 05:21:11,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:21:11" (1/1) ... [2020-06-22 05:21:11,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 05:21:11,410 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 05:21:11,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:21:11,573 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 05:21:11,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:21:11,662 INFO L195 MainTranslator]: Completed translation [2020-06-22 05:21:11,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:21:11 WrapperNode [2020-06-22 05:21:11,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 05:21:11,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 05:21:11,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 05:21:11,664 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 05:21:11,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:21:11" (1/1) ... [2020-06-22 05:21:11,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:21:11" (1/1) ... [2020-06-22 05:21:11,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 05:21:11,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 05:21:11,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 05:21:11,699 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 05:21:11,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:21:11" (1/1) ... [2020-06-22 05:21:11,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:21:11" (1/1) ... [2020-06-22 05:21:11,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:21:11" (1/1) ... [2020-06-22 05:21:11,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:21:11" (1/1) ... [2020-06-22 05:21:11,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:21:11" (1/1) ... [2020-06-22 05:21:11,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:21:11" (1/1) ... [2020-06-22 05:21:11,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:21:11" (1/1) ... [2020-06-22 05:21:11,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 05:21:11,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 05:21:11,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 05:21:11,716 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 05:21:11,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:21:11" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 05:21:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-06-22 05:21:11,785 INFO L138 BoogieDeclarations]: Found implementation of procedure bsearch [2020-06-22 05:21:11,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 05:21:11,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 05:21:11,923 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 05:21:11,924 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2020-06-22 05:21:11,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:21:11 BoogieIcfgContainer [2020-06-22 05:21:11,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 05:21:11,926 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 05:21:11,926 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 05:21:11,928 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 05:21:11,929 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:21:11" (1/1) ... [2020-06-22 05:21:11,944 INFO L313 BlockEncoder]: Initial Icfg 15 locations, 18 edges [2020-06-22 05:21:11,946 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 05:21:11,947 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 05:21:11,947 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 05:21:11,947 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:21:11,949 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 05:21:11,950 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 05:21:11,950 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 05:21:11,967 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 05:21:11,984 INFO L200 BlockEncoder]: SBE split 2 edges [2020-06-22 05:21:11,988 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:21:11,990 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:21:11,999 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 05:21:12,001 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states [2020-06-22 05:21:12,003 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:21:12,003 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:21:12,003 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 05:21:12,004 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 05:21:12,004 INFO L313 BlockEncoder]: Encoded RCFG 11 locations, 18 edges [2020-06-22 05:21:12,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:21:12 BasicIcfg [2020-06-22 05:21:12,005 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 05:21:12,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 05:21:12,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 05:21:12,009 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 05:21:12,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 05:21:11" (1/4) ... [2020-06-22 05:21:12,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6791812c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:21:12, skipping insertion in model container [2020-06-22 05:21:12,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:21:11" (2/4) ... [2020-06-22 05:21:12,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6791812c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:21:12, skipping insertion in model container [2020-06-22 05:21:12,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:21:11" (3/4) ... [2020-06-22 05:21:12,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6791812c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:21:12, skipping insertion in model container [2020-06-22 05:21:12,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:21:12" (4/4) ... [2020-06-22 05:21:12,013 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:21:12,023 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 05:21:12,030 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 05:21:12,047 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 05:21:12,074 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:21:12,075 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 05:21:12,075 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 05:21:12,075 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:21:12,075 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:21:12,075 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:21:12,076 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 05:21:12,076 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:21:12,076 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 05:21:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2020-06-22 05:21:12,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 05:21:12,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-06-22 05:21:12,161 INFO L448 ceAbstractionStarter]: For program point bsearchEXIT(lines 8 15) no Hoare annotation was computed. [2020-06-22 05:21:12,161 INFO L451 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: true [2020-06-22 05:21:12,161 INFO L451 ceAbstractionStarter]: At program point L13(line 13) the Hoare annotation is: true [2020-06-22 05:21:12,161 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-06-22 05:21:12,162 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2020-06-22 05:21:12,162 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-06-22 05:21:12,162 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 05:21:12,162 INFO L451 ceAbstractionStarter]: At program point bsearchENTRY(lines 8 15) the Hoare annotation is: true [2020-06-22 05:21:12,162 INFO L448 ceAbstractionStarter]: For program point bsearchFINAL(lines 8 15) no Hoare annotation was computed. [2020-06-22 05:21:12,162 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 05:21:12,163 INFO L451 ceAbstractionStarter]: At program point L21(line 21) the Hoare annotation is: true [2020-06-22 05:21:12,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:21:12 BasicIcfg [2020-06-22 05:21:12,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 05:21:12,167 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 05:21:12,167 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 05:21:12,170 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 05:21:12,171 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:21:12,171 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 05:21:11" (1/5) ... [2020-06-22 05:21:12,172 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8477560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:21:12, skipping insertion in model container [2020-06-22 05:21:12,172 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:21:12,172 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:21:11" (2/5) ... [2020-06-22 05:21:12,172 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8477560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:21:12, skipping insertion in model container [2020-06-22 05:21:12,173 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:21:12,173 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:21:11" (3/5) ... [2020-06-22 05:21:12,173 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8477560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:21:12, skipping insertion in model container [2020-06-22 05:21:12,173 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:21:12,173 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:21:12" (4/5) ... [2020-06-22 05:21:12,174 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8477560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:21:12, skipping insertion in model container [2020-06-22 05:21:12,174 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:21:12,174 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:21:12" (5/5) ... [2020-06-22 05:21:12,175 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:21:12,203 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:21:12,203 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 05:21:12,203 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 05:21:12,203 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:21:12,203 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:21:12,204 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:21:12,204 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 05:21:12,204 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:21:12,204 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 05:21:12,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-06-22 05:21:12,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 05:21:12,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:21:12,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:21:12,238 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 05:21:12,238 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 05:21:12,239 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 05:21:12,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-06-22 05:21:12,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 05:21:12,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:21:12,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:21:12,241 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 05:21:12,241 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 05:21:12,246 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue [36] ULTIMATE.startENTRY-->L21: Formula: (and (= v_ULTIMATE.start_main_~x~0_2 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~y~0_2 |v_ULTIMATE.start_main_#t~nondet4_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_2} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|, |v_ULTIMATE.start_main_#t~nondet3_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 6#L21true [35] L21-->bsearchENTRY: Formula: (and (= |v_bsearch_#in~jInParam_3| v_ULTIMATE.start_main_~y~0_5) (= |v_bsearch_#in~iInParam_3| v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{bsearch_#in~j=|v_bsearch_#in~jInParam_3|, bsearch_#in~i=|v_bsearch_#in~iInParam_3|} AuxVars[] AssignedVars[bsearch_#in~j, bsearch_#in~i]< 10#bsearchENTRYtrue [2020-06-22 05:21:12,247 INFO L796 eck$LassoCheckResult]: Loop: 10#bsearchENTRYtrue [37] bsearchENTRY-->L10: Formula: (and (= v_bsearch_~i_1 |v_bsearch_#in~i_1|) (= v_bsearch_~j_1 |v_bsearch_#in~j_1|)) InVars {bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_#in~i=|v_bsearch_#in~i_1|} OutVars{bsearch_~j=v_bsearch_~j_1, bsearch_#in~i=|v_bsearch_#in~i_1|, bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_~i=v_bsearch_~i_1} AuxVars[] AssignedVars[bsearch_~i, bsearch_~j] 9#L10true [48] L10-->L12: Formula: (let ((.cse0 (+ v_bsearch_~j_3 v_bsearch_~i_3))) (and (= (div .cse0 2) v_bsearch_~mid~0_1) (> v_bsearch_~j_3 v_bsearch_~i_3) (= (mod .cse0 2) 0))) InVars {bsearch_~j=v_bsearch_~j_3, bsearch_~i=v_bsearch_~i_3} OutVars{bsearch_~j=v_bsearch_~j_3, bsearch_~mid~0=v_bsearch_~mid~0_1, bsearch_~i=v_bsearch_~i_3} AuxVars[] AssignedVars[bsearch_~mid~0] 3#L12true [28] L12-->L14: Formula: (= 0 |v_bsearch_#t~nondet0_4|) InVars {bsearch_#t~nondet0=|v_bsearch_#t~nondet0_4|} OutVars{bsearch_#t~nondet0=|v_bsearch_#t~nondet0_3|} AuxVars[] AssignedVars[bsearch_#t~nondet0] 11#L14true [38] L14-->bsearchENTRY: Formula: (and (= |v_bsearch_#in~iInParam_2| (+ v_bsearch_~mid~0_5 1)) (= |v_bsearch_#in~jInParam_2| v_bsearch_~j_5)) InVars {bsearch_~j=v_bsearch_~j_5, bsearch_~mid~0=v_bsearch_~mid~0_5} OutVars{bsearch_#in~j=|v_bsearch_#in~jInParam_2|, bsearch_#in~i=|v_bsearch_#in~iInParam_2|} AuxVars[] AssignedVars[bsearch_#in~j, bsearch_#in~i]< 10#bsearchENTRYtrue [2020-06-22 05:21:12,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:21:12,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2112, now seen corresponding path program 1 times [2020-06-22 05:21:12,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:21:12,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:21:12,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:12,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:21:12,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:12,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:21:12,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2072822, now seen corresponding path program 1 times [2020-06-22 05:21:12,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:21:12,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:21:12,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:12,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:21:12,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:12,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:21:12,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1951625653, now seen corresponding path program 1 times [2020-06-22 05:21:12,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:21:12,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:21:12,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:12,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:21:12,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:12,497 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:21:12,498 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:21:12,498 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:21:12,498 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:21:12,499 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:21:12,499 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:21:12,499 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:21:12,499 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:21:12,499 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 05:21:12,499 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:21:12,500 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:21:12,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:12,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:12,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:12,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:12,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:12,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:12,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:12,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:12,701 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:21:12,702 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:21:12,707 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:21:12,708 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:21:12,749 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:21:12,749 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:21:13,026 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:21:13,029 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:21:13,029 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:21:13,029 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:21:13,029 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:21:13,029 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:21:13,030 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:21:13,030 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:21:13,030 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:21:13,030 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 05:21:13,030 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:21:13,030 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:21:13,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:13,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:13,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:13,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:13,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:13,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:13,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:13,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:13,171 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:21:13,176 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:21:13,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:21:13,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:21:13,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:21:13,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:21:13,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:21:13,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:21:13,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:21:13,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:21:13,198 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:21:13,215 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 05:21:13,215 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:21:13,217 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:21:13,217 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:21:13,218 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:21:13,219 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(bsearch_#in~j, bsearch_#in~i) = 1*bsearch_#in~j - 1*bsearch_#in~i Supporting invariants [] [2020-06-22 05:21:13,220 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:21:13,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:21:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:21:13,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:21:13,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:21:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:21:13,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:21:13,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:21:13,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:21:13,376 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 05:21:13,382 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 [2020-06-22 05:21:13,383 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states. Second operand 4 states. [2020-06-22 05:21:19,532 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states.. Second operand 4 states. Result 82 states and 153 transitions. Complement of second has 16 states. [2020-06-22 05:21:19,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 05:21:19,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 05:21:19,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2020-06-22 05:21:19,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 2 letters. Loop has 4 letters. [2020-06-22 05:21:19,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:21:19,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 4 letters. [2020-06-22 05:21:19,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:21:19,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 2 letters. Loop has 8 letters. [2020-06-22 05:21:19,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:21:19,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 153 transitions. [2020-06-22 05:21:19,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 05:21:19,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 27 states and 43 transitions. [2020-06-22 05:21:19,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-06-22 05:21:19,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-06-22 05:21:19,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 43 transitions. [2020-06-22 05:21:19,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:21:19,566 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 43 transitions. [2020-06-22 05:21:19,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 43 transitions. [2020-06-22 05:21:19,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 14. [2020-06-22 05:21:19,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 05:21:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2020-06-22 05:21:19,597 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2020-06-22 05:21:19,598 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2020-06-22 05:21:19,598 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 05:21:19,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. [2020-06-22 05:21:19,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 05:21:19,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:21:19,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:21:19,599 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:21:19,599 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 05:21:19,600 INFO L794 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY [36] ULTIMATE.startENTRY-->L21: Formula: (and (= v_ULTIMATE.start_main_~x~0_2 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~y~0_2 |v_ULTIMATE.start_main_#t~nondet4_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_2} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|, |v_ULTIMATE.start_main_#t~nondet3_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 151#L21 [35] L21-->bsearchENTRY: Formula: (and (= |v_bsearch_#in~jInParam_3| v_ULTIMATE.start_main_~y~0_5) (= |v_bsearch_#in~iInParam_3| v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{bsearch_#in~j=|v_bsearch_#in~jInParam_3|, bsearch_#in~i=|v_bsearch_#in~iInParam_3|} AuxVars[] AssignedVars[bsearch_#in~j, bsearch_#in~i]< 155#bsearchENTRY [37] bsearchENTRY-->L10: Formula: (and (= v_bsearch_~i_1 |v_bsearch_#in~i_1|) (= v_bsearch_~j_1 |v_bsearch_#in~j_1|)) InVars {bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_#in~i=|v_bsearch_#in~i_1|} OutVars{bsearch_~j=v_bsearch_~j_1, bsearch_#in~i=|v_bsearch_#in~i_1|, bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_~i=v_bsearch_~i_1} AuxVars[] AssignedVars[bsearch_~i, bsearch_~j] 163#L10 [47] L10-->L12: Formula: (let ((.cse0 (+ v_bsearch_~j_3 v_bsearch_~i_3))) (and (= (div .cse0 2) v_bsearch_~mid~0_1) (>= .cse0 0) (> v_bsearch_~j_3 v_bsearch_~i_3))) InVars {bsearch_~j=v_bsearch_~j_3, bsearch_~i=v_bsearch_~i_3} OutVars{bsearch_~j=v_bsearch_~j_3, bsearch_~mid~0=v_bsearch_~mid~0_1, bsearch_~i=v_bsearch_~i_3} AuxVars[] AssignedVars[bsearch_~mid~0] 159#L12 [2020-06-22 05:21:19,600 INFO L796 eck$LassoCheckResult]: Loop: 159#L12 [51] L12-->L13: Formula: (> 0 |v_bsearch_#t~nondet0_2|) InVars {bsearch_#t~nondet0=|v_bsearch_#t~nondet0_2|} OutVars{bsearch_#t~nondet0=|v_bsearch_#t~nondet0_1|} AuxVars[] AssignedVars[bsearch_#t~nondet0] 152#L13 [40] L13-->bsearchENTRY: Formula: (and (= |v_bsearch_#in~jInParam_1| v_bsearch_~mid~0_4) (= |v_bsearch_#in~iInParam_1| v_bsearch_~i_5)) InVars {bsearch_~mid~0=v_bsearch_~mid~0_4, bsearch_~i=v_bsearch_~i_5} OutVars{bsearch_#in~j=|v_bsearch_#in~jInParam_1|, bsearch_#in~i=|v_bsearch_#in~iInParam_1|} AuxVars[] AssignedVars[bsearch_#in~j, bsearch_#in~i]< 161#bsearchENTRY [37] bsearchENTRY-->L10: Formula: (and (= v_bsearch_~i_1 |v_bsearch_#in~i_1|) (= v_bsearch_~j_1 |v_bsearch_#in~j_1|)) InVars {bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_#in~i=|v_bsearch_#in~i_1|} OutVars{bsearch_~j=v_bsearch_~j_1, bsearch_#in~i=|v_bsearch_#in~i_1|, bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_~i=v_bsearch_~i_1} AuxVars[] AssignedVars[bsearch_~i, bsearch_~j] 157#L10 [48] L10-->L12: Formula: (let ((.cse0 (+ v_bsearch_~j_3 v_bsearch_~i_3))) (and (= (div .cse0 2) v_bsearch_~mid~0_1) (> v_bsearch_~j_3 v_bsearch_~i_3) (= (mod .cse0 2) 0))) InVars {bsearch_~j=v_bsearch_~j_3, bsearch_~i=v_bsearch_~i_3} OutVars{bsearch_~j=v_bsearch_~j_3, bsearch_~mid~0=v_bsearch_~mid~0_1, bsearch_~i=v_bsearch_~i_3} AuxVars[] AssignedVars[bsearch_~mid~0] 159#L12 [2020-06-22 05:21:19,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:21:19,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2030826, now seen corresponding path program 1 times [2020-06-22 05:21:19,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:21:19,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:21:19,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:19,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:21:19,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:19,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:21:19,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2482497, now seen corresponding path program 1 times [2020-06-22 05:21:19,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:21:19,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:21:19,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:19,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:21:19,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:19,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:21:19,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1388691030, now seen corresponding path program 1 times [2020-06-22 05:21:19,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:21:19,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:21:19,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:19,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:21:19,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:19,781 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:21:19,781 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:21:19,781 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:21:19,781 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:21:19,781 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:21:19,782 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:21:19,782 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:21:19,782 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:21:19,782 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 05:21:19,782 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:21:19,782 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:21:19,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:19,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:19,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:19,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:19,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:19,987 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:21:19,988 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:21:19,992 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:21:19,992 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:21:19,997 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:21:19,997 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {bsearch_#t~ret2=0} Honda state: {bsearch_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:21:20,024 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:21:20,025 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:21:20,028 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:21:20,028 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {bsearch_#t~ret1=0} Honda state: {bsearch_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:21:20,057 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:21:20,057 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:21:20,061 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:21:20,061 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {bsearch_#res=0} Honda state: {bsearch_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:21:20,092 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:21:20,093 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:21:20,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:21:20,149 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:21:32,203 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2020-06-22 05:21:32,208 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:21:32,209 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:21:32,209 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:21:32,209 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:21:32,209 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:21:32,209 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:21:32,209 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:21:32,209 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:21:32,209 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 05:21:32,210 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:21:32,210 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:21:32,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:32,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:32,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:32,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:32,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:32,407 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:21:32,407 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:21:32,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:21:32,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:21:32,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:21:32,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:21:32,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:21:32,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:21:32,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:21:32,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:21:32,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:21:32,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:21:32,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:21:32,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:21:32,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:21:32,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:21:32,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:21:32,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:21:32,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:21:32,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:21:32,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:21:32,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:21:32,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:21:32,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:21:32,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:21:32,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:21:32,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:21:32,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:21:32,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:21:32,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:21:32,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:21:32,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:21:32,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:21:32,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:21:32,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:21:32,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:21:32,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:21:32,431 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:21:32,443 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 05:21:32,444 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:21:32,444 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:21:32,444 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:21:32,444 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:21:32,445 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(bsearch_~mid~0, bsearch_~i) = 1*bsearch_~mid~0 - 1*bsearch_~i Supporting invariants [] [2020-06-22 05:21:32,445 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:21:32,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:21:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:21:32,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:21:32,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:21:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:21:32,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:21:32,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:21:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:21:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:32,529 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 05:21:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:32,540 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 05:21:32,540 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 05:21:32,540 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 [2020-06-22 05:21:32,541 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 23 transitions. cyclomatic complexity: 11 Second operand 5 states. [2020-06-22 05:21:32,640 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 23 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 154 states and 260 transitions. Complement of second has 82 states. [2020-06-22 05:21:32,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-06-22 05:21:32,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 05:21:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2020-06-22 05:21:32,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-22 05:21:32,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:21:32,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 8 letters. Loop has 4 letters. [2020-06-22 05:21:32,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:21:32,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 4 letters. Loop has 8 letters. [2020-06-22 05:21:32,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:21:32,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 260 transitions. [2020-06-22 05:21:32,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2020-06-22 05:21:32,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 76 states and 137 transitions. [2020-06-22 05:21:32,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 05:21:32,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2020-06-22 05:21:32,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 137 transitions. [2020-06-22 05:21:32,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:21:32,656 INFO L706 BuchiCegarLoop]: Abstraction has 76 states and 137 transitions. [2020-06-22 05:21:32,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 137 transitions. [2020-06-22 05:21:32,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 24. [2020-06-22 05:21:32,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 05:21:32,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 46 transitions. [2020-06-22 05:21:32,662 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 46 transitions. [2020-06-22 05:21:32,662 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 46 transitions. [2020-06-22 05:21:32,662 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 05:21:32,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 46 transitions. [2020-06-22 05:21:32,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-06-22 05:21:32,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:21:32,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:21:32,663 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:21:32,664 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 05:21:32,664 INFO L794 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY [36] ULTIMATE.startENTRY-->L21: Formula: (and (= v_ULTIMATE.start_main_~x~0_2 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~y~0_2 |v_ULTIMATE.start_main_#t~nondet4_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_2} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|, |v_ULTIMATE.start_main_#t~nondet3_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 451#L21 [35] L21-->bsearchENTRY: Formula: (and (= |v_bsearch_#in~jInParam_3| v_ULTIMATE.start_main_~y~0_5) (= |v_bsearch_#in~iInParam_3| v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{bsearch_#in~j=|v_bsearch_#in~jInParam_3|, bsearch_#in~i=|v_bsearch_#in~iInParam_3|} AuxVars[] AssignedVars[bsearch_#in~j, bsearch_#in~i]< 452#bsearchENTRY [37] bsearchENTRY-->L10: Formula: (and (= v_bsearch_~i_1 |v_bsearch_#in~i_1|) (= v_bsearch_~j_1 |v_bsearch_#in~j_1|)) InVars {bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_#in~i=|v_bsearch_#in~i_1|} OutVars{bsearch_~j=v_bsearch_~j_1, bsearch_#in~i=|v_bsearch_#in~i_1|, bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_~i=v_bsearch_~i_1} AuxVars[] AssignedVars[bsearch_~i, bsearch_~j] 466#L10 [50] L10-->L12: Formula: (let ((.cse0 (+ v_bsearch_~j_3 v_bsearch_~i_3))) (and (= (+ (div .cse0 2) 1) v_bsearch_~mid~0_1) (> (mod .cse0 2) 0) (> v_bsearch_~j_3 v_bsearch_~i_3) (< .cse0 0))) InVars {bsearch_~j=v_bsearch_~j_3, bsearch_~i=v_bsearch_~i_3} OutVars{bsearch_~j=v_bsearch_~j_3, bsearch_~mid~0=v_bsearch_~mid~0_1, bsearch_~i=v_bsearch_~i_3} AuxVars[] AssignedVars[bsearch_~mid~0] 467#L12 [2020-06-22 05:21:32,664 INFO L796 eck$LassoCheckResult]: Loop: 467#L12 [28] L12-->L14: Formula: (= 0 |v_bsearch_#t~nondet0_4|) InVars {bsearch_#t~nondet0=|v_bsearch_#t~nondet0_4|} OutVars{bsearch_#t~nondet0=|v_bsearch_#t~nondet0_3|} AuxVars[] AssignedVars[bsearch_#t~nondet0] 448#L14 [38] L14-->bsearchENTRY: Formula: (and (= |v_bsearch_#in~iInParam_2| (+ v_bsearch_~mid~0_5 1)) (= |v_bsearch_#in~jInParam_2| v_bsearch_~j_5)) InVars {bsearch_~j=v_bsearch_~j_5, bsearch_~mid~0=v_bsearch_~mid~0_5} OutVars{bsearch_#in~j=|v_bsearch_#in~jInParam_2|, bsearch_#in~i=|v_bsearch_#in~iInParam_2|} AuxVars[] AssignedVars[bsearch_#in~j, bsearch_#in~i]< 457#bsearchENTRY [37] bsearchENTRY-->L10: Formula: (and (= v_bsearch_~i_1 |v_bsearch_#in~i_1|) (= v_bsearch_~j_1 |v_bsearch_#in~j_1|)) InVars {bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_#in~i=|v_bsearch_#in~i_1|} OutVars{bsearch_~j=v_bsearch_~j_1, bsearch_#in~i=|v_bsearch_#in~i_1|, bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_~i=v_bsearch_~i_1} AuxVars[] AssignedVars[bsearch_~i, bsearch_~j] 459#L10 [48] L10-->L12: Formula: (let ((.cse0 (+ v_bsearch_~j_3 v_bsearch_~i_3))) (and (= (div .cse0 2) v_bsearch_~mid~0_1) (> v_bsearch_~j_3 v_bsearch_~i_3) (= (mod .cse0 2) 0))) InVars {bsearch_~j=v_bsearch_~j_3, bsearch_~i=v_bsearch_~i_3} OutVars{bsearch_~j=v_bsearch_~j_3, bsearch_~mid~0=v_bsearch_~mid~0_1, bsearch_~i=v_bsearch_~i_3} AuxVars[] AssignedVars[bsearch_~mid~0] 467#L12 [2020-06-22 05:21:32,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:21:32,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2030829, now seen corresponding path program 1 times [2020-06-22 05:21:32,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:21:32,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:21:32,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:32,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:21:32,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:32,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:21:32,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1795382, now seen corresponding path program 2 times [2020-06-22 05:21:32,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:21:32,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:21:32,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:32,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:21:32,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:32,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:21:32,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1386607582, now seen corresponding path program 1 times [2020-06-22 05:21:32,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:21:32,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:21:32,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:32,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:21:32,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:32,830 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:21:32,830 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:21:32,830 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:21:32,830 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:21:32,831 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:21:32,831 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:21:32,831 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:21:32,831 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:21:32,831 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 05:21:32,831 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:21:32,831 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:21:32,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:32,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:32,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:32,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:32,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:33,008 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:21:33,009 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:21:33,012 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:21:33,012 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:21:33,016 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:21:33,016 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {bsearch_#t~nondet0=0} Honda state: {bsearch_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:21:33,046 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:21:33,046 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:21:33,089 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:21:33,090 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:21:45,590 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2020-06-22 05:21:45,596 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:21:45,596 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:21:45,596 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:21:45,596 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:21:45,596 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:21:45,596 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:21:45,596 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:21:45,596 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:21:45,596 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 05:21:45,597 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:21:45,597 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:21:45,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:45,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:45,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:45,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:45,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:21:45,761 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:21:45,762 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:21:45,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:21:45,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:21:45,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:21:45,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:21:45,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:21:45,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:21:45,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:21:45,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:21:45,774 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:21:45,781 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:21:45,781 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:21:45,781 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:21:45,782 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:21:45,782 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:21:45,782 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(bsearch_~mid~0, bsearch_~j) = -1*bsearch_~mid~0 + 1*bsearch_~j Supporting invariants [] [2020-06-22 05:21:45,782 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:21:45,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:21:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:21:45,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:21:45,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:21:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:21:45,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:21:45,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:21:45,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:21:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:45,873 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 05:21:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:45,882 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 05:21:45,882 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 05:21:45,882 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 [2020-06-22 05:21:45,882 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 24 states and 46 transitions. cyclomatic complexity: 24 Second operand 5 states. [2020-06-22 05:21:45,936 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 24 states and 46 transitions. cyclomatic complexity: 24. Second operand 5 states. Result 99 states and 184 transitions. Complement of second has 39 states. [2020-06-22 05:21:45,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 05:21:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 05:21:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-06-22 05:21:45,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-22 05:21:45,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:21:45,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 8 letters. Loop has 4 letters. [2020-06-22 05:21:45,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:21:45,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 8 letters. [2020-06-22 05:21:45,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:21:45,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 184 transitions. [2020-06-22 05:21:45,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2020-06-22 05:21:45,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 51 states and 95 transitions. [2020-06-22 05:21:45,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-06-22 05:21:45,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-06-22 05:21:45,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 95 transitions. [2020-06-22 05:21:45,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:21:45,947 INFO L706 BuchiCegarLoop]: Abstraction has 51 states and 95 transitions. [2020-06-22 05:21:45,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 95 transitions. [2020-06-22 05:21:45,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2020-06-22 05:21:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 05:21:45,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2020-06-22 05:21:45,950 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 62 transitions. [2020-06-22 05:21:45,950 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 62 transitions. [2020-06-22 05:21:45,951 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 05:21:45,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 62 transitions. [2020-06-22 05:21:45,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2020-06-22 05:21:45,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:21:45,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:21:45,952 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:21:45,952 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 05:21:45,952 INFO L794 eck$LassoCheckResult]: Stem: 659#ULTIMATE.startENTRY [36] ULTIMATE.startENTRY-->L21: Formula: (and (= v_ULTIMATE.start_main_~x~0_2 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~y~0_2 |v_ULTIMATE.start_main_#t~nondet4_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_2} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|, |v_ULTIMATE.start_main_#t~nondet3_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 653#L21 [35] L21-->bsearchENTRY: Formula: (and (= |v_bsearch_#in~jInParam_3| v_ULTIMATE.start_main_~y~0_5) (= |v_bsearch_#in~iInParam_3| v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{bsearch_#in~j=|v_bsearch_#in~jInParam_3|, bsearch_#in~i=|v_bsearch_#in~iInParam_3|} AuxVars[] AssignedVars[bsearch_#in~j, bsearch_#in~i]< 658#bsearchENTRY [37] bsearchENTRY-->L10: Formula: (and (= v_bsearch_~i_1 |v_bsearch_#in~i_1|) (= v_bsearch_~j_1 |v_bsearch_#in~j_1|)) InVars {bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_#in~i=|v_bsearch_#in~i_1|} OutVars{bsearch_~j=v_bsearch_~j_1, bsearch_#in~i=|v_bsearch_#in~i_1|, bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_~i=v_bsearch_~i_1} AuxVars[] AssignedVars[bsearch_~i, bsearch_~j] 678#L10 [50] L10-->L12: Formula: (let ((.cse0 (+ v_bsearch_~j_3 v_bsearch_~i_3))) (and (= (+ (div .cse0 2) 1) v_bsearch_~mid~0_1) (> (mod .cse0 2) 0) (> v_bsearch_~j_3 v_bsearch_~i_3) (< .cse0 0))) InVars {bsearch_~j=v_bsearch_~j_3, bsearch_~i=v_bsearch_~i_3} OutVars{bsearch_~j=v_bsearch_~j_3, bsearch_~mid~0=v_bsearch_~mid~0_1, bsearch_~i=v_bsearch_~i_3} AuxVars[] AssignedVars[bsearch_~mid~0] 676#L12 [2020-06-22 05:21:45,953 INFO L796 eck$LassoCheckResult]: Loop: 676#L12 [51] L12-->L13: Formula: (> 0 |v_bsearch_#t~nondet0_2|) InVars {bsearch_#t~nondet0=|v_bsearch_#t~nondet0_2|} OutVars{bsearch_#t~nondet0=|v_bsearch_#t~nondet0_1|} AuxVars[] AssignedVars[bsearch_#t~nondet0] 655#L13 [40] L13-->bsearchENTRY: Formula: (and (= |v_bsearch_#in~jInParam_1| v_bsearch_~mid~0_4) (= |v_bsearch_#in~iInParam_1| v_bsearch_~i_5)) InVars {bsearch_~mid~0=v_bsearch_~mid~0_4, bsearch_~i=v_bsearch_~i_5} OutVars{bsearch_#in~j=|v_bsearch_#in~jInParam_1|, bsearch_#in~i=|v_bsearch_#in~iInParam_1|} AuxVars[] AssignedVars[bsearch_#in~j, bsearch_#in~i]< 669#bsearchENTRY [37] bsearchENTRY-->L10: Formula: (and (= v_bsearch_~i_1 |v_bsearch_#in~i_1|) (= v_bsearch_~j_1 |v_bsearch_#in~j_1|)) InVars {bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_#in~i=|v_bsearch_#in~i_1|} OutVars{bsearch_~j=v_bsearch_~j_1, bsearch_#in~i=|v_bsearch_#in~i_1|, bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_~i=v_bsearch_~i_1} AuxVars[] AssignedVars[bsearch_~i, bsearch_~j] 675#L10 [50] L10-->L12: Formula: (let ((.cse0 (+ v_bsearch_~j_3 v_bsearch_~i_3))) (and (= (+ (div .cse0 2) 1) v_bsearch_~mid~0_1) (> (mod .cse0 2) 0) (> v_bsearch_~j_3 v_bsearch_~i_3) (< .cse0 0))) InVars {bsearch_~j=v_bsearch_~j_3, bsearch_~i=v_bsearch_~i_3} OutVars{bsearch_~j=v_bsearch_~j_3, bsearch_~mid~0=v_bsearch_~mid~0_1, bsearch_~i=v_bsearch_~i_3} AuxVars[] AssignedVars[bsearch_~mid~0] 676#L12 [2020-06-22 05:21:45,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:21:45,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2030829, now seen corresponding path program 2 times [2020-06-22 05:21:45,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:21:45,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:21:45,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:45,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:21:45,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:45,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:21:45,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2482499, now seen corresponding path program 1 times [2020-06-22 05:21:45,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:21:45,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:21:45,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:45,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:21:45,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:45,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:21:45,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1385920465, now seen corresponding path program 1 times [2020-06-22 05:21:45,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:21:45,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:21:45,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:45,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:21:45,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:21:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:21:46,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:21:46 BasicIcfg [2020-06-22 05:21:46,220 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 05:21:46,220 INFO L168 Benchmark]: Toolchain (without parser) took 34845.73 ms. Allocated memory was 514.9 MB in the beginning and 603.5 MB in the end (delta: 88.6 MB). Free memory was 439.9 MB in the beginning and 422.8 MB in the end (delta: 17.1 MB). Peak memory consumption was 105.7 MB. Max. memory is 50.3 GB. [2020-06-22 05:21:46,222 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 459.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 05:21:46,222 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.30 ms. Allocated memory was 514.9 MB in the beginning and 569.4 MB in the end (delta: 54.5 MB). Free memory was 439.9 MB in the beginning and 540.3 MB in the end (delta: -100.5 MB). Peak memory consumption was 30.4 MB. Max. memory is 50.3 GB. [2020-06-22 05:21:46,223 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.17 ms. Allocated memory is still 569.4 MB. Free memory was 540.3 MB in the beginning and 538.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. [2020-06-22 05:21:46,223 INFO L168 Benchmark]: Boogie Preprocessor took 16.63 ms. Allocated memory is still 569.4 MB. Free memory was 538.7 MB in the beginning and 537.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 05:21:46,224 INFO L168 Benchmark]: RCFGBuilder took 209.75 ms. Allocated memory is still 569.4 MB. Free memory was 537.6 MB in the beginning and 524.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 50.3 GB. [2020-06-22 05:21:46,225 INFO L168 Benchmark]: BlockEncodingV2 took 79.19 ms. Allocated memory is still 569.4 MB. Free memory was 524.2 MB in the beginning and 518.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-06-22 05:21:46,225 INFO L168 Benchmark]: TraceAbstraction took 160.40 ms. Allocated memory is still 569.4 MB. Free memory was 518.8 MB in the beginning and 508.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 50.3 GB. [2020-06-22 05:21:46,226 INFO L168 Benchmark]: BuchiAutomizer took 34053.09 ms. Allocated memory was 569.4 MB in the beginning and 603.5 MB in the end (delta: 34.1 MB). Free memory was 507.9 MB in the beginning and 422.8 MB in the end (delta: 85.1 MB). Peak memory consumption was 119.2 MB. Max. memory is 50.3 GB. [2020-06-22 05:21:46,230 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 15 locations, 18 edges - StatisticsResult: Encoded RCFG 11 locations, 18 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 459.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 286.30 ms. Allocated memory was 514.9 MB in the beginning and 569.4 MB in the end (delta: 54.5 MB). Free memory was 439.9 MB in the beginning and 540.3 MB in the end (delta: -100.5 MB). Peak memory consumption was 30.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 35.17 ms. Allocated memory is still 569.4 MB. Free memory was 540.3 MB in the beginning and 538.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 16.63 ms. Allocated memory is still 569.4 MB. Free memory was 538.7 MB in the beginning and 537.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 209.75 ms. Allocated memory is still 569.4 MB. Free memory was 537.6 MB in the beginning and 524.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 79.19 ms. Allocated memory is still 569.4 MB. Free memory was 524.2 MB in the beginning and 518.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 160.40 ms. Allocated memory is still 569.4 MB. Free memory was 518.8 MB in the beginning and 508.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 34053.09 ms. Allocated memory was 569.4 MB in the beginning and 603.5 MB in the end (delta: 34.1 MB). Free memory was 507.9 MB in the beginning and 422.8 MB in the end (delta: 85.1 MB). Peak memory consumption was 119.2 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 11 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=11occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 4 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 0 deterministic, 3 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function \old(j) + -1 * \old(i) and consists of 5 locations. One nondeterministic module has affine ranking function mid + -1 * i and consists of 6 locations. One nondeterministic module has affine ranking function -1 * mid + j and consists of 5 locations. The remainder module has 30 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 34.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 27.2s. Construction of modules took 5.3s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 86 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 30 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 37 SDtfs, 81 SDslu, 29 SDs, 0 SdLazy, 101 SolverSat, 15 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 5.3s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital32 mio100 ax100 hnf100 lsp90 ukn100 mio100 lsp100 div388 bol100 ite100 ukn100 eq136 hnf48 smp72 dnf100 smp100 tf103 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 40ms VariablesStem: 0 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 2 LassoNonterminationAnalysisTime: 25.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 12]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {\old(j)=0, \result=0, \result=0, \old(i)=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d7618a1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6646e688=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@68d8fc44=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ce2a892=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@720c9d22=0, NULL=0, i=-1, mid=0, j=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@35a9594e=-1, x=0, y=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L19] int x = __VERIFIER_nondet_int(); [L20] int y = __VERIFIER_nondet_int(); [L21] CALL bsearch(x, y) [L10] COND FALSE !(i>=j) [L11] int mid = (i+j)/2; Loop: [L12] COND TRUE __VERIFIER_nondet_int() [L13] CALL bsearch(i,mid) [L10] COND FALSE !(i>=j) [L11] int mid = (i+j)/2; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! !SESSION 2020-06-22 05:21:07.960 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 05:21:46.464 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check