YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 01:27:26,931 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 01:27:26,933 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 01:27:26,944 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 01:27:26,945 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 01:27:26,946 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 01:27:26,947 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 01:27:26,948 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 01:27:26,950 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 01:27:26,951 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 01:27:26,952 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 01:27:26,952 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 01:27:26,953 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 01:27:26,953 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 01:27:26,955 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 01:27:26,955 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 01:27:26,956 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 01:27:26,958 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 01:27:26,960 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 01:27:26,961 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 01:27:26,962 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 01:27:26,963 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 01:27:26,965 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 01:27:26,965 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 01:27:26,965 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 01:27:26,966 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 01:27:26,967 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 01:27:26,967 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 01:27:26,968 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 01:27:26,968 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 01:27:26,969 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 01:27:26,970 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 01:27:26,971 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 01:27:26,971 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 01:27:26,971 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 01:27:26,972 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 01:27:26,972 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 01:27:26,973 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 01:27:26,974 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 01:27:26,974 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 01:27:26,989 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 01:27:26,990 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 01:27:26,991 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 01:27:26,991 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 01:27:26,991 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 01:27:26,991 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 01:27:26,992 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 01:27:26,992 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 01:27:26,992 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 01:27:26,992 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 01:27:26,992 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 01:27:26,992 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 01:27:26,993 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 01:27:26,993 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 01:27:26,993 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:26,993 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 01:27:26,993 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 01:27:26,994 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 01:27:26,994 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 01:27:26,994 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 01:27:26,994 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 01:27:26,994 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 01:27:26,994 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 01:27:26,995 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 01:27:26,995 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 01:27:26,995 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 01:27:26,995 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 01:27:26,995 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 01:27:26,996 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 01:27:27,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 01:27:27,036 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 01:27:27,039 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 01:27:27,040 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 01:27:27,041 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 01:27:27,041 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 01:27:27,111 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/bf179a2adc02476a9a1b4bfc4163ca0d/FLAGd8265b598 [2020-06-22 01:27:27,457 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 01:27:27,458 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 01:27:27,465 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/bf179a2adc02476a9a1b4bfc4163ca0d/FLAGd8265b598 [2020-06-22 01:27:27,874 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/bf179a2adc02476a9a1b4bfc4163ca0d [2020-06-22 01:27:27,886 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 01:27:27,887 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 01:27:27,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 01:27:27,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 01:27:27,892 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 01:27:27,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 01:27:27" (1/1) ... [2020-06-22 01:27:27,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42be510f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:27:27, skipping insertion in model container [2020-06-22 01:27:27,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 01:27:27" (1/1) ... [2020-06-22 01:27:27,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 01:27:27,920 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 01:27:28,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 01:27:28,077 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 01:27:28,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 01:27:28,173 INFO L195 MainTranslator]: Completed translation [2020-06-22 01:27:28,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:27:28 WrapperNode [2020-06-22 01:27:28,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 01:27:28,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 01:27:28,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 01:27:28,174 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 01:27:28,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:27:28" (1/1) ... [2020-06-22 01:27:28,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:27:28" (1/1) ... [2020-06-22 01:27:28,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 01:27:28,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 01:27:28,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 01:27:28,208 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 01:27:28,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:27:28" (1/1) ... [2020-06-22 01:27:28,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:27:28" (1/1) ... [2020-06-22 01:27:28,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:27:28" (1/1) ... [2020-06-22 01:27:28,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:27:28" (1/1) ... [2020-06-22 01:27:28,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:27:28" (1/1) ... [2020-06-22 01:27:28,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:27:28" (1/1) ... [2020-06-22 01:27:28,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:27:28" (1/1) ... [2020-06-22 01:27:28,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 01:27:28,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 01:27:28,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 01:27:28,226 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 01:27:28,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:27:28" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 01:27:28,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 01:27:28,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 01:27:28,298 INFO L130 BoogieDeclarations]: Found specification of procedure f91 [2020-06-22 01:27:28,298 INFO L138 BoogieDeclarations]: Found implementation of procedure f91 [2020-06-22 01:27:28,428 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 01:27:28,429 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2020-06-22 01:27:28,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:27:28 BoogieIcfgContainer [2020-06-22 01:27:28,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 01:27:28,431 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 01:27:28,431 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 01:27:28,433 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 01:27:28,434 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:27:28" (1/1) ... [2020-06-22 01:27:28,449 INFO L313 BlockEncoder]: Initial Icfg 15 locations, 18 edges [2020-06-22 01:27:28,451 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 01:27:28,452 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 01:27:28,452 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 01:27:28,452 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 01:27:28,454 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 01:27:28,455 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 01:27:28,455 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 01:27:28,470 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 01:27:28,487 INFO L200 BlockEncoder]: SBE split 2 edges [2020-06-22 01:27:28,492 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 01:27:28,494 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 01:27:28,502 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 01:27:28,505 INFO L70 RemoveSinkStates]: Removed 11 edges and 5 locations by removing sink states [2020-06-22 01:27:28,506 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 01:27:28,506 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 01:27:28,507 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 01:27:28,507 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 01:27:28,508 INFO L313 BlockEncoder]: Encoded RCFG 9 locations, 11 edges [2020-06-22 01:27:28,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 01:27:28 BasicIcfg [2020-06-22 01:27:28,508 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 01:27:28,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 01:27:28,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 01:27:28,512 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 01:27:28,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 01:27:27" (1/4) ... [2020-06-22 01:27:28,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d951d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:27:28, skipping insertion in model container [2020-06-22 01:27:28,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:27:28" (2/4) ... [2020-06-22 01:27:28,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d951d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:27:28, skipping insertion in model container [2020-06-22 01:27:28,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:27:28" (3/4) ... [2020-06-22 01:27:28,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d951d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:27:28, skipping insertion in model container [2020-06-22 01:27:28,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 01:27:28" (4/4) ... [2020-06-22 01:27:28,517 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 01:27:28,528 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 01:27:28,536 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 01:27:28,553 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 01:27:28,582 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 01:27:28,582 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 01:27:28,583 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 01:27:28,583 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 01:27:28,583 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 01:27:28,583 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 01:27:28,583 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 01:27:28,583 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 01:27:28,583 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 01:27:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-06-22 01:27:28,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 01:27:28,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-06-22 01:27:28,670 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 01:27:28,671 INFO L451 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: true [2020-06-22 01:27:28,671 INFO L448 ceAbstractionStarter]: For program point L19-2(line 19) no Hoare annotation was computed. [2020-06-22 01:27:28,671 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2020-06-22 01:27:28,672 INFO L451 ceAbstractionStarter]: At program point f91ENTRY(lines 15 21) the Hoare annotation is: true [2020-06-22 01:27:28,672 INFO L448 ceAbstractionStarter]: For program point f91FINAL(lines 15 21) no Hoare annotation was computed. [2020-06-22 01:27:28,672 INFO L451 ceAbstractionStarter]: At program point L19(line 19) the Hoare annotation is: true [2020-06-22 01:27:28,672 INFO L448 ceAbstractionStarter]: For program point f91EXIT(lines 15 21) no Hoare annotation was computed. [2020-06-22 01:27:28,672 INFO L451 ceAbstractionStarter]: At program point L19-1(line 19) the Hoare annotation is: true [2020-06-22 01:27:28,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:27:28 BasicIcfg [2020-06-22 01:27:28,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 01:27:28,676 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 01:27:28,677 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 01:27:28,680 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 01:27:28,681 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 01:27:28,681 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 01:27:27" (1/5) ... [2020-06-22 01:27:28,682 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61ae1aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 01:27:28, skipping insertion in model container [2020-06-22 01:27:28,682 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 01:27:28,682 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:27:28" (2/5) ... [2020-06-22 01:27:28,682 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61ae1aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 01:27:28, skipping insertion in model container [2020-06-22 01:27:28,682 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 01:27:28,683 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:27:28" (3/5) ... [2020-06-22 01:27:28,683 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61ae1aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 01:27:28, skipping insertion in model container [2020-06-22 01:27:28,683 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 01:27:28,683 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 01:27:28" (4/5) ... [2020-06-22 01:27:28,684 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61ae1aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 01:27:28, skipping insertion in model container [2020-06-22 01:27:28,684 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 01:27:28,684 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:27:28" (5/5) ... [2020-06-22 01:27:28,685 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 01:27:28,714 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 01:27:28,714 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 01:27:28,714 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 01:27:28,715 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 01:27:28,715 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 01:27:28,715 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 01:27:28,715 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 01:27:28,715 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 01:27:28,715 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 01:27:28,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-06-22 01:27:28,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 01:27:28,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:27:28,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:27:28,748 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 01:27:28,749 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 01:27:28,749 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 01:27:28,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-06-22 01:27:28,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 01:27:28,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:27:28,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:27:28,751 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 01:27:28,751 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 01:27:28,756 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [39] ULTIMATE.startENTRY-->L26: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_~result~0] 3#L26true [29] L26-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_1| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{f91_#in~x=|v_f91_#in~xInParam_1|} AuxVars[] AssignedVars[f91_#in~x]< 9#f91ENTRYtrue [2020-06-22 01:27:28,756 INFO L796 eck$LassoCheckResult]: Loop: 9#f91ENTRYtrue [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 10#L16true [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 7#L19true [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 9#f91ENTRYtrue [2020-06-22 01:27:28,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:27:28,762 INFO L82 PathProgramCache]: Analyzing trace with hash 2199, now seen corresponding path program 1 times [2020-06-22 01:27:28,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:27:28,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:27:28,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:28,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:27:28,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:28,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:27:28,827 INFO L82 PathProgramCache]: Analyzing trace with hash 71644, now seen corresponding path program 1 times [2020-06-22 01:27:28,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:27:28,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:27:28,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:28,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:27:28,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:28,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:27:28,848 INFO L82 PathProgramCache]: Analyzing trace with hash 65552262, now seen corresponding path program 1 times [2020-06-22 01:27:28,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:27:28,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:27:28,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:28,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:27:28,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:28,921 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:27:28,922 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:27:28,922 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:27:28,922 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:27:28,923 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 01:27:28,923 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:28,923 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:27:28,923 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:27:28,923 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 01:27:28,923 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:27:28,924 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:27:28,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:28,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:28,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:28,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:28,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:29,011 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:27:29,012 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:29,018 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:27:29,018 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:27:29,027 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:27:29,027 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_~x=0} Honda state: {f91_~x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:29,055 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:27:29,055 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:27:29,059 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:27:29,059 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:29,085 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:27:29,086 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:29,115 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 01:27:29,116 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:27:29,146 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 01:27:29,148 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:27:29,148 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:27:29,149 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:27:29,149 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:27:29,149 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 01:27:29,149 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 01:27:29,149 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:27:29,149 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:27:29,149 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 01:27:29,149 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:27:29,150 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:27:29,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:29,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:29,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:29,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:29,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:29,219 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:27:29,225 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 01:27:29,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:27:29,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:27:29,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:27:29,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:27:29,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:27:29,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:27:29,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:27:29,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:27:29,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:27:29,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:27:29,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:27:29,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:27:29,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:27:29,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:27:29,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:27:29,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:27:29,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:27:29,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:27:29,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:27:29,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:27:29,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:27:29,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:27:29,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:27:29,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:27:29,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:27:29,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:27:29,250 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 01:27:29,255 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 01:27:29,256 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 01:27:29,258 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 01:27:29,258 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 01:27:29,258 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 01:27:29,259 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#in~x) = -2*f91_#in~x + 211 Supporting invariants [] [2020-06-22 01:27:29,260 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 01:27:29,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:27:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:27:29,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 01:27:29,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:27:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:27:29,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 01:27:29,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:27:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:27:29,423 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 01:27:29,428 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 01:27:29,430 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states. Second operand 4 states. [2020-06-22 01:27:29,544 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states.. Second operand 4 states. Result 31 states and 39 transitions. Complement of second has 16 states. [2020-06-22 01:27:29,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 01:27:29,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 01:27:29,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2020-06-22 01:27:29,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 2 letters. Loop has 3 letters. [2020-06-22 01:27:29,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:27:29,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-22 01:27:29,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:27:29,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-22 01:27:29,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:27:29,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2020-06-22 01:27:29,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 01:27:29,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 27 transitions. [2020-06-22 01:27:29,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-06-22 01:27:29,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-06-22 01:27:29,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2020-06-22 01:27:29,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 01:27:29,574 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-06-22 01:27:29,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2020-06-22 01:27:29,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-06-22 01:27:29,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 01:27:29,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2020-06-22 01:27:29,611 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-06-22 01:27:29,611 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-06-22 01:27:29,611 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 01:27:29,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2020-06-22 01:27:29,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 01:27:29,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:27:29,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:27:29,613 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 01:27:29,614 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 01:27:29,614 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L26: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_~result~0] 96#L26 [29] L26-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_1| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{f91_#in~x=|v_f91_#in~xInParam_1|} AuxVars[] AssignedVars[f91_#in~x]< 97#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 109#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 102#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 107#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 111#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 112#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 113#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 99#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 106#f91ENTRY [2020-06-22 01:27:29,614 INFO L796 eck$LassoCheckResult]: Loop: 106#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 114#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 100#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 106#f91ENTRY [2020-06-22 01:27:29,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:27:29,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1787708875, now seen corresponding path program 1 times [2020-06-22 01:27:29,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:27:29,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:27:29,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:29,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:27:29,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:29,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:27:29,630 INFO L82 PathProgramCache]: Analyzing trace with hash 71644, now seen corresponding path program 2 times [2020-06-22 01:27:29,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:27:29,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:27:29,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:29,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:27:29,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:29,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:27:29,636 INFO L82 PathProgramCache]: Analyzing trace with hash -40582872, now seen corresponding path program 2 times [2020-06-22 01:27:29,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:27:29,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:27:29,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:29,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 01:27:29,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:29,680 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:27:29,680 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:27:29,680 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:27:29,681 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:27:29,681 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 01:27:29,681 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:29,681 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:27:29,681 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:27:29,681 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 01:27:29,681 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:27:29,681 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:27:29,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:29,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:29,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:29,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:29,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:29,722 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:27:29,722 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:29,729 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:27:29,729 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:27:29,733 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:27:29,733 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_~x=0} Honda state: {f91_~x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:29,761 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:27:29,761 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:27:29,765 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:27:29,765 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret0=0} Honda state: {f91_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:29,794 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:27:29,794 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:27:29,798 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:27:29,798 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:29,827 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:27:29,827 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:27:29,831 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:27:29,831 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret1=0} Honda state: {f91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:29,859 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:27:29,860 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:29,894 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 01:27:29,894 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:27:29,926 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 01:27:29,929 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:27:29,929 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:27:29,929 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:27:29,929 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:27:29,929 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 01:27:29,930 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 01:27:29,930 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:27:29,930 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:27:29,930 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 01:27:29,931 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:27:29,931 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:27:29,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:29,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:29,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:29,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:29,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:30,001 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:27:30,001 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 01:27:30,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:27:30,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:27:30,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:27:30,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:27:30,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:27:30,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:27:30,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:27:30,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:27:30,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:27:30,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:27:30,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:27:30,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:27:30,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:27:30,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:27:30,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:27:30,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:27:30,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:27:30,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:27:30,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:27:30,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:27:30,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:27:30,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:27:30,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:27:30,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:27:30,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:27:30,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:27:30,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:27:30,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:27:30,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:27:30,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:27:30,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:27:30,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:27:30,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:27:30,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:27:30,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:27:30,022 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 01:27:30,025 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 01:27:30,026 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 01:27:30,026 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 01:27:30,026 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 01:27:30,027 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 01:27:30,027 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#in~x) = -2*f91_#in~x + 211 Supporting invariants [] [2020-06-22 01:27:30,028 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 01:27:30,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:27:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:27:30,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 01:27:30,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:27:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:27:30,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 01:27:30,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:27:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:27:30,213 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 01:27:30,214 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2020-06-22 01:27:30,214 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 5 states. [2020-06-22 01:27:30,359 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 19 states and 25 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 42 states and 56 transitions. Complement of second has 17 states. [2020-06-22 01:27:30,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 01:27:30,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 01:27:30,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2020-06-22 01:27:30,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2020-06-22 01:27:30,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:27:30,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 13 letters. Loop has 3 letters. [2020-06-22 01:27:30,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:27:30,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 10 letters. Loop has 6 letters. [2020-06-22 01:27:30,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:27:30,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2020-06-22 01:27:30,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 01:27:30,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 31 states and 44 transitions. [2020-06-22 01:27:30,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-06-22 01:27:30,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 01:27:30,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 44 transitions. [2020-06-22 01:27:30,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 01:27:30,371 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2020-06-22 01:27:30,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 44 transitions. [2020-06-22 01:27:30,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2020-06-22 01:27:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 01:27:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-06-22 01:27:30,377 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-06-22 01:27:30,377 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-06-22 01:27:30,377 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 01:27:30,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2020-06-22 01:27:30,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 01:27:30,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:27:30,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:27:30,379 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 01:27:30,379 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-06-22 01:27:30,380 INFO L794 eck$LassoCheckResult]: Stem: 250#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L26: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_~result~0] 248#L26 [29] L26-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_1| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{f91_#in~x=|v_f91_#in~xInParam_1|} AuxVars[] AssignedVars[f91_#in~x]< 249#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 255#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 243#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 252#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 257#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 253#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 254#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 246#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 251#f91ENTRY [2020-06-22 01:27:30,380 INFO L796 eck$LassoCheckResult]: Loop: 251#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 258#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 245#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 265#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 266#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 264#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 259#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 242#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 251#f91ENTRY [2020-06-22 01:27:30,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:27:30,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1787708875, now seen corresponding path program 3 times [2020-06-22 01:27:30,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:27:30,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:27:30,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:30,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 01:27:30,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:30,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:27:30,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1847548001, now seen corresponding path program 1 times [2020-06-22 01:27:30,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:27:30,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:27:30,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:30,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 01:27:30,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:30,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:27:30,404 INFO L82 PathProgramCache]: Analyzing trace with hash -52498989, now seen corresponding path program 4 times [2020-06-22 01:27:30,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:27:30,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:27:30,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:30,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:27:30,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:30,497 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:27:30,497 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:27:30,497 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:27:30,497 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:27:30,498 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 01:27:30,498 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:30,498 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:27:30,498 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:27:30,498 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 01:27:30,498 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:27:30,498 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:27:30,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:30,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:30,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:30,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:30,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:30,547 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:27:30,548 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:30,551 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:27:30,551 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:27:30,555 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:27:30,555 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret1=0} Honda state: {f91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:30,582 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:27:30,582 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:27:30,585 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:27:30,585 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret0=0} Honda state: {f91_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:30,612 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:27:30,612 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:27:30,616 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:27:30,616 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:30,643 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:27:30,643 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:30,687 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 01:27:30,687 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:27:30,692 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 01:27:30,717 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:27:30,717 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:27:30,718 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:27:30,718 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:27:30,718 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 01:27:30,718 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 01:27:30,718 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:27:30,718 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:27:30,718 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 01:27:30,718 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:27:30,718 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:27:30,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:30,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:30,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:30,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:30,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:30,758 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:27:30,758 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 01:27:30,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:27:30,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:27:30,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:27:30,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:27:30,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:27:30,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:27:30,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:27:30,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:27:30,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:27:30,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:27:30,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:27:30,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:27:30,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:27:30,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:27:30,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:27:30,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:27:30,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:27:30,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:27:30,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:27:30,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:27:30,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:27:30,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:27:30,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:27:30,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:27:30,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:27:30,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:27:30,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:27:30,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:27:30,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:27:30,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:27:30,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:27:30,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:27:30,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:27:30,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:27:30,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:27:30,774 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 01:27:30,777 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 01:27:30,777 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 01:27:30,777 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 01:27:30,777 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 01:27:30,777 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 01:27:30,778 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#in~x) = -2*f91_#in~x + 201 Supporting invariants [] [2020-06-22 01:27:30,778 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 01:27:30,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:27:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:27:30,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 01:27:30,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:27:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:27:30,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 01:27:30,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:27:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:27:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:31,020 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 01:27:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:31,033 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 01:27:31,033 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 01:27:31,033 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 7 loop predicates [2020-06-22 01:27:31,033 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 33 transitions. cyclomatic complexity: 9 Second operand 9 states. [2020-06-22 01:27:31,440 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 33 transitions. cyclomatic complexity: 9. Second operand 9 states. Result 377 states and 496 transitions. Complement of second has 174 states. [2020-06-22 01:27:31,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2020-06-22 01:27:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 01:27:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2020-06-22 01:27:31,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 36 transitions. Stem has 10 letters. Loop has 8 letters. [2020-06-22 01:27:31,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:27:31,443 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-06-22 01:27:31,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:27:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:27:31,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 01:27:31,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:27:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:27:31,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 01:27:31,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:27:31,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:27:31,612 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2020-06-22 01:27:31,613 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 33 transitions. cyclomatic complexity: 9 Second operand 9 states. [2020-06-22 01:27:32,001 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 33 transitions. cyclomatic complexity: 9. Second operand 9 states. Result 255 states and 321 transitions. Complement of second has 144 states. [2020-06-22 01:27:32,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2020-06-22 01:27:32,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 01:27:32,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 26 transitions. [2020-06-22 01:27:32,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 26 transitions. Stem has 10 letters. Loop has 8 letters. [2020-06-22 01:27:32,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:27:32,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 26 transitions. Stem has 18 letters. Loop has 8 letters. [2020-06-22 01:27:32,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:27:32,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 26 transitions. Stem has 10 letters. Loop has 16 letters. [2020-06-22 01:27:32,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:27:32,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 255 states and 321 transitions. [2020-06-22 01:27:32,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2020-06-22 01:27:32,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 255 states to 79 states and 120 transitions. [2020-06-22 01:27:32,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-06-22 01:27:32,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-06-22 01:27:32,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 120 transitions. [2020-06-22 01:27:32,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 01:27:32,022 INFO L706 BuchiCegarLoop]: Abstraction has 79 states and 120 transitions. [2020-06-22 01:27:32,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 120 transitions. [2020-06-22 01:27:32,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 31. [2020-06-22 01:27:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 01:27:32,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2020-06-22 01:27:32,030 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-06-22 01:27:32,031 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-06-22 01:27:32,031 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 01:27:32,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2020-06-22 01:27:32,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 01:27:32,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:27:32,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:27:32,033 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 01:27:32,033 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1] [2020-06-22 01:27:32,033 INFO L794 eck$LassoCheckResult]: Stem: 1402#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L26: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_~result~0] 1392#L26 [29] L26-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_1| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{f91_#in~x=|v_f91_#in~xInParam_1|} AuxVars[] AssignedVars[f91_#in~x]< 1393#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 1418#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 1397#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 1417#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 1420#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 1421#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1413#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 1399#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 1403#f91ENTRY [2020-06-22 01:27:32,034 INFO L796 eck$LassoCheckResult]: Loop: 1403#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 1410#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 1396#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 1405#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 1410#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 1396#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 1405#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 1412#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 1408#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1409#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 1395#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 1404#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 1414#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 1406#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1407#f91EXIT >[44] f91EXIT-->L19-2: AOR: Formula: (= |v_f91_#t~ret1_4| |v_f91_#resOutParam_3|) InVars {f91_#res=|v_f91_#resOutParam_3|} OutVars{f91_#t~ret1=|v_f91_#t~ret1_4|} AuxVars[] AssignedVars[f91_#t~ret1] LVA: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x] 1394#L19-2 [30] L19-2-->f91FINAL: Formula: (= |v_f91_#res_2| |v_f91_#t~ret1_3|) InVars {f91_#t~ret1=|v_f91_#t~ret1_3|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_3|, f91_#t~ret1=|v_f91_#t~ret1_2|, f91_#res=|v_f91_#res_2|} AuxVars[] AssignedVars[f91_#t~ret0, f91_#t~ret1, f91_#res] 1401#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1416#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 1400#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 1403#f91ENTRY [2020-06-22 01:27:32,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:27:32,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1787708875, now seen corresponding path program 5 times [2020-06-22 01:27:32,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:27:32,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:27:32,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:32,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 01:27:32,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:32,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:27:32,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2105170838, now seen corresponding path program 1 times [2020-06-22 01:27:32,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:27:32,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:27:32,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:32,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 01:27:32,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:32,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:27:32,061 INFO L82 PathProgramCache]: Analyzing trace with hash 185199842, now seen corresponding path program 1 times [2020-06-22 01:27:32,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:27:32,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:27:32,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:32,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:27:32,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:27:32,137 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-06-22 01:27:32,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 01:27:32,140 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 01:27:32,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:27:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:27:32,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 01:27:32,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:27:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-06-22 01:27:32,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 01:27:32,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-06-22 01:27:32,376 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:27:32,376 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:27:32,376 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:27:32,376 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:27:32,376 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 01:27:32,376 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:32,376 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:27:32,376 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:27:32,377 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 01:27:32,377 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:27:32,377 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:27:32,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:32,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:32,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:32,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-06-22 01:27:32,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-06-22 01:27:32,419 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:27:32,419 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:32,423 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:27:32,423 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:27:32,453 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 01:27:32,453 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:27:32,458 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 01:27:32,483 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:27:32,484 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:27:32,484 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:27:32,484 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:27:32,484 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 01:27:32,484 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 01:27:32,484 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:27:32,484 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:27:32,484 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 01:27:32,484 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:27:32,485 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:27:32,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:32,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:32,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:32,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:32,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:27:32,519 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:27:32,520 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 01:27:32,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:27:32,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:27:32,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:27:32,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:27:32,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:27:32,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:27:32,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:27:32,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:27:32,525 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 01:27:32,528 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 01:27:32,529 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 01:27:32,529 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 01:27:32,529 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 01:27:32,529 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 01:27:32,529 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#in~x) = -1*f91_#in~x + 90 Supporting invariants [] [2020-06-22 01:27:32,530 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 01:27:32,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:27:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:27:32,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 01:27:32,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:27:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:27:32,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjunts are in the unsatisfiable core [2020-06-22 01:27:32,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:27:32,750 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-06-22 01:27:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:32,934 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 01:27:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:27:32,961 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 01:27:32,961 INFO L98 LoopCannibalizer]: 12 predicates before loop cannibalization 12 predicates after loop cannibalization [2020-06-22 01:27:32,961 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 12 loop predicates [2020-06-22 01:27:32,961 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 31 states and 40 transitions. cyclomatic complexity: 11 Second operand 12 states. [2020-06-22 01:27:35,065 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 31 states and 40 transitions. cyclomatic complexity: 11. Second operand 12 states. Result 6173 states and 9271 transitions. Complement of second has 4264 states. [2020-06-22 01:27:35,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 28 states 2 stem states 25 non-accepting loop states 1 accepting loop states [2020-06-22 01:27:35,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 01:27:35,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 65 transitions. [2020-06-22 01:27:35,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 65 transitions. Stem has 10 letters. Loop has 19 letters. [2020-06-22 01:27:35,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:27:35,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 65 transitions. Stem has 29 letters. Loop has 19 letters. [2020-06-22 01:27:35,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:27:35,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 65 transitions. Stem has 10 letters. Loop has 38 letters. [2020-06-22 01:27:35,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:27:35,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6173 states and 9271 transitions. [2020-06-22 01:27:35,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 114 [2020-06-22 01:27:35,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6173 states to 778 states and 1216 transitions. [2020-06-22 01:27:35,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 269 [2020-06-22 01:27:35,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 284 [2020-06-22 01:27:35,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 778 states and 1216 transitions. [2020-06-22 01:27:35,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 01:27:35,227 INFO L706 BuchiCegarLoop]: Abstraction has 778 states and 1216 transitions. [2020-06-22 01:27:35,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states and 1216 transitions. [2020-06-22 01:27:35,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 669. [2020-06-22 01:27:35,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2020-06-22 01:27:35,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 951 transitions. [2020-06-22 01:27:35,294 INFO L729 BuchiCegarLoop]: Abstraction has 669 states and 951 transitions. [2020-06-22 01:27:35,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 01:27:35,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-06-22 01:27:35,300 INFO L87 Difference]: Start difference. First operand 669 states and 951 transitions. Second operand 8 states. [2020-06-22 01:27:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:27:35,520 INFO L93 Difference]: Finished difference Result 664 states and 892 transitions. [2020-06-22 01:27:35,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 01:27:35,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 664 states and 892 transitions. [2020-06-22 01:27:35,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2020-06-22 01:27:35,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 664 states to 513 states and 695 transitions. [2020-06-22 01:27:35,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2020-06-22 01:27:35,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2020-06-22 01:27:35,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 513 states and 695 transitions. [2020-06-22 01:27:35,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 01:27:35,543 INFO L706 BuchiCegarLoop]: Abstraction has 513 states and 695 transitions. [2020-06-22 01:27:35,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states and 695 transitions. [2020-06-22 01:27:35,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 445. [2020-06-22 01:27:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-06-22 01:27:35,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 579 transitions. [2020-06-22 01:27:35,564 INFO L729 BuchiCegarLoop]: Abstraction has 445 states and 579 transitions. [2020-06-22 01:27:35,564 INFO L609 BuchiCegarLoop]: Abstraction has 445 states and 579 transitions. [2020-06-22 01:27:35,564 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 01:27:35,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 445 states and 579 transitions. [2020-06-22 01:27:35,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2020-06-22 01:27:35,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:27:35,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:27:35,571 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [13, 8, 8, 7, 5, 5, 5, 3, 3, 1, 1] [2020-06-22 01:27:35,571 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 5, 4, 4, 3, 3, 3, 2, 2] [2020-06-22 01:27:35,572 INFO L794 eck$LassoCheckResult]: Stem: 13480#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L26: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_~result~0] 13478#L26 [29] L26-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_1| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{f91_#in~x=|v_f91_#in~xInParam_1|} AuxVars[] AssignedVars[f91_#in~x]< 13479#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13496#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13519#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13520#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13521#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13522#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13520#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13521#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13522#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13520#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13523#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 13574#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13573#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 13512#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 13511#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13513#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 13628#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13625#f91EXIT >[44] f91EXIT-->L19-2: AOR: Formula: (= |v_f91_#t~ret1_4| |v_f91_#resOutParam_3|) InVars {f91_#res=|v_f91_#resOutParam_3|} OutVars{f91_#t~ret1=|v_f91_#t~ret1_4|} AuxVars[] AssignedVars[f91_#t~ret1] LVA: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x] 13624#L19-2 [30] L19-2-->f91FINAL: Formula: (= |v_f91_#res_2| |v_f91_#t~ret1_3|) InVars {f91_#t~ret1=|v_f91_#t~ret1_3|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_3|, f91_#t~ret1=|v_f91_#t~ret1_2|, f91_#res=|v_f91_#res_2|} AuxVars[] AssignedVars[f91_#t~ret0, f91_#t~ret1, f91_#res] 13623#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13619#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 13620#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 13627#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13655#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13693#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13694#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13716#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13712#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13713#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13718#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13711#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13713#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13717#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 13715#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13710#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 13706#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 13709#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13735#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 13730#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13705#f91EXIT >[44] f91EXIT-->L19-2: AOR: Formula: (= |v_f91_#t~ret1_4| |v_f91_#resOutParam_3|) InVars {f91_#res=|v_f91_#resOutParam_3|} OutVars{f91_#t~ret1=|v_f91_#t~ret1_4|} AuxVars[] AssignedVars[f91_#t~ret1] LVA: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x] 13708#L19-2 [30] L19-2-->f91FINAL: Formula: (= |v_f91_#res_2| |v_f91_#t~ret1_3|) InVars {f91_#t~ret1=|v_f91_#t~ret1_3|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_3|, f91_#t~ret1=|v_f91_#t~ret1_2|, f91_#res=|v_f91_#res_2|} AuxVars[] AssignedVars[f91_#t~ret0, f91_#t~ret1, f91_#res] 13725#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13723#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 13720#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 13722#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13849#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 13848#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13719#f91EXIT >[44] f91EXIT-->L19-2: AOR: Formula: (= |v_f91_#t~ret1_4| |v_f91_#resOutParam_3|) InVars {f91_#res=|v_f91_#resOutParam_3|} OutVars{f91_#t~ret1=|v_f91_#t~ret1_4|} AuxVars[] AssignedVars[f91_#t~ret1] LVA: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x] 13688#L19-2 [30] L19-2-->f91FINAL: Formula: (= |v_f91_#res_2| |v_f91_#t~ret1_3|) InVars {f91_#t~ret1=|v_f91_#t~ret1_3|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_3|, f91_#t~ret1=|v_f91_#t~ret1_2|, f91_#res=|v_f91_#res_2|} AuxVars[] AssignedVars[f91_#t~ret0, f91_#t~ret1, f91_#res] 13714#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13695#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 13677#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 13691#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13782#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13539#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13815#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13825#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13548#L19 [2020-06-22 01:27:35,573 INFO L796 eck$LassoCheckResult]: Loop: 13548#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13547#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13550#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13549#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13547#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13550#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13549#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13547#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13551#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 13593#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13591#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 13592#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 13590#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13861#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 13835#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13828#f91EXIT >[44] f91EXIT-->L19-2: AOR: Formula: (= |v_f91_#t~ret1_4| |v_f91_#resOutParam_3|) InVars {f91_#res=|v_f91_#resOutParam_3|} OutVars{f91_#t~ret1=|v_f91_#t~ret1_4|} AuxVars[] AssignedVars[f91_#t~ret1] LVA: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x] 13827#L19-2 [30] L19-2-->f91FINAL: Formula: (= |v_f91_#res_2| |v_f91_#t~ret1_3|) InVars {f91_#t~ret1=|v_f91_#t~ret1_3|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_3|, f91_#t~ret1=|v_f91_#t~ret1_2|, f91_#res=|v_f91_#res_2|} AuxVars[] AssignedVars[f91_#t~ret0, f91_#t~ret1, f91_#res] 13824#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13822#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 13819#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 13821#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13892#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 13852#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13818#f91EXIT >[44] f91EXIT-->L19-2: AOR: Formula: (= |v_f91_#t~ret1_4| |v_f91_#resOutParam_3|) InVars {f91_#res=|v_f91_#resOutParam_3|} OutVars{f91_#t~ret1=|v_f91_#t~ret1_4|} AuxVars[] AssignedVars[f91_#t~ret1] LVA: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x] 13799#L19-2 [30] L19-2-->f91FINAL: Formula: (= |v_f91_#res_2| |v_f91_#t~ret1_3|) InVars {f91_#t~ret1=|v_f91_#t~ret1_3|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_3|, f91_#t~ret1=|v_f91_#t~ret1_2|, f91_#res=|v_f91_#res_2|} AuxVars[] AssignedVars[f91_#t~ret0, f91_#t~ret1, f91_#res] 13826#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13823#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 13560#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 13482#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13568#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13538#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13815#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13825#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13548#L19 [2020-06-22 01:27:35,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:27:35,574 INFO L82 PathProgramCache]: Analyzing trace with hash 882491387, now seen corresponding path program 2 times [2020-06-22 01:27:35,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:27:35,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:27:35,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:35,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:27:35,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:27:35,673 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2020-06-22 01:27:35,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:27:35,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 01:27:35,674 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 01:27:35,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:27:35,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1128724048, now seen corresponding path program 2 times [2020-06-22 01:27:35,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:27:35,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:27:35,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:35,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 01:27:35,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:27:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:27:35,743 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-06-22 01:27:35,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:27:35,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 01:27:35,744 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 01:27:35,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 01:27:35,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-06-22 01:27:35,744 INFO L87 Difference]: Start difference. First operand 445 states and 579 transitions. cyclomatic complexity: 144 Second operand 9 states. [2020-06-22 01:27:35,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:27:35,908 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2020-06-22 01:27:35,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-06-22 01:27:35,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 74 transitions. [2020-06-22 01:27:35,911 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 01:27:35,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 0 states and 0 transitions. [2020-06-22 01:27:35,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 01:27:35,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 01:27:35,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 01:27:35,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 01:27:35,912 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 01:27:35,912 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 01:27:35,912 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 01:27:35,913 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 01:27:35,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 01:27:35,913 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 01:27:35,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 01:27:35,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 01:27:35 BasicIcfg [2020-06-22 01:27:35,919 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 01:27:35,920 INFO L168 Benchmark]: Toolchain (without parser) took 8033.93 ms. Allocated memory was 649.6 MB in the beginning and 843.1 MB in the end (delta: 193.5 MB). Free memory was 565.3 MB in the beginning and 583.6 MB in the end (delta: -18.3 MB). Peak memory consumption was 175.2 MB. Max. memory is 50.3 GB. [2020-06-22 01:27:35,922 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 586.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 01:27:35,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.49 ms. Allocated memory was 649.6 MB in the beginning and 684.7 MB in the end (delta: 35.1 MB). Free memory was 565.3 MB in the beginning and 651.3 MB in the end (delta: -85.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. [2020-06-22 01:27:35,923 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.57 ms. Allocated memory is still 684.7 MB. Free memory was 651.3 MB in the beginning and 648.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 01:27:35,923 INFO L168 Benchmark]: Boogie Preprocessor took 17.66 ms. Allocated memory is still 684.7 MB. Free memory is still 648.6 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 01:27:35,924 INFO L168 Benchmark]: RCFGBuilder took 204.58 ms. Allocated memory is still 684.7 MB. Free memory was 648.6 MB in the beginning and 632.5 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 50.3 GB. [2020-06-22 01:27:35,924 INFO L168 Benchmark]: BlockEncodingV2 took 77.66 ms. Allocated memory is still 684.7 MB. Free memory was 632.5 MB in the beginning and 626.1 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. [2020-06-22 01:27:35,925 INFO L168 Benchmark]: TraceAbstraction took 166.67 ms. Allocated memory is still 684.7 MB. Free memory was 626.1 MB in the beginning and 615.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 01:27:35,925 INFO L168 Benchmark]: BuchiAutomizer took 7243.11 ms. Allocated memory was 684.7 MB in the beginning and 843.1 MB in the end (delta: 158.3 MB). Free memory was 615.3 MB in the beginning and 583.6 MB in the end (delta: 31.7 MB). Peak memory consumption was 190.0 MB. Max. memory is 50.3 GB. [2020-06-22 01:27:35,929 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 15 locations, 18 edges - StatisticsResult: Encoded RCFG 9 locations, 11 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 586.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 285.49 ms. Allocated memory was 649.6 MB in the beginning and 684.7 MB in the end (delta: 35.1 MB). Free memory was 565.3 MB in the beginning and 651.3 MB in the end (delta: -85.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 33.57 ms. Allocated memory is still 684.7 MB. Free memory was 651.3 MB in the beginning and 648.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 17.66 ms. Allocated memory is still 684.7 MB. Free memory is still 648.6 MB. There was no memory consumed. Max. memory is 50.3 GB. * RCFGBuilder took 204.58 ms. Allocated memory is still 684.7 MB. Free memory was 648.6 MB in the beginning and 632.5 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 77.66 ms. Allocated memory is still 684.7 MB. Free memory was 632.5 MB in the beginning and 626.1 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 166.67 ms. Allocated memory is still 684.7 MB. Free memory was 626.1 MB in the beginning and 615.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 7243.11 ms. Allocated memory was 684.7 MB in the beginning and 843.1 MB in the end (delta: 158.3 MB). Free memory was 615.3 MB in the beginning and 583.6 MB in the end (delta: 31.7 MB). Peak memory consumption was 190.0 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 9 locations, 0 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 4 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function -2 * \old(x) + 211 and consists of 5 locations. One nondeterministic module has affine ranking function -2 * \old(x) + 211 and consists of 6 locations. One nondeterministic module has affine ranking function -2 * \old(x) + 201 and consists of 11 locations. One nondeterministic module has affine ranking function -1 * \old(x) + 90 and consists of 28 locations. 2 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.2s and 6 iterations. TraceHistogramMax:13. Analysis of lassos took 1.9s. Construction of modules took 0.7s. Büchi inclusion checks took 4.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 231 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 445 states and ocurred in iteration 4. Nontrivial modules had stage [3, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/22 HoareTripleCheckerStatistics: 98 SDtfs, 175 SDslu, 148 SDs, 0 SdLazy, 684 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf94 smp100 dnf100 smp100 tf112 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 01:27:24.611 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 01:27:36.165 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check