/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:15:23,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:15:23,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:15:23,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:15:23,733 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:15:23,734 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:15:23,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:15:23,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:15:23,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:15:23,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:15:23,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:15:23,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:15:23,741 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:15:23,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:15:23,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:15:23,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:15:23,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:15:23,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:15:23,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:15:23,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:15:23,750 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:15:23,751 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:15:23,752 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:15:23,753 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:15:23,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:15:23,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:15:23,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:15:23,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:15:23,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:15:23,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:15:23,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:15:23,759 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:15:23,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:15:23,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:15:23,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:15:23,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:15:23,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:15:23,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:15:23,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:15:23,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:15:23,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:15:23,764 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 13:15:23,778 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:15:23,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:15:23,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:15:23,780 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:15:23,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:15:23,780 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:15:23,780 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:15:23,780 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:15:23,781 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:15:23,781 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:15:23,781 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:15:23,781 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:15:23,781 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:15:23,781 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:15:23,782 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:15:23,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:15:23,782 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:15:23,782 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:15:23,782 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:15:23,782 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:15:23,783 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:15:23,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:15:23,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:15:23,783 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:15:23,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:15:23,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:15:23,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:15:23,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:15:23,784 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:15:23,947 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:15:23,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:15:23,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:15:23,965 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:15:23,965 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:15:23,966 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:15:24,067 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_m3oRSk/tmp/1dd3783fb6a74236bc51e0b7378c7dbe/FLAGab20e4b1a [2020-07-01 13:15:24,407 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:15:24,408 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:15:24,414 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_m3oRSk/tmp/1dd3783fb6a74236bc51e0b7378c7dbe/FLAGab20e4b1a [2020-07-01 13:15:24,806 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_m3oRSk/tmp/1dd3783fb6a74236bc51e0b7378c7dbe [2020-07-01 13:15:24,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:15:24,819 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:15:24,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:15:24,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:15:24,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:15:24,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:15:24" (1/1) ... [2020-07-01 13:15:24,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b26c2e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:24, skipping insertion in model container [2020-07-01 13:15:24,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:15:24" (1/1) ... [2020-07-01 13:15:24,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:15:24,852 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:15:25,056 WARN L612 FunctionHandler]: implicit declaration of function g [2020-07-01 13:15:25,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:15:25,073 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:15:25,086 WARN L612 FunctionHandler]: implicit declaration of function g [2020-07-01 13:15:25,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:15:25,113 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:15:25,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25 WrapperNode [2020-07-01 13:15:25,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:15:25,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:15:25,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:15:25,115 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:15:25,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:15:25,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:15:25,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:15:25,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:15:25,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:15:25,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:15:25,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:15:25,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:15:25,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... No working directory specified, using /export/starexec/sandbox/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-07-01 13:15:25,238 INFO L130 BoogieDeclarations]: Found specification of procedure f [2020-07-01 13:15:25,238 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2020-07-01 13:15:25,239 INFO L130 BoogieDeclarations]: Found specification of procedure g [2020-07-01 13:15:25,239 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2020-07-01 13:15:25,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:15:25,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:15:25,409 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:15:25,410 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-01 13:15:25,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:15:25 BoogieIcfgContainer [2020-07-01 13:15:25,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:15:25,414 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:15:25,414 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:15:25,417 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:15:25,418 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,432 INFO L313 BlockEncoder]: Initial Icfg 20 locations, 24 edges [2020-07-01 13:15:25,433 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:15:25,434 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:15:25,435 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:15:25,435 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:15:25,437 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:15:25,437 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:15:25,438 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:15:25,451 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:15:25,458 INFO L200 BlockEncoder]: SBE split 0 edges [2020-07-01 13:15:25,463 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:15:25,465 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:15:25,476 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-07-01 13:15:25,478 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states [2020-07-01 13:15:25,480 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:15:25,480 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:15:25,480 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:15:25,481 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:15:25,481 INFO L313 BlockEncoder]: Encoded RCFG 16 locations, 20 edges [2020-07-01 13:15:25,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:15:25 BasicIcfg [2020-07-01 13:15:25,482 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:15:25,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:15:25,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:15:25,486 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:15:25,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:15:24" (1/4) ... [2020-07-01 13:15:25,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b63a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:15:25, skipping insertion in model container [2020-07-01 13:15:25,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (2/4) ... [2020-07-01 13:15:25,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b63a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:15:25, skipping insertion in model container [2020-07-01 13:15:25,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:15:25" (3/4) ... [2020-07-01 13:15:25,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b63a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:15:25, skipping insertion in model container [2020-07-01 13:15:25,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:15:25" (4/4) ... [2020-07-01 13:15:25,491 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:15:25,501 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:15:25,508 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-07-01 13:15:25,521 INFO L251 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-07-01 13:15:25,544 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:15:25,544 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:15:25,545 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:15:25,545 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:15:25,545 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:15:25,545 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:15:25,545 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:15:25,545 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:15:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-07-01 13:15:25,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:15:25,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-07-01 13:15:25,645 INFO L271 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-07-01 13:15:25,645 INFO L268 CegarLoopResult]: For program point L10(lines 10 11) no Hoare annotation was computed. [2020-07-01 13:15:25,646 INFO L271 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: true [2020-07-01 13:15:25,646 INFO L268 CegarLoopResult]: For program point L11-2(line 11) no Hoare annotation was computed. [2020-07-01 13:15:25,646 INFO L268 CegarLoopResult]: For program point fEXIT(lines 8 12) no Hoare annotation was computed. [2020-07-01 13:15:25,646 INFO L271 CegarLoopResult]: At program point fENTRY(lines 8 12) the Hoare annotation is: true [2020-07-01 13:15:25,647 INFO L268 CegarLoopResult]: For program point fFINAL(lines 8 12) no Hoare annotation was computed. [2020-07-01 13:15:25,647 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-01 13:15:25,647 INFO L268 CegarLoopResult]: For program point L16(lines 16 17) no Hoare annotation was computed. [2020-07-01 13:15:25,647 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-01 13:15:25,647 INFO L268 CegarLoopResult]: For program point L17-2(line 17) no Hoare annotation was computed. [2020-07-01 13:15:25,647 INFO L268 CegarLoopResult]: For program point gEXIT(lines 14 18) no Hoare annotation was computed. [2020-07-01 13:15:25,648 INFO L268 CegarLoopResult]: For program point gFINAL(lines 14 18) no Hoare annotation was computed. [2020-07-01 13:15:25,648 INFO L271 CegarLoopResult]: At program point gENTRY(lines 14 18) the Hoare annotation is: true [2020-07-01 13:15:25,648 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:15:25,648 INFO L271 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-07-01 13:15:25,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:15:25 BasicIcfg [2020-07-01 13:15:25,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:15:25,653 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:15:25,653 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:15:25,657 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:15:25,658 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:15:25,658 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:15:24" (1/5) ... [2020-07-01 13:15:25,658 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4379ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:15:25, skipping insertion in model container [2020-07-01 13:15:25,659 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:15:25,659 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (2/5) ... [2020-07-01 13:15:25,659 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4379ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:15:25, skipping insertion in model container [2020-07-01 13:15:25,659 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:15:25,659 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:15:25" (3/5) ... [2020-07-01 13:15:25,660 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4379ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:15:25, skipping insertion in model container [2020-07-01 13:15:25,660 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:15:25,660 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:15:25" (4/5) ... [2020-07-01 13:15:25,660 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4379ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:15:25, skipping insertion in model container [2020-07-01 13:15:25,660 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:15:25,661 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:15:25" (5/5) ... [2020-07-01 13:15:25,662 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:15:25,690 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:15:25,690 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:15:25,690 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:15:25,690 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:15:25,690 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:15:25,691 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:15:25,691 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:15:25,691 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:15:25,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-01 13:15:25,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-01 13:15:25,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:15:25,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:15:25,722 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 13:15:25,722 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:15:25,722 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:15:25,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-01 13:15:25,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-01 13:15:25,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:15:25,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:15:25,725 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 13:15:25,725 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:15:25,730 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue [43] ULTIMATE.startENTRY-->L23: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet4_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 17#L23true [51] L23-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 13#gENTRYtrue [2020-07-01 13:15:25,731 INFO L796 eck$LassoCheckResult]: Loop: 13#gENTRYtrue [45] gENTRY-->L16: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 14#L16true [59] L16-->L17: Formula: (> v_g_~x_3 0) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 12#L17true [44] L17-->fENTRY: Formula: (= |v_f_#in~xInParam_1| (+ v_g_~x_6 (- 1))) InVars {g_~x=v_g_~x_6} OutVars{f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~x]< 15#fENTRYtrue [47] fENTRY-->L10: Formula: (= v_f_~x_1 |v_f_#in~x_1|) InVars {f_#in~x=|v_f_#in~x_1|} OutVars{f_~x=v_f_~x_1, f_#in~x=|v_f_#in~x_1|} AuxVars[] AssignedVars[f_~x] 5#L10true [60] L10-->L11: Formula: (> v_f_~x_3 0) InVars {f_~x=v_f_~x_3} OutVars{f_~x=v_f_~x_3} AuxVars[] AssignedVars[] 3#L11true [35] L11-->gENTRY: Formula: (= |v_g_#in~xInParam_1| v_f_~x_6) InVars {f_~x=v_f_~x_6} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 13#gENTRYtrue [2020-07-01 13:15:25,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:25,737 INFO L82 PathProgramCache]: Analyzing trace with hash 2345, now seen corresponding path program 1 times [2020-07-01 13:15:25,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:25,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919575863] [2020-07-01 13:15:25,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:25,814 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:25,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:25,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2063306215, now seen corresponding path program 1 times [2020-07-01 13:15:25,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:25,816 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316331152] [2020-07-01 13:15:25,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:25,841 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:25,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:25,843 INFO L82 PathProgramCache]: Analyzing trace with hash -518849215, now seen corresponding path program 1 times [2020-07-01 13:15:25,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:25,843 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314496147] [2020-07-01 13:15:25,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:25,859 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:25,995 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:15:25,996 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:15:25,996 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:15:25,996 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:15:25,996 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 13:15:25,996 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:15:25,997 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:15:25,997 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:15:25,997 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 13:15:25,997 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:15:25,997 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:15:26,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:26,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:26,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:26,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:26,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:26,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-07-01 13:15:26,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:26,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:26,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:26,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:26,146 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:15:26,147 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/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-07-01 13:15:26,153 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:15:26,153 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:15:26,163 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:15:26,163 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f_#res=0} Honda state: {f_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/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-07-01 13:15:26,196 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:15:26,197 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:15:26,201 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:15:26,201 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret2=0} Honda state: {g_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/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-07-01 13:15:26,233 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:15:26,234 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:15:26,237 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:15:26,237 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret3=0} Honda state: {g_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/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-07-01 13:15:26,269 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:15:26,270 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:15:26,273 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:15:26,273 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:15:26,305 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:15:26,306 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:15:26,341 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 13:15:26,341 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:15:26,378 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 13:15:26,381 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:15:26,381 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:15:26,381 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:15:26,381 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:15:26,381 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 13:15:26,381 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:26,381 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:15:26,382 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:15:26,382 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 13:15:26,382 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:15:26,382 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:15:26,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:26,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:26,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:26,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:26,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:26,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:26,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-07-01 13:15:26,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:26,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-07-01 13:15:26,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:26,484 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:15:26,490 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:26,494 INFO L120 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-07-01 13:15:26,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:26,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:15:26,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:26,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:26,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:26,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:15:26,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:15:26,505 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:26,539 INFO L120 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-07-01 13:15:26,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:26,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:15:26,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:26,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:26,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:26,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:15:26,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:15:26,545 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:26,577 INFO L120 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-07-01 13:15:26,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:26,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:15:26,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:26,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:26,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:26,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:15:26,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:15:26,583 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:26,615 INFO L120 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-07-01 13:15:26,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:26,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:15:26,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:26,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:26,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:26,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:15:26,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:15:26,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:26,654 INFO L120 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-07-01 13:15:26,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:26,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:15:26,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:26,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:26,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:26,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:15:26,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:15:26,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:26,691 INFO L120 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-07-01 13:15:26,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:26,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:15:26,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:26,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:26,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:26,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:15:26,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:15:26,699 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:26,732 INFO L120 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-07-01 13:15:26,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:26,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:15:26,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:26,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:26,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:26,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:15:26,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:15:26,739 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 13:15:26,745 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 13:15:26,745 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:26,749 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 13:15:26,749 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 13:15:26,750 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 13:15:26,750 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(g_#in~x) = 1*g_#in~x Supporting invariants [] [2020-07-01 13:15:26,784 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 13:15:26,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:26,858 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 13:15:26,859 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:15:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:26,891 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 13:15:26,892 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:15:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:26,997 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-07-01 13:15:27,003 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 5 loop predicates [2020-07-01 13:15:27,005 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states. Second operand 6 states. [2020-07-01 13:15:27,198 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states.. Second operand 6 states. Result 62 states and 82 transitions. Complement of second has 28 states. [2020-07-01 13:15:27,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2020-07-01 13:15:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-01 13:15:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2020-07-01 13:15:27,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 34 transitions. Stem has 2 letters. Loop has 6 letters. [2020-07-01 13:15:27,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:15:27,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 34 transitions. Stem has 8 letters. Loop has 6 letters. [2020-07-01 13:15:27,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:15:27,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 34 transitions. Stem has 2 letters. Loop has 12 letters. [2020-07-01 13:15:27,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:15:27,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 82 transitions. [2020-07-01 13:15:27,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-01 13:15:27,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 47 states and 63 transitions. [2020-07-01 13:15:27,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-07-01 13:15:27,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-07-01 13:15:27,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 63 transitions. [2020-07-01 13:15:27,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:15:27,238 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2020-07-01 13:15:27,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 63 transitions. [2020-07-01 13:15:27,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2020-07-01 13:15:27,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-01 13:15:27,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2020-07-01 13:15:27,276 INFO L711 BuchiCegarLoop]: Abstraction has 44 states and 56 transitions. [2020-07-01 13:15:27,276 INFO L591 BuchiCegarLoop]: Abstraction has 44 states and 56 transitions. [2020-07-01 13:15:27,276 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 13:15:27,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 56 transitions. [2020-07-01 13:15:27,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-01 13:15:27,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:15:27,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:15:27,280 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:27,280 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:27,281 INFO L794 eck$LassoCheckResult]: Stem: 187#ULTIMATE.startENTRY [43] ULTIMATE.startENTRY-->L23: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet4_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 185#L23 [51] L23-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 188#gENTRY [45] gENTRY-->L16: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 189#L16 [59] L16-->L17: Formula: (> v_g_~x_3 0) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 166#L17 [44] L17-->fENTRY: Formula: (= |v_f_#in~xInParam_1| (+ v_g_~x_6 (- 1))) InVars {g_~x=v_g_~x_6} OutVars{f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~x]< 186#fENTRY [47] fENTRY-->L10: Formula: (= v_f_~x_1 |v_f_#in~x_1|) InVars {f_#in~x=|v_f_#in~x_1|} OutVars{f_~x=v_f_~x_1, f_#in~x=|v_f_#in~x_1|} AuxVars[] AssignedVars[f_~x] 200#L10 [60] L10-->L11: Formula: (> v_f_~x_3 0) InVars {f_~x=v_f_~x_3} OutVars{f_~x=v_f_~x_3} AuxVars[] AssignedVars[] 165#L11 [35] L11-->gENTRY: Formula: (= |v_g_#in~xInParam_1| v_f_~x_6) InVars {f_~x=v_f_~x_6} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 168#gENTRY [45] gENTRY-->L16: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 191#L16 [48] L16-->gFINAL: Formula: (and (= |v_g_#res_2| 0) (<= v_g_~x_2 0)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_2|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 176#gFINAL [39] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 177#gEXIT >[56] gEXIT-->L11-1: AOR: Formula: (= |v_f_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{f_#t~ret0=|v_f_#t~ret0_4|} AuxVars[] AssignedVars[f_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| v_f_~x_6) InVars {f_~x=v_f_~x_6} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 171#L11-1 [2020-07-01 13:15:27,281 INFO L796 eck$LassoCheckResult]: Loop: 171#L11-1 [38] L11-1-->gENTRY: Formula: (= |v_g_#in~xInParam_2| (+ v_f_~x_7 1)) InVars {f_~x=v_f_~x_7} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x]< 164#gENTRY [45] gENTRY-->L16: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 201#L16 [59] L16-->L17: Formula: (> v_g_~x_3 0) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 162#L17 [44] L17-->fENTRY: Formula: (= |v_f_#in~xInParam_1| (+ v_g_~x_6 (- 1))) InVars {g_~x=v_g_~x_6} OutVars{f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~x]< 193#fENTRY [47] fENTRY-->L10: Formula: (= v_f_~x_1 |v_f_#in~x_1|) InVars {f_#in~x=|v_f_#in~x_1|} OutVars{f_~x=v_f_~x_1, f_#in~x=|v_f_#in~x_1|} AuxVars[] AssignedVars[f_~x] 196#L10 [60] L10-->L11: Formula: (> v_f_~x_3 0) InVars {f_~x=v_f_~x_3} OutVars{f_~x=v_f_~x_3} AuxVars[] AssignedVars[] 161#L11 [35] L11-->gENTRY: Formula: (= |v_g_#in~xInParam_1| v_f_~x_6) InVars {f_~x=v_f_~x_6} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 164#gENTRY [45] gENTRY-->L16: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 201#L16 [48] L16-->gFINAL: Formula: (and (= |v_g_#res_2| 0) (<= v_g_~x_2 0)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_2|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 195#gFINAL [39] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 204#gEXIT >[56] gEXIT-->L11-1: AOR: Formula: (= |v_f_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{f_#t~ret0=|v_f_#t~ret0_4|} AuxVars[] AssignedVars[f_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| v_f_~x_6) InVars {f_~x=v_f_~x_6} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 171#L11-1 [2020-07-01 13:15:27,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:27,282 INFO L82 PathProgramCache]: Analyzing trace with hash -118119787, now seen corresponding path program 1 times [2020-07-01 13:15:27,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:27,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338005433] [2020-07-01 13:15:27,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:27,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 13:15:27,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338005433] [2020-07-01 13:15:27,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:27,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 13:15:27,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766204645] [2020-07-01 13:15:27,369 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:15:27,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:27,370 INFO L82 PathProgramCache]: Analyzing trace with hash 934307505, now seen corresponding path program 1 times [2020-07-01 13:15:27,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:27,370 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858066544] [2020-07-01 13:15:27,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 13:15:27,417 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858066544] [2020-07-01 13:15:27,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:27,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 13:15:27,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971658246] [2020-07-01 13:15:27,419 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 13:15:27,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:27,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 13:15:27,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:15:27,423 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. cyclomatic complexity: 14 Second operand 5 states. [2020-07-01 13:15:27,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:27,491 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2020-07-01 13:15:27,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:15:27,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 59 transitions. [2020-07-01 13:15:27,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-01 13:15:27,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 44 states and 55 transitions. [2020-07-01 13:15:27,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-07-01 13:15:27,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-07-01 13:15:27,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 55 transitions. [2020-07-01 13:15:27,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:15:27,499 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2020-07-01 13:15:27,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 55 transitions. [2020-07-01 13:15:27,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-01 13:15:27,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-01 13:15:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2020-07-01 13:15:27,505 INFO L711 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2020-07-01 13:15:27,506 INFO L591 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2020-07-01 13:15:27,506 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-01 13:15:27,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 55 transitions. [2020-07-01 13:15:27,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-01 13:15:27,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:15:27,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:15:27,509 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:27,509 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:27,510 INFO L794 eck$LassoCheckResult]: Stem: 302#ULTIMATE.startENTRY [43] ULTIMATE.startENTRY-->L23: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet4_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 290#L23 [51] L23-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 303#gENTRY [45] gENTRY-->L16: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 304#L16 [59] L16-->L17: Formula: (> v_g_~x_3 0) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 280#L17 [44] L17-->fENTRY: Formula: (= |v_f_#in~xInParam_1| (+ v_g_~x_6 (- 1))) InVars {g_~x=v_g_~x_6} OutVars{f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~x]< 301#fENTRY [47] fENTRY-->L10: Formula: (= v_f_~x_1 |v_f_#in~x_1|) InVars {f_#in~x=|v_f_#in~x_1|} OutVars{f_~x=v_f_~x_1, f_#in~x=|v_f_#in~x_1|} AuxVars[] AssignedVars[f_~x] 315#L10 [60] L10-->L11: Formula: (> v_f_~x_3 0) InVars {f_~x=v_f_~x_3} OutVars{f_~x=v_f_~x_3} AuxVars[] AssignedVars[] 278#L11 [35] L11-->gENTRY: Formula: (= |v_g_#in~xInParam_1| v_f_~x_6) InVars {f_~x=v_f_~x_6} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 283#gENTRY [45] gENTRY-->L16: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 306#L16 [59] L16-->L17: Formula: (> v_g_~x_3 0) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 286#L17 [44] L17-->fENTRY: Formula: (= |v_f_#in~xInParam_1| (+ v_g_~x_6 (- 1))) InVars {g_~x=v_g_~x_6} OutVars{f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~x]< 300#fENTRY [47] fENTRY-->L10: Formula: (= v_f_~x_1 |v_f_#in~x_1|) InVars {f_#in~x=|v_f_#in~x_1|} OutVars{f_~x=v_f_~x_1, f_#in~x=|v_f_#in~x_1|} AuxVars[] AssignedVars[f_~x] 285#L10 [36] L10-->fFINAL: Formula: (and (= |v_f_#res_1| 0) (<= v_f_~x_2 0)) InVars {f_~x=v_f_~x_2} OutVars{f_#res=|v_f_#res_1|, f_~x=v_f_~x_2} AuxVars[] AssignedVars[f_#res] 287#fFINAL [41] fFINAL-->fEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 299#fEXIT >[54] fEXIT-->L17-1: AOR: Formula: (= |v_g_#t~ret2_4| |v_f_#resOutParam_1|) InVars {f_#res=|v_f_#resOutParam_1|} OutVars{g_#t~ret2=|v_g_#t~ret2_4|} AuxVars[] AssignedVars[g_#t~ret2] LVA: Formula: (= |v_f_#in~xInParam_1| (+ v_g_~x_6 (- 1))) InVars {g_~x=v_g_~x_6} OutVars{f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~x] 295#L17-1 [50] L17-1-->fENTRY: Formula: (= |v_f_#in~xInParam_2| (+ v_g_~x_7 (- 2))) InVars {g_~x=v_g_~x_7} OutVars{f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~x]< 308#fENTRY [47] fENTRY-->L10: Formula: (= v_f_~x_1 |v_f_#in~x_1|) InVars {f_#in~x=|v_f_#in~x_1|} OutVars{f_~x=v_f_~x_1, f_#in~x=|v_f_#in~x_1|} AuxVars[] AssignedVars[f_~x] 317#L10 [36] L10-->fFINAL: Formula: (and (= |v_f_#res_1| 0) (<= v_f_~x_2 0)) InVars {f_~x=v_f_~x_2} OutVars{f_#res=|v_f_#res_1|, f_~x=v_f_~x_2} AuxVars[] AssignedVars[f_#res] 294#fFINAL [41] fFINAL-->fEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 296#fEXIT >[58] fEXIT-->L17-2: AOR: Formula: (= |v_g_#t~ret3_4| |v_f_#resOutParam_2|) InVars {f_#res=|v_f_#resOutParam_2|} OutVars{g_#t~ret3=|v_g_#t~ret3_4|} AuxVars[] AssignedVars[g_#t~ret3] LVA: Formula: (= |v_f_#in~xInParam_2| (+ v_g_~x_7 (- 2))) InVars {g_~x=v_g_~x_7} OutVars{f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~x] 309#L17-2 [52] L17-2-->gFINAL: Formula: (= |v_g_#res_1| (+ |v_g_#t~ret2_2| |v_g_#t~ret3_2|)) InVars {g_#t~ret2=|v_g_#t~ret2_2|, g_#t~ret3=|v_g_#t~ret3_2|} OutVars{g_#t~ret3=|v_g_#t~ret3_1|, g_#t~ret2=|v_g_#t~ret2_1|, g_#res=|v_g_#res_1|} AuxVars[] AssignedVars[g_#t~ret3, g_#t~ret2, g_#res] 289#gFINAL [39] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 291#gEXIT >[56] gEXIT-->L11-1: AOR: Formula: (= |v_f_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{f_#t~ret0=|v_f_#t~ret0_4|} AuxVars[] AssignedVars[f_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| v_f_~x_6) InVars {f_~x=v_f_~x_6} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 284#L11-1 [2020-07-01 13:15:27,510 INFO L796 eck$LassoCheckResult]: Loop: 284#L11-1 [38] L11-1-->gENTRY: Formula: (= |v_g_#in~xInParam_2| (+ v_f_~x_7 1)) InVars {f_~x=v_f_~x_7} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x]< 277#gENTRY [45] gENTRY-->L16: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 314#L16 [59] L16-->L17: Formula: (> v_g_~x_3 0) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 276#L17 [44] L17-->fENTRY: Formula: (= |v_f_#in~xInParam_1| (+ v_g_~x_6 (- 1))) InVars {g_~x=v_g_~x_6} OutVars{f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~x]< 313#fENTRY [47] fENTRY-->L10: Formula: (= v_f_~x_1 |v_f_#in~x_1|) InVars {f_#in~x=|v_f_#in~x_1|} OutVars{f_~x=v_f_~x_1, f_#in~x=|v_f_#in~x_1|} AuxVars[] AssignedVars[f_~x] 310#L10 [60] L10-->L11: Formula: (> v_f_~x_3 0) InVars {f_~x=v_f_~x_3} OutVars{f_~x=v_f_~x_3} AuxVars[] AssignedVars[] 274#L11 [35] L11-->gENTRY: Formula: (= |v_g_#in~xInParam_1| v_f_~x_6) InVars {f_~x=v_f_~x_6} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 277#gENTRY [45] gENTRY-->L16: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 314#L16 [59] L16-->L17: Formula: (> v_g_~x_3 0) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 276#L17 [44] L17-->fENTRY: Formula: (= |v_f_#in~xInParam_1| (+ v_g_~x_6 (- 1))) InVars {g_~x=v_g_~x_6} OutVars{f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~x]< 313#fENTRY [47] fENTRY-->L10: Formula: (= v_f_~x_1 |v_f_#in~x_1|) InVars {f_#in~x=|v_f_#in~x_1|} OutVars{f_~x=v_f_~x_1, f_#in~x=|v_f_#in~x_1|} AuxVars[] AssignedVars[f_~x] 310#L10 [36] L10-->fFINAL: Formula: (and (= |v_f_#res_1| 0) (<= v_f_~x_2 0)) InVars {f_~x=v_f_~x_2} OutVars{f_#res=|v_f_#res_1|, f_~x=v_f_~x_2} AuxVars[] AssignedVars[f_#res] 311#fFINAL [41] fFINAL-->fEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 316#fEXIT >[54] fEXIT-->L17-1: AOR: Formula: (= |v_g_#t~ret2_4| |v_f_#resOutParam_1|) InVars {f_#res=|v_f_#resOutParam_1|} OutVars{g_#t~ret2=|v_g_#t~ret2_4|} AuxVars[] AssignedVars[g_#t~ret2] LVA: Formula: (= |v_f_#in~xInParam_1| (+ v_g_~x_6 (- 1))) InVars {g_~x=v_g_~x_6} OutVars{f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~x] 275#L17-1 [50] L17-1-->fENTRY: Formula: (= |v_f_#in~xInParam_2| (+ v_g_~x_7 (- 2))) InVars {g_~x=v_g_~x_7} OutVars{f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~x]< 313#fENTRY [47] fENTRY-->L10: Formula: (= v_f_~x_1 |v_f_#in~x_1|) InVars {f_#in~x=|v_f_#in~x_1|} OutVars{f_~x=v_f_~x_1, f_#in~x=|v_f_#in~x_1|} AuxVars[] AssignedVars[f_~x] 310#L10 [36] L10-->fFINAL: Formula: (and (= |v_f_#res_1| 0) (<= v_f_~x_2 0)) InVars {f_~x=v_f_~x_2} OutVars{f_#res=|v_f_#res_1|, f_~x=v_f_~x_2} AuxVars[] AssignedVars[f_#res] 311#fFINAL [41] fFINAL-->fEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 316#fEXIT >[58] fEXIT-->L17-2: AOR: Formula: (= |v_g_#t~ret3_4| |v_f_#resOutParam_2|) InVars {f_#res=|v_f_#resOutParam_2|} OutVars{g_#t~ret3=|v_g_#t~ret3_4|} AuxVars[] AssignedVars[g_#t~ret3] LVA: Formula: (= |v_f_#in~xInParam_2| (+ v_g_~x_7 (- 2))) InVars {g_~x=v_g_~x_7} OutVars{f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~x] 309#L17-2 [52] L17-2-->gFINAL: Formula: (= |v_g_#res_1| (+ |v_g_#t~ret2_2| |v_g_#t~ret3_2|)) InVars {g_#t~ret2=|v_g_#t~ret2_2|, g_#t~ret3=|v_g_#t~ret3_2|} OutVars{g_#t~ret3=|v_g_#t~ret3_1|, g_#t~ret2=|v_g_#t~ret2_1|, g_#res=|v_g_#res_1|} AuxVars[] AssignedVars[g_#t~ret3, g_#t~ret2, g_#res] 289#gFINAL [39] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 291#gEXIT >[56] gEXIT-->L11-1: AOR: Formula: (= |v_f_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{f_#t~ret0=|v_f_#t~ret0_4|} AuxVars[] AssignedVars[f_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| v_f_~x_6) InVars {f_~x=v_f_~x_6} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 284#L11-1 [2020-07-01 13:15:27,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:27,511 INFO L82 PathProgramCache]: Analyzing trace with hash -550172724, now seen corresponding path program 1 times [2020-07-01 13:15:27,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:27,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065742990] [2020-07-01 13:15:27,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:27,537 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:27,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:27,537 INFO L82 PathProgramCache]: Analyzing trace with hash -498738640, now seen corresponding path program 1 times [2020-07-01 13:15:27,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:27,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565681460] [2020-07-01 13:15:27,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:27,561 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:27,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:27,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1816143803, now seen corresponding path program 1 times [2020-07-01 13:15:27,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:27,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279862476] [2020-07-01 13:15:27,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:27,601 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:28,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:15:28 BasicIcfg [2020-07-01 13:15:28,153 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 13:15:28,155 INFO L168 Benchmark]: Toolchain (without parser) took 3336.22 ms. Allocated memory was 514.9 MB in the beginning and 600.3 MB in the end (delta: 85.5 MB). Free memory was 435.6 MB in the beginning and 553.0 MB in the end (delta: -117.4 MB). Peak memory consumption was 126.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:15:28,156 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 456.0 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:15:28,157 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.75 ms. Allocated memory was 514.9 MB in the beginning and 565.7 MB in the end (delta: 50.9 MB). Free memory was 435.1 MB in the beginning and 534.9 MB in the end (delta: -99.8 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:15:28,157 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.09 ms. Allocated memory is still 565.7 MB. Free memory was 534.9 MB in the beginning and 533.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:15:28,158 INFO L168 Benchmark]: Boogie Preprocessor took 16.96 ms. Allocated memory is still 565.7 MB. Free memory was 533.3 MB in the beginning and 532.5 MB in the end (delta: 804.6 kB). Peak memory consumption was 804.6 kB. Max. memory is 50.3 GB. [2020-07-01 13:15:28,158 INFO L168 Benchmark]: RCFGBuilder took 247.12 ms. Allocated memory is still 565.7 MB. Free memory was 531.8 MB in the beginning and 519.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:15:28,159 INFO L168 Benchmark]: BlockEncodingV2 took 67.98 ms. Allocated memory is still 565.7 MB. Free memory was 519.1 MB in the beginning and 514.6 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:15:28,159 INFO L168 Benchmark]: TraceAbstraction took 169.18 ms. Allocated memory is still 565.7 MB. Free memory was 513.9 MB in the beginning and 502.6 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:15:28,160 INFO L168 Benchmark]: BuchiAutomizer took 2500.39 ms. Allocated memory was 565.7 MB in the beginning and 600.3 MB in the end (delta: 34.6 MB). Free memory was 501.8 MB in the beginning and 553.0 MB in the end (delta: -51.2 MB). Peak memory consumption was 142.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:15:28,164 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 20 locations, 24 edges - StatisticsResult: Encoded RCFG 16 locations, 20 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 456.0 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 294.75 ms. Allocated memory was 514.9 MB in the beginning and 565.7 MB in the end (delta: 50.9 MB). Free memory was 435.1 MB in the beginning and 534.9 MB in the end (delta: -99.8 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 34.09 ms. Allocated memory is still 565.7 MB. Free memory was 534.9 MB in the beginning and 533.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 16.96 ms. Allocated memory is still 565.7 MB. Free memory was 533.3 MB in the beginning and 532.5 MB in the end (delta: 804.6 kB). Peak memory consumption was 804.6 kB. Max. memory is 50.3 GB. * RCFGBuilder took 247.12 ms. Allocated memory is still 565.7 MB. Free memory was 531.8 MB in the beginning and 519.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 67.98 ms. Allocated memory is still 565.7 MB. Free memory was 519.1 MB in the beginning and 514.6 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 169.18 ms. Allocated memory is still 565.7 MB. Free memory was 513.9 MB in the beginning and 502.6 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2500.39 ms. Allocated memory was 565.7 MB in the beginning and 600.3 MB in the end (delta: 34.6 MB). Free memory was 501.8 MB in the beginning and 553.0 MB in the end (delta: -51.2 MB). Peak memory consumption was 142.1 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 16 locations, 0 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 16 PreInvPairs, 16 NumberOfFragments, 7 HoareAnnotationTreeSize, 16 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 0 deterministic, 1 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function \old(x) and consists of 8 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 44 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 3 iterations. TraceHistogramMax:3. Analysis of lassos took 1.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 44 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 42 SDtfs, 41 SDslu, 50 SDs, 0 SdLazy, 87 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 11]: 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 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b371498=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@323d8aaf=0, \result=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f736448=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6652ff96=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4aee27a9=0, \old(x)=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@352580cf=0, NULL=0, x=1, \result=0, \old(x)=0, x=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L22] int x = __VERIFIER_nondet_int(); [L23] CALL g(x) [L16] COND FALSE !(x <= 0) [L17] CALL, EXPR f(x - 1) [L10] COND FALSE !(x <= 0) [L11] CALL g(x) [L16] COND FALSE !(x <= 0) [L17] CALL, EXPR f(x - 1) [L10] COND TRUE x <= 0 [L10] return 0; [L17] RET, EXPR f(x - 1) [L17] CALL, EXPR f(x - 2) [L10] COND TRUE x <= 0 [L10] return 0; [L17] RET, EXPR f(x - 2) [L17] return f(x - 1) + f(x - 2); [L11] RET g(x) Loop: [L11] CALL g(x + 1) [L16] COND FALSE !(x <= 0) [L17] CALL, EXPR f(x - 1) [L10] COND FALSE !(x <= 0) [L11] CALL g(x) [L16] COND FALSE !(x <= 0) [L17] CALL, EXPR f(x - 1) [L10] COND TRUE x <= 0 [L10] return 0; [L17] RET, EXPR f(x - 1) [L17] CALL, EXPR f(x - 2) [L10] COND TRUE x <= 0 [L10] return 0; [L17] RET, EXPR f(x - 2) [L17] return f(x - 1) + f(x - 2); [L11] RET g(x) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! !SESSION 2020-07-01 13:15:21.556 ----------------------------------------------- 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/sandbox/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/sandbox/tmp/BenchExec_run_m3oRSk/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:15:28.402 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check