NO Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 04:46:56,347 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 04:46:56,349 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 04:46:56,361 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 04:46:56,362 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 04:46:56,363 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 04:46:56,364 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 04:46:56,365 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 04:46:56,367 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 04:46:56,368 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 04:46:56,369 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 04:46:56,369 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 04:46:56,370 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 04:46:56,371 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 04:46:56,372 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 04:46:56,372 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 04:46:56,373 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 04:46:56,375 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 04:46:56,377 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 04:46:56,378 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 04:46:56,379 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 04:46:56,381 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 04:46:56,383 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 04:46:56,383 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 04:46:56,383 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 04:46:56,384 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 04:46:56,384 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 04:46:56,385 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 04:46:56,385 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 04:46:56,386 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 04:46:56,387 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 04:46:56,387 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 04:46:56,388 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 04:46:56,389 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 04:46:56,389 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 04:46:56,389 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 04:46:56,389 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 04:46:56,390 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 04:46:56,391 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 04:46:56,391 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 04:46:56,406 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 04:46:56,406 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 04:46:56,407 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 04:46:56,407 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 04:46:56,407 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 04:46:56,408 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 04:46:56,408 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 04:46:56,408 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 04:46:56,408 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 04:46:56,408 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 04:46:56,408 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 04:46:56,409 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 04:46:56,409 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 04:46:56,409 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 04:46:56,409 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:46:56,409 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 04:46:56,409 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 04:46:56,409 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 04:46:56,410 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 04:46:56,410 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 04:46:56,410 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 04:46:56,410 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 04:46:56,410 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 04:46:56,410 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 04:46:56,411 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 04:46:56,411 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 04:46:56,411 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 04:46:56,411 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 04:46:56,411 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 04:46:56,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 04:46:56,450 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 04:46:56,453 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 04:46:56,454 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 04:46:56,455 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 04:46:56,456 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 04:46:56,522 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/e55445b7c8554fcdbf0868875946dd52/FLAG14333cc06 [2020-06-22 04:46:56,857 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 04:46:56,857 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 04:46:56,864 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/e55445b7c8554fcdbf0868875946dd52/FLAG14333cc06 [2020-06-22 04:46:57,263 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/e55445b7c8554fcdbf0868875946dd52 [2020-06-22 04:46:57,274 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 04:46:57,276 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 04:46:57,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 04:46:57,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 04:46:57,281 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 04:46:57,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 04:46:57" (1/1) ... [2020-06-22 04:46:57,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@464b310d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:46:57, skipping insertion in model container [2020-06-22 04:46:57,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 04:46:57" (1/1) ... [2020-06-22 04:46:57,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 04:46:57,312 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 04:46:57,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 04:46:57,477 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 04:46:57,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 04:46:57,576 INFO L195 MainTranslator]: Completed translation [2020-06-22 04:46:57,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:46:57 WrapperNode [2020-06-22 04:46:57,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 04:46:57,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 04:46:57,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 04:46:57,579 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 04:46:57,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:46:57" (1/1) ... [2020-06-22 04:46:57,594 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:46:57" (1/1) ... [2020-06-22 04:46:57,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 04:46:57,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 04:46:57,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 04:46:57,615 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 04:46:57,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:46:57" (1/1) ... [2020-06-22 04:46:57,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:46:57" (1/1) ... [2020-06-22 04:46:57,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:46:57" (1/1) ... [2020-06-22 04:46:57,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:46:57" (1/1) ... [2020-06-22 04:46:57,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:46:57" (1/1) ... [2020-06-22 04:46:57,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:46:57" (1/1) ... [2020-06-22 04:46:57,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:46:57" (1/1) ... [2020-06-22 04:46:57,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 04:46:57,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 04:46:57,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 04:46:57,636 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 04:46:57,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:46:57" (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 04:46:57,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 04:46:57,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 04:46:57,851 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 04:46:57,851 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2020-06-22 04:46:57,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:46:57 BoogieIcfgContainer [2020-06-22 04:46:57,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 04:46:57,853 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 04:46:57,854 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 04:46:57,856 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 04:46:57,857 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:46:57" (1/1) ... [2020-06-22 04:46:57,873 INFO L313 BlockEncoder]: Initial Icfg 14 locations, 23 edges [2020-06-22 04:46:57,875 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 04:46:57,875 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 04:46:57,876 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 04:46:57,876 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 04:46:57,878 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 04:46:57,879 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 04:46:57,879 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 04:46:57,895 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 04:46:57,903 INFO L200 BlockEncoder]: SBE split 0 edges [2020-06-22 04:46:57,908 INFO L70 emoveInfeasibleEdges]: Removed 5 edges and 0 locations because of local infeasibility [2020-06-22 04:46:57,910 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:46:57,930 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 04:46:57,934 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 04:46:57,936 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 04:46:57,936 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:46:57,936 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 04:46:57,937 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 04:46:57,937 INFO L313 BlockEncoder]: Encoded RCFG 6 locations, 10 edges [2020-06-22 04:46:57,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:46:57 BasicIcfg [2020-06-22 04:46:57,938 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 04:46:57,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 04:46:57,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 04:46:57,942 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 04:46:57,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 04:46:57" (1/4) ... [2020-06-22 04:46:57,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62db3079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 04:46:57, skipping insertion in model container [2020-06-22 04:46:57,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:46:57" (2/4) ... [2020-06-22 04:46:57,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62db3079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 04:46:57, skipping insertion in model container [2020-06-22 04:46:57,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:46:57" (3/4) ... [2020-06-22 04:46:57,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62db3079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:46:57, skipping insertion in model container [2020-06-22 04:46:57,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:46:57" (4/4) ... [2020-06-22 04:46:57,946 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 04:46:57,957 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 04:46:57,965 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 04:46:57,982 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 04:46:58,011 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 04:46:58,012 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 04:46:58,012 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 04:46:58,012 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 04:46:58,012 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 04:46:58,012 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 04:46:58,013 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 04:46:58,013 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 04:46:58,013 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 04:46:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-06-22 04:46:58,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 04:46:58,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-06-22 04:46:58,095 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 04:46:58,096 INFO L451 ceAbstractionStarter]: At program point L25-2(lines 25 27) the Hoare annotation is: true [2020-06-22 04:46:58,096 INFO L451 ceAbstractionStarter]: At program point L23-2(lines 23 29) the Hoare annotation is: true [2020-06-22 04:46:58,096 INFO L451 ceAbstractionStarter]: At program point L20-2(lines 20 31) the Hoare annotation is: true [2020-06-22 04:46:58,097 INFO L451 ceAbstractionStarter]: At program point L18-2(lines 18 33) the Hoare annotation is: true [2020-06-22 04:46:58,097 INFO L451 ceAbstractionStarter]: At program point L15-2(lines 15 35) the Hoare annotation is: true [2020-06-22 04:46:58,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:46:58 BasicIcfg [2020-06-22 04:46:58,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 04:46:58,106 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 04:46:58,107 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 04:46:58,110 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 04:46:58,111 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:46:58,111 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 04:46:57" (1/5) ... [2020-06-22 04:46:58,112 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18cb8ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 04:46:58, skipping insertion in model container [2020-06-22 04:46:58,112 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:46:58,112 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:46:57" (2/5) ... [2020-06-22 04:46:58,112 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18cb8ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 04:46:58, skipping insertion in model container [2020-06-22 04:46:58,112 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:46:58,113 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:46:57" (3/5) ... [2020-06-22 04:46:58,113 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18cb8ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:46:58, skipping insertion in model container [2020-06-22 04:46:58,113 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:46:58,113 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:46:57" (4/5) ... [2020-06-22 04:46:58,114 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18cb8ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:46:58, skipping insertion in model container [2020-06-22 04:46:58,114 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:46:58,114 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:46:58" (5/5) ... [2020-06-22 04:46:58,115 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 04:46:58,142 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 04:46:58,143 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 04:46:58,143 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 04:46:58,143 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 04:46:58,143 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 04:46:58,143 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 04:46:58,143 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 04:46:58,143 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 04:46:58,143 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 04:46:58,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-06-22 04:46:58,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 04:46:58,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:46:58,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:46:58,169 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:46:58,169 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 04:46:58,169 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 04:46:58,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-06-22 04:46:58,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 04:46:58,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:46:58,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:46:58,171 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:46:58,171 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 04:46:58,176 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [83] ULTIMATE.startENTRY-->L15-2: Formula: (= v_ULTIMATE.start_main_~i~0_1 0) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~l~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~b~0] 8#L15-2true [2020-06-22 04:46:58,176 INFO L796 eck$LassoCheckResult]: Loop: 8#L15-2true [91] L15-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_5 0) (< v_ULTIMATE.start_main_~i~0_8 100) (= v_ULTIMATE.start_main_~a~0_4 (+ v_ULTIMATE.start_main_~i~0_8 2))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0] 5#L18-2true [99] L18-2-->L15-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_15 1) v_ULTIMATE.start_main_~i~0_14) (<= v_ULTIMATE.start_main_~a~0_7 v_ULTIMATE.start_main_~j~0_11)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 8#L15-2true [2020-06-22 04:46:58,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:46:58,183 INFO L82 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 1 times [2020-06-22 04:46:58,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:46:58,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:46:58,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:46:58,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:46:58,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:46:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:46:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:46:58,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:46:58,251 INFO L82 PathProgramCache]: Analyzing trace with hash 3881, now seen corresponding path program 1 times [2020-06-22 04:46:58,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:46:58,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:46:58,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:46:58,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:46:58,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:46:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:46:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:46:58,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:46:58,267 INFO L82 PathProgramCache]: Analyzing trace with hash 112474, now seen corresponding path program 1 times [2020-06-22 04:46:58,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:46:58,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:46:58,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:46:58,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:46:58,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:46:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:46:58,323 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 04:46:58,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:46:58,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 04:46:58,382 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:46:58,383 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:46:58,383 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:46:58,383 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:46:58,383 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:46:58,384 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:46:58,384 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:46:58,384 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:46:58,384 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 04:46:58,384 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:46:58,384 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:46:58,403 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 04:46:58,413 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 04:46:58,417 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 04:46:58,522 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:46:58,523 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 04:46:58,534 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:46:58,534 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:46:58,568 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:46:58,569 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 04:46:58,577 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:46:58,578 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:46:58,605 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:46:58,606 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 04:46:58,611 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:46:58,611 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 04:46:58,644 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:46:58,644 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:46:59,023 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:46:59,026 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:46:59,026 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:46:59,027 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:46:59,027 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:46:59,027 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:46:59,027 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:46:59,027 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:46:59,027 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:46:59,027 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 04:46:59,027 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:46:59,028 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:46:59,030 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 04:46:59,034 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 04:46:59,038 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 04:46:59,103 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:46:59,108 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:46:59,110 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 04:46:59,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:46:59,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:46:59,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:46:59,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:46:59,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:46:59,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:46:59,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:46:59,124 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 04:46:59,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:46:59,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:46:59,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:46:59,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:46:59,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:46:59,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:46:59,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:46:59,136 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 04:46:59,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:46:59,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:46:59,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:46:59,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:46:59,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:46:59,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:46:59,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:46:59,150 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:46:59,156 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:46:59,156 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:46:59,158 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:46:59,159 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:46:59,159 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:46:59,159 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-06-22 04:46:59,161 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:46:59,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:46:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:46:59,197 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:46:59,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:46:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:46:59,208 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 04:46:59,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:46:59,222 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 04:46:59,266 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 04:46:59,271 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 04:46:59,272 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 6 states. Second operand 3 states. [2020-06-22 04:46:59,385 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 6 states.. Second operand 3 states. Result 22 states and 39 transitions. Complement of second has 9 states. [2020-06-22 04:46:59,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states [2020-06-22 04:46:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 04:46:59,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2020-06-22 04:46:59,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 1 letters. Loop has 2 letters. [2020-06-22 04:46:59,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:46:59,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 04:46:59,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:46:59,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 1 letters. Loop has 4 letters. [2020-06-22 04:46:59,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:46:59,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 39 transitions. [2020-06-22 04:46:59,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 04:46:59,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 39 transitions. [2020-06-22 04:46:59,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 04:46:59,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 04:46:59,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 39 transitions. [2020-06-22 04:46:59,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:46:59,408 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 39 transitions. [2020-06-22 04:46:59,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 39 transitions. [2020-06-22 04:46:59,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2020-06-22 04:46:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 04:46:59,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 26 transitions. [2020-06-22 04:46:59,438 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 26 transitions. [2020-06-22 04:46:59,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 04:46:59,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 04:46:59,443 INFO L87 Difference]: Start difference. First operand 15 states and 26 transitions. Second operand 4 states. [2020-06-22 04:46:59,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:46:59,481 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2020-06-22 04:46:59,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 04:46:59,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 35 transitions. [2020-06-22 04:46:59,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 04:46:59,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 11 states and 18 transitions. [2020-06-22 04:46:59,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 04:46:59,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 04:46:59,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 18 transitions. [2020-06-22 04:46:59,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:46:59,489 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 18 transitions. [2020-06-22 04:46:59,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 18 transitions. [2020-06-22 04:46:59,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 7. [2020-06-22 04:46:59,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 04:46:59,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2020-06-22 04:46:59,490 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 11 transitions. [2020-06-22 04:46:59,490 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 11 transitions. [2020-06-22 04:46:59,490 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 04:46:59,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 11 transitions. [2020-06-22 04:46:59,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 04:46:59,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:46:59,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:46:59,491 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:46:59,492 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 04:46:59,492 INFO L794 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L15-2: Formula: (= v_ULTIMATE.start_main_~i~0_1 0) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~l~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~b~0] 119#L15-2 [2020-06-22 04:46:59,492 INFO L796 eck$LassoCheckResult]: Loop: 119#L15-2 [91] L15-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_5 0) (< v_ULTIMATE.start_main_~i~0_8 100) (= v_ULTIMATE.start_main_~a~0_4 (+ v_ULTIMATE.start_main_~i~0_8 2))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0] 117#L18-2 [74] L18-2-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~a~0_6) (= v_ULTIMATE.start_main_~k~0_5 (+ v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~i~0_9 3))) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 116#L20-2 [101] L20-2-->L18-2: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_13 1) v_ULTIMATE.start_main_~j~0_12) (< v_ULTIMATE.start_main_~k~0_10 0)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 120#L18-2 [99] L18-2-->L15-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_15 1) v_ULTIMATE.start_main_~i~0_14) (<= v_ULTIMATE.start_main_~a~0_7 v_ULTIMATE.start_main_~j~0_11)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 119#L15-2 [2020-06-22 04:46:59,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:46:59,493 INFO L82 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 2 times [2020-06-22 04:46:59,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:46:59,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:46:59,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:46:59,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:46:59,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:46:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:46:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:46:59,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:46:59,499 INFO L82 PathProgramCache]: Analyzing trace with hash 3708846, now seen corresponding path program 1 times [2020-06-22 04:46:59,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:46:59,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:46:59,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:46:59,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:46:59,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:46:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:46:59,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:46:59,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:46:59,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 04:46:59,531 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:46:59,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 04:46:59,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 04:46:59,532 INFO L87 Difference]: Start difference. First operand 7 states and 11 transitions. cyclomatic complexity: 5 Second operand 4 states. [2020-06-22 04:46:59,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:46:59,573 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2020-06-22 04:46:59,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 04:46:59,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2020-06-22 04:46:59,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 04:46:59,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 17 transitions. [2020-06-22 04:46:59,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 04:46:59,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 04:46:59,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 17 transitions. [2020-06-22 04:46:59,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:46:59,577 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-06-22 04:46:59,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 17 transitions. [2020-06-22 04:46:59,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2020-06-22 04:46:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 04:46:59,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2020-06-22 04:46:59,579 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2020-06-22 04:46:59,579 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2020-06-22 04:46:59,579 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 04:46:59,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2020-06-22 04:46:59,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 04:46:59,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:46:59,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:46:59,580 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:46:59,580 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 04:46:59,581 INFO L794 eck$LassoCheckResult]: Stem: 144#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L15-2: Formula: (= v_ULTIMATE.start_main_~i~0_1 0) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~l~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~b~0] 145#L15-2 [2020-06-22 04:46:59,581 INFO L796 eck$LassoCheckResult]: Loop: 145#L15-2 [91] L15-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_5 0) (< v_ULTIMATE.start_main_~i~0_8 100) (= v_ULTIMATE.start_main_~a~0_4 (+ v_ULTIMATE.start_main_~i~0_8 2))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0] 146#L18-2 [74] L18-2-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~a~0_6) (= v_ULTIMATE.start_main_~k~0_5 (+ v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~i~0_9 3))) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 147#L20-2 [78] L20-2-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~l~0_8 0) (<= 0 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~b~0_6 (+ v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~j~0_10 v_ULTIMATE.start_main_~i~0_10 4))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~l~0, ULTIMATE.start_main_~b~0] 141#L23-2 [103] L23-2-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~k~0_11 (+ v_ULTIMATE.start_main_~k~0_12 (- 1))) (<= v_ULTIMATE.start_main_~b~0_7 v_ULTIMATE.start_main_~l~0_9)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 143#L20-2 [101] L20-2-->L18-2: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_13 1) v_ULTIMATE.start_main_~j~0_12) (< v_ULTIMATE.start_main_~k~0_10 0)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 148#L18-2 [99] L18-2-->L15-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_15 1) v_ULTIMATE.start_main_~i~0_14) (<= v_ULTIMATE.start_main_~a~0_7 v_ULTIMATE.start_main_~j~0_11)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 145#L15-2 [2020-06-22 04:46:59,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:46:59,581 INFO L82 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 3 times [2020-06-22 04:46:59,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:46:59,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:46:59,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:46:59,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:46:59,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:46:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:46:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:46:59,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:46:59,587 INFO L82 PathProgramCache]: Analyzing trace with hash -731444409, now seen corresponding path program 1 times [2020-06-22 04:46:59,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:46:59,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:46:59,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:46:59,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:46:59,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:46:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:46:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:46:59,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:46:59,628 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 04:46:59,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:46:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:46:59,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 04:46:59,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:46:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:46:59,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:46:59,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-06-22 04:46:59,736 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:46:59,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 04:46:59,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 04:46:59,736 INFO L87 Difference]: Start difference. First operand 8 states and 12 transitions. cyclomatic complexity: 5 Second operand 6 states. [2020-06-22 04:46:59,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:46:59,816 INFO L93 Difference]: Finished difference Result 14 states and 22 transitions. [2020-06-22 04:46:59,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 04:46:59,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 22 transitions. [2020-06-22 04:46:59,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 04:46:59,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 22 transitions. [2020-06-22 04:46:59,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-06-22 04:46:59,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-06-22 04:46:59,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 22 transitions. [2020-06-22 04:46:59,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:46:59,820 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 22 transitions. [2020-06-22 04:46:59,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 22 transitions. [2020-06-22 04:46:59,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2020-06-22 04:46:59,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 04:46:59,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-06-22 04:46:59,822 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-06-22 04:46:59,822 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-06-22 04:46:59,823 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 04:46:59,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 17 transitions. [2020-06-22 04:46:59,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 04:46:59,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:46:59,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:46:59,824 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:46:59,824 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2020-06-22 04:46:59,825 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L15-2: Formula: (= v_ULTIMATE.start_main_~i~0_1 0) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~l~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~b~0] 195#L15-2 [2020-06-22 04:46:59,825 INFO L796 eck$LassoCheckResult]: Loop: 195#L15-2 [91] L15-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_5 0) (< v_ULTIMATE.start_main_~i~0_8 100) (= v_ULTIMATE.start_main_~a~0_4 (+ v_ULTIMATE.start_main_~i~0_8 2))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0] 196#L18-2 [74] L18-2-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~a~0_6) (= v_ULTIMATE.start_main_~k~0_5 (+ v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~i~0_9 3))) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 197#L20-2 [78] L20-2-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~l~0_8 0) (<= 0 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~b~0_6 (+ v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~j~0_10 v_ULTIMATE.start_main_~i~0_10 4))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~l~0, ULTIMATE.start_main_~b~0] 191#L23-2 [103] L23-2-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~k~0_11 (+ v_ULTIMATE.start_main_~k~0_12 (- 1))) (<= v_ULTIMATE.start_main_~b~0_7 v_ULTIMATE.start_main_~l~0_9)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 193#L20-2 [78] L20-2-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~l~0_8 0) (<= 0 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~b~0_6 (+ v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~j~0_10 v_ULTIMATE.start_main_~i~0_10 4))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~l~0, ULTIMATE.start_main_~b~0] 199#L23-2 [103] L23-2-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~k~0_11 (+ v_ULTIMATE.start_main_~k~0_12 (- 1))) (<= v_ULTIMATE.start_main_~b~0_7 v_ULTIMATE.start_main_~l~0_9)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 201#L20-2 [101] L20-2-->L18-2: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_13 1) v_ULTIMATE.start_main_~j~0_12) (< v_ULTIMATE.start_main_~k~0_10 0)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 200#L18-2 [99] L18-2-->L15-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_15 1) v_ULTIMATE.start_main_~i~0_14) (<= v_ULTIMATE.start_main_~a~0_7 v_ULTIMATE.start_main_~j~0_11)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 195#L15-2 [2020-06-22 04:46:59,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:46:59,825 INFO L82 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 4 times [2020-06-22 04:46:59,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:46:59,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:46:59,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:46:59,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:46:59,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:46:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:46:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:46:59,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:46:59,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1455881376, now seen corresponding path program 2 times [2020-06-22 04:46:59,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:46:59,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:46:59,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:46:59,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:46:59,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:46:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:46:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:46:59,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:46:59,866 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 04:46:59,885 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 04:46:59,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 04:46:59,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 04:46:59,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 04:46:59,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:46:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 04:47:00,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 04:47:00,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2020-06-22 04:47:00,003 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:47:00,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 04:47:00,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-06-22 04:47:00,004 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. cyclomatic complexity: 7 Second operand 8 states. [2020-06-22 04:47:00,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:47:00,190 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2020-06-22 04:47:00,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 04:47:00,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 30 transitions. [2020-06-22 04:47:00,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-06-22 04:47:00,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 30 transitions. [2020-06-22 04:47:00,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-06-22 04:47:00,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-06-22 04:47:00,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 30 transitions. [2020-06-22 04:47:00,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:47:00,213 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2020-06-22 04:47:00,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 30 transitions. [2020-06-22 04:47:00,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2020-06-22 04:47:00,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 04:47:00,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2020-06-22 04:47:00,216 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2020-06-22 04:47:00,216 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2020-06-22 04:47:00,216 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 04:47:00,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2020-06-22 04:47:00,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-06-22 04:47:00,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:47:00,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:47:00,217 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:47:00,218 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 04:47:00,218 INFO L794 eck$LassoCheckResult]: Stem: 270#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L15-2: Formula: (= v_ULTIMATE.start_main_~i~0_1 0) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~l~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~b~0] 271#L15-2 [2020-06-22 04:47:00,218 INFO L796 eck$LassoCheckResult]: Loop: 271#L15-2 [91] L15-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_5 0) (< v_ULTIMATE.start_main_~i~0_8 100) (= v_ULTIMATE.start_main_~a~0_4 (+ v_ULTIMATE.start_main_~i~0_8 2))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0] 268#L18-2 [74] L18-2-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~a~0_6) (= v_ULTIMATE.start_main_~k~0_5 (+ v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~i~0_9 3))) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 269#L20-2 [78] L20-2-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~l~0_8 0) (<= 0 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~b~0_6 (+ v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~j~0_10 v_ULTIMATE.start_main_~i~0_10 4))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~l~0, ULTIMATE.start_main_~b~0] 266#L23-2 [82] L23-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~l~0_5 v_ULTIMATE.start_main_~b~0_5) (= v_ULTIMATE.start_main_~m~0_4 (+ v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~j~0_4 v_ULTIMATE.start_main_~k~0_4 v_ULTIMATE.start_main_~l~0_5 1000))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_5, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_5} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_4, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_5, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~m~0] 267#L25-2 [104] L25-2-->L23-2: Formula: (and (= (+ v_ULTIMATE.start_main_~l~0_11 1) v_ULTIMATE.start_main_~l~0_10) (< v_ULTIMATE.start_main_~m~0_8 0)) InVars {ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_11, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8} OutVars{ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_10, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~l~0] 278#L23-2 [103] L23-2-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~k~0_11 (+ v_ULTIMATE.start_main_~k~0_12 (- 1))) (<= v_ULTIMATE.start_main_~b~0_7 v_ULTIMATE.start_main_~l~0_9)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 274#L20-2 [78] L20-2-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~l~0_8 0) (<= 0 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~b~0_6 (+ v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~j~0_10 v_ULTIMATE.start_main_~i~0_10 4))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~l~0, ULTIMATE.start_main_~b~0] 275#L23-2 [103] L23-2-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~k~0_11 (+ v_ULTIMATE.start_main_~k~0_12 (- 1))) (<= v_ULTIMATE.start_main_~b~0_7 v_ULTIMATE.start_main_~l~0_9)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 277#L20-2 [101] L20-2-->L18-2: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_13 1) v_ULTIMATE.start_main_~j~0_12) (< v_ULTIMATE.start_main_~k~0_10 0)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 276#L18-2 [99] L18-2-->L15-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_15 1) v_ULTIMATE.start_main_~i~0_14) (<= v_ULTIMATE.start_main_~a~0_7 v_ULTIMATE.start_main_~j~0_11)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 271#L15-2 [2020-06-22 04:47:00,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:47:00,219 INFO L82 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 5 times [2020-06-22 04:47:00,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:47:00,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:47:00,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:47:00,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:47:00,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:47:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:47:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:47:00,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:47:00,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1771364470, now seen corresponding path program 1 times [2020-06-22 04:47:00,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:47:00,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:47:00,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:47:00,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:47:00,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:47:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:47:00,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:47:00,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:47:00,279 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 04:47:00,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:47:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:47:00,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 04:47:00,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:47:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 04:47:00,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 04:47:00,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2020-06-22 04:47:00,418 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:47:00,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-06-22 04:47:00,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-06-22 04:47:00,419 INFO L87 Difference]: Start difference. First operand 14 states and 21 transitions. cyclomatic complexity: 8 Second operand 11 states. [2020-06-22 04:47:00,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:47:00,553 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2020-06-22 04:47:00,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 04:47:00,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 6 transitions. [2020-06-22 04:47:00,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 04:47:00,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 6 transitions. [2020-06-22 04:47:00,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-22 04:47:00,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-06-22 04:47:00,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2020-06-22 04:47:00,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:47:00,556 INFO L706 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2020-06-22 04:47:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2020-06-22 04:47:00,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2020-06-22 04:47:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 04:47:00,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2020-06-22 04:47:00,557 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2020-06-22 04:47:00,557 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2020-06-22 04:47:00,557 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 04:47:00,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2020-06-22 04:47:00,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 04:47:00,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:47:00,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:47:00,558 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 04:47:00,558 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 04:47:00,559 INFO L794 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L15-2: Formula: (= v_ULTIMATE.start_main_~i~0_1 0) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~l~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~b~0] 336#L15-2 [91] L15-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_5 0) (< v_ULTIMATE.start_main_~i~0_8 100) (= v_ULTIMATE.start_main_~a~0_4 (+ v_ULTIMATE.start_main_~i~0_8 2))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0] 337#L18-2 [74] L18-2-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~a~0_6) (= v_ULTIMATE.start_main_~k~0_5 (+ v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~i~0_9 3))) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 338#L20-2 [78] L20-2-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~l~0_8 0) (<= 0 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~b~0_6 (+ v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~j~0_10 v_ULTIMATE.start_main_~i~0_10 4))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~l~0, ULTIMATE.start_main_~b~0] 333#L23-2 [82] L23-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~l~0_5 v_ULTIMATE.start_main_~b~0_5) (= v_ULTIMATE.start_main_~m~0_4 (+ v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~j~0_4 v_ULTIMATE.start_main_~k~0_4 v_ULTIMATE.start_main_~l~0_5 1000))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_5, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_5} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_4, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_5, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~m~0] 334#L25-2 [2020-06-22 04:47:00,559 INFO L796 eck$LassoCheckResult]: Loop: 334#L25-2 [88] L25-2-->L25-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~m~0_7) (= v_ULTIMATE.start_main_~m~0_6 v_ULTIMATE.start_main_~m~0_7)) InVars {ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~m~0] 334#L25-2 [2020-06-22 04:47:00,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:47:00,559 INFO L82 PathProgramCache]: Analyzing trace with hash 108065989, now seen corresponding path program 1 times [2020-06-22 04:47:00,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:47:00,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:47:00,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:47:00,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:47:00,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:47:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:47:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:47:00,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:47:00,571 INFO L82 PathProgramCache]: Analyzing trace with hash 119, now seen corresponding path program 1 times [2020-06-22 04:47:00,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:47:00,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:47:00,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:47:00,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:47:00,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:47:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:47:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:47:00,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:47:00,577 INFO L82 PathProgramCache]: Analyzing trace with hash -944921549, now seen corresponding path program 1 times [2020-06-22 04:47:00,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:47:00,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:47:00,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:47:00,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:47:00,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:47:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:47:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:47:00,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:47:00 BasicIcfg [2020-06-22 04:47:00,660 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 04:47:00,661 INFO L168 Benchmark]: Toolchain (without parser) took 3385.88 ms. Allocated memory was 649.6 MB in the beginning and 750.8 MB in the end (delta: 101.2 MB). Free memory was 564.1 MB in the beginning and 687.2 MB in the end (delta: -123.0 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 04:47:00,663 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 04:47:00,663 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.90 ms. Allocated memory was 649.6 MB in the beginning and 684.2 MB in the end (delta: 34.6 MB). Free memory was 564.1 MB in the beginning and 650.7 MB in the end (delta: -86.6 MB). Peak memory consumption was 31.3 MB. Max. memory is 50.3 GB. [2020-06-22 04:47:00,664 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.23 ms. Allocated memory is still 684.2 MB. Free memory was 650.7 MB in the beginning and 649.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 04:47:00,664 INFO L168 Benchmark]: Boogie Preprocessor took 21.03 ms. Allocated memory is still 684.2 MB. Free memory was 649.6 MB in the beginning and 645.7 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. [2020-06-22 04:47:00,665 INFO L168 Benchmark]: RCFGBuilder took 216.97 ms. Allocated memory is still 684.2 MB. Free memory was 645.7 MB in the beginning and 631.1 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 50.3 GB. [2020-06-22 04:47:00,666 INFO L168 Benchmark]: BlockEncodingV2 took 84.31 ms. Allocated memory is still 684.2 MB. Free memory was 631.1 MB in the beginning and 623.6 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 50.3 GB. [2020-06-22 04:47:00,666 INFO L168 Benchmark]: TraceAbstraction took 167.40 ms. Allocated memory is still 684.2 MB. Free memory was 623.6 MB in the beginning and 613.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. [2020-06-22 04:47:00,667 INFO L168 Benchmark]: BuchiAutomizer took 2553.89 ms. Allocated memory was 684.2 MB in the beginning and 750.8 MB in the end (delta: 66.6 MB). Free memory was 613.9 MB in the beginning and 687.2 MB in the end (delta: -73.3 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 04:47:00,672 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 14 locations, 23 edges - StatisticsResult: Encoded RCFG 6 locations, 10 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 300.90 ms. Allocated memory was 649.6 MB in the beginning and 684.2 MB in the end (delta: 34.6 MB). Free memory was 564.1 MB in the beginning and 650.7 MB in the end (delta: -86.6 MB). Peak memory consumption was 31.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 36.23 ms. Allocated memory is still 684.2 MB. Free memory was 650.7 MB in the beginning and 649.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 21.03 ms. Allocated memory is still 684.2 MB. Free memory was 649.6 MB in the beginning and 645.7 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. * RCFGBuilder took 216.97 ms. Allocated memory is still 684.2 MB. Free memory was 645.7 MB in the beginning and 631.1 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 84.31 ms. Allocated memory is still 684.2 MB. Free memory was 631.1 MB in the beginning and 623.6 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 167.40 ms. Allocated memory is still 684.2 MB. Free memory was 623.6 MB in the beginning and 613.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2553.89 ms. Allocated memory was 684.2 MB in the beginning and 750.8 MB in the end (delta: 66.6 MB). Free memory was 613.9 MB in the beginning and 687.2 MB in the end (delta: -73.3 MB). There was no memory consumed. 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. - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 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=6occurred 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, 5 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 5 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (5 trivial, 0 deterministic, 1 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function -1 * i and consists of 6 locations. 5 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 4. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 30 SDtfs, 145 SDslu, 29 SDs, 0 SdLazy, 151 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax166 hnf100 lsp60 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq188 hnf91 smp100 dnf100 smp100 tf106 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 25]: 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 {a=2, \result=0, b=7, m=1003, l=0, i=0, k=3, j=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 25]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int j; [L8] int k; [L9] int l; [L10] int m; [L11] int a; [L12] int b; [L13] i = 0 [L15] COND TRUE i < 100 [L16] a = i+2 [L17] j = 0 [L18] COND TRUE j < a [L19] k = i+j+3 [L20] COND TRUE k >= 0 [L21] b = i+j+k+4 [L22] l = 0 [L23] COND TRUE l < b [L24] m = i+j+k+l+1000 Loop: [L25] COND TRUE m >= 0 [L26] m = m-0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! !SESSION 2020-06-22 04:46:54.040 ----------------------------------------------- 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 04:47:00.907 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check