./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4073cc5fe0afdc3910807054eaaf7f0047f472ba2d7a571a291a999e2fa35b78 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-02 22:08:57,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 22:08:57,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 22:08:57,405 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 22:08:57,406 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 22:08:57,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 22:08:57,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 22:08:57,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 22:08:57,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 22:08:57,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 22:08:57,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 22:08:57,419 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 22:08:57,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 22:08:57,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 22:08:57,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 22:08:57,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 22:08:57,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 22:08:57,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 22:08:57,430 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 22:08:57,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 22:08:57,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 22:08:57,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 22:08:57,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 22:08:57,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 22:08:57,452 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 22:08:57,452 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 22:08:57,453 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 22:08:57,454 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 22:08:57,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 22:08:57,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 22:08:57,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 22:08:57,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 22:08:57,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 22:08:57,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 22:08:57,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 22:08:57,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 22:08:57,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 22:08:57,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 22:08:57,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 22:08:57,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 22:08:57,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 22:08:57,483 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-11-02 22:08:57,551 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 22:08:57,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 22:08:57,561 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 22:08:57,562 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 22:08:57,563 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 22:08:57,564 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 22:08:57,564 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 22:08:57,565 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-02 22:08:57,565 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-02 22:08:57,565 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-02 22:08:57,567 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-02 22:08:57,567 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-02 22:08:57,567 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-02 22:08:57,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 22:08:57,568 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-02 22:08:57,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 22:08:57,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 22:08:57,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-02 22:08:57,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-02 22:08:57,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-02 22:08:57,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 22:08:57,570 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-02 22:08:57,570 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 22:08:57,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-02 22:08:57,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 22:08:57,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 22:08:57,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 22:08:57,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 22:08:57,574 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 22:08:57,576 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-02 22:08:57,576 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4073cc5fe0afdc3910807054eaaf7f0047f472ba2d7a571a291a999e2fa35b78 [2021-11-02 22:08:57,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 22:08:57,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 22:08:57,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 22:08:57,964 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 22:08:57,966 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 22:08:57,967 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i [2021-11-02 22:08:58,066 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/data/8fb551a4b/c0f5c7777e784915bd7317812822fd5c/FLAGabb80d46f [2021-11-02 22:08:58,572 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 22:08:58,573 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i [2021-11-02 22:08:58,593 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/data/8fb551a4b/c0f5c7777e784915bd7317812822fd5c/FLAGabb80d46f [2021-11-02 22:08:58,910 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/data/8fb551a4b/c0f5c7777e784915bd7317812822fd5c [2021-11-02 22:08:58,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 22:08:58,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 22:08:58,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 22:08:58,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 22:08:58,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 22:08:58,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:08:58" (1/1) ... [2021-11-02 22:08:58,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3404df17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:58, skipping insertion in model container [2021-11-02 22:08:58,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:08:58" (1/1) ... [2021-11-02 22:08:58,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 22:08:58,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 22:08:59,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:08:59,360 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 22:08:59,445 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:08:59,491 INFO L208 MainTranslator]: Completed translation [2021-11-02 22:08:59,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:59 WrapperNode [2021-11-02 22:08:59,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 22:08:59,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 22:08:59,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 22:08:59,494 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 22:08:59,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:59" (1/1) ... [2021-11-02 22:08:59,521 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:59" (1/1) ... [2021-11-02 22:08:59,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 22:08:59,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 22:08:59,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 22:08:59,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 22:08:59,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:59" (1/1) ... [2021-11-02 22:08:59,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:59" (1/1) ... [2021-11-02 22:08:59,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:59" (1/1) ... [2021-11-02 22:08:59,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:59" (1/1) ... [2021-11-02 22:08:59,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:59" (1/1) ... [2021-11-02 22:08:59,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:59" (1/1) ... [2021-11-02 22:08:59,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:59" (1/1) ... [2021-11-02 22:08:59,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 22:08:59,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 22:08:59,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 22:08:59,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 22:08:59,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:59" (1/1) ... [2021-11-02 22:08:59,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:08:59,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:08:59,664 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:08:59,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-02 22:08:59,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 22:08:59,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 22:08:59,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 22:08:59,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 22:08:59,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 22:08:59,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 22:09:00,115 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 22:09:00,115 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-11-02 22:09:00,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:09:00 BoogieIcfgContainer [2021-11-02 22:09:00,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 22:09:00,123 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-02 22:09:00,123 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-02 22:09:00,127 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-02 22:09:00,128 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-02 22:09:00,129 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.11 10:08:58" (1/3) ... [2021-11-02 22:09:00,131 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64f340f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 10:09:00, skipping insertion in model container [2021-11-02 22:09:00,131 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-02 22:09:00,131 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:08:59" (2/3) ... [2021-11-02 22:09:00,131 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64f340f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 10:09:00, skipping insertion in model container [2021-11-02 22:09:00,132 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-02 22:09:00,132 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:09:00" (3/3) ... [2021-11-02 22:09:00,134 INFO L389 chiAutomizerObserver]: Analyzing ICFG lis-alloca-2.i [2021-11-02 22:09:00,187 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-02 22:09:00,187 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-02 22:09:00,187 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-02 22:09:00,187 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-02 22:09:00,187 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-02 22:09:00,188 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-02 22:09:00,188 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-02 22:09:00,188 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-02 22:09:00,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:00,228 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-11-02 22:09:00,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:09:00,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:09:00,235 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-11-02 22:09:00,235 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-02 22:09:00,235 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-02 22:09:00,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:00,238 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-11-02 22:09:00,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:09:00,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:09:00,239 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-11-02 22:09:00,239 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-02 22:09:00,247 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 16#L-1true havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 5#L565true assume !(main_~array_size~0 < 1); 20#L565-2true call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 7#L552-3true [2021-11-02 22:09:00,248 INFO L793 eck$LassoCheckResult]: Loop: 7#L552-3true assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 18#L552-2true lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7#L552-3true [2021-11-02 22:09:00,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:00,255 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-11-02 22:09:00,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:00,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285978710] [2021-11-02 22:09:00,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:00,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:00,371 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:00,424 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:00,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:00,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2021-11-02 22:09:00,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:00,452 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349637189] [2021-11-02 22:09:00,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:00,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:00,465 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:00,476 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:00,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:00,478 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2021-11-02 22:09:00,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:00,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113600593] [2021-11-02 22:09:00,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:00,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:00,565 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:00,622 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:01,603 INFO L210 LassoAnalysis]: Preferences: [2021-11-02 22:09:01,604 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-02 22:09:01,604 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-02 22:09:01,604 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-02 22:09:01,604 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-02 22:09:01,605 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:01,605 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-02 22:09:01,605 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-02 22:09:01,605 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration1_Lasso [2021-11-02 22:09:01,605 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-02 22:09:01,606 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-02 22:09:01,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:01,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:01,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:02,616 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-02 22:09:02,623 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-02 22:09:02,625 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:02,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:02,627 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:02,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:02,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:02,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:09:02,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-11-02 22:09:02,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:02,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:02,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:02,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:09:02,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:09:02,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:02,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:02,699 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:02,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:02,702 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:02,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:02,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:02,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:02,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:02,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:02,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:02,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:02,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-11-02 22:09:02,750 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:02,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:02,789 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:02,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:02,791 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:02,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:02,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-11-02 22:09:02,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:02,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:09:02,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:02,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:02,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:02,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:09:02,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:09:02,826 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:02,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:02,862 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:02,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:02,864 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:02,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:02,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:02,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:02,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:02,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:02,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-11-02 22:09:02,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:02,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:02,894 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:02,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:02,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:02,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:02,934 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:02,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:02,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:02,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:02,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:02,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:02,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:02,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:02,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-11-02 22:09:03,006 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-02 22:09:03,065 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-11-02 22:09:03,065 INFO L444 ModelExtractionUtils]: 18 out of 43 variables were initially zero. Simplification set additionally 21 variables to zero. [2021-11-02 22:09:03,066 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:03,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:03,068 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:03,102 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-02 22:09:03,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-11-02 22:09:03,118 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-11-02 22:09:03,119 INFO L513 LassoAnalysis]: Proved termination. [2021-11-02 22:09:03,119 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_lis_#t~malloc3.base)_1, ULTIMATE.start_lis_~i~0) = 1*v_rep(select #length ULTIMATE.start_lis_#t~malloc3.base)_1 - 4*ULTIMATE.start_lis_~i~0 Supporting invariants [1*ULTIMATE.start_lis_~prev~0.offset >= 0] [2021-11-02 22:09:03,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:03,226 INFO L297 tatePredicateManager]: 15 out of 17 supporting invariants were superfluous and have been removed [2021-11-02 22:09:03,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:03,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:03,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-02 22:09:03,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:03,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 22:09:03,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:03,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:09:03,399 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-11-02 22:09:03,401 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:03,464 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 64 transitions. Complement of second has 8 states. [2021-11-02 22:09:03,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-11-02 22:09:03,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:03,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2021-11-02 22:09:03,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 2 letters. [2021-11-02 22:09:03,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:09:03,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 2 letters. [2021-11-02 22:09:03,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:09:03,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 4 letters. [2021-11-02 22:09:03,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:09:03,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 64 transitions. [2021-11-02 22:09:03,487 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-11-02 22:09:03,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 18 states and 28 transitions. [2021-11-02 22:09:03,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-11-02 22:09:03,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-11-02 22:09:03,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 28 transitions. [2021-11-02 22:09:03,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:09:03,495 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2021-11-02 22:09:03,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 28 transitions. [2021-11-02 22:09:03,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-11-02 22:09:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:03,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2021-11-02 22:09:03,518 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2021-11-02 22:09:03,518 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2021-11-02 22:09:03,518 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-02 22:09:03,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2021-11-02 22:09:03,519 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-11-02 22:09:03,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:09:03,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:09:03,520 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-11-02 22:09:03,520 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-02 22:09:03,520 INFO L791 eck$LassoCheckResult]: Stem: 184#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 185#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 182#L565 assume !(main_~array_size~0 < 1); 183#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 186#L552-3 assume !(lis_~i~0 < lis_~N); 188#L552-4 lis_~i~0 := 1; 190#L554-3 [2021-11-02 22:09:03,520 INFO L793 eck$LassoCheckResult]: Loop: 190#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 191#L555-3 assume !(lis_~j~0 < lis_~i~0); 192#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 190#L554-3 [2021-11-02 22:09:03,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:03,521 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2021-11-02 22:09:03,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:03,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910513303] [2021-11-02 22:09:03,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:03,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:09:03,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:09:03,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910513303] [2021-11-02 22:09:03,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910513303] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:09:03,600 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:09:03,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:09:03,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376508570] [2021-11-02 22:09:03,603 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-02 22:09:03,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:03,604 INFO L85 PathProgramCache]: Analyzing trace with hash 60785, now seen corresponding path program 1 times [2021-11-02 22:09:03,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:03,604 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517314154] [2021-11-02 22:09:03,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:03,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:03,610 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:03,613 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:03,633 INFO L210 LassoAnalysis]: Preferences: [2021-11-02 22:09:03,633 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-02 22:09:03,633 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-02 22:09:03,633 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-02 22:09:03,634 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-11-02 22:09:03,634 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:03,634 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-02 22:09:03,634 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-02 22:09:03,634 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration2_Loop [2021-11-02 22:09:03,634 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-02 22:09:03,634 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-02 22:09:03,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:03,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:03,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:03,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:03,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:03,706 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-02 22:09:03,706 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-11-02 22:09:03,708 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:03,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:03,718 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:03,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-11-02 22:09:03,787 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-02 22:09:03,787 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-02 22:09:03,833 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-02 22:09:03,833 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_2=2} Honda state: {v_rep~unnamed0~0~P_PGID_2=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-11-02 22:09:03,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:03,865 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:03,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:03,869 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:03,874 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-02 22:09:03,874 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-02 22:09:03,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-11-02 22:09:03,894 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-02 22:09:03,894 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_2=1} Honda state: {v_rep~unnamed0~0~P_PID_2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-11-02 22:09:03,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:03,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:03,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:03,933 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:03,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-11-02 22:09:03,940 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-02 22:09:03,940 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-02 22:09:03,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:03,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:03,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:03,998 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:04,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-11-02 22:09:04,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-11-02 22:09:04,009 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-02 22:09:04,164 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-11-02 22:09:04,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:04,167 INFO L210 LassoAnalysis]: Preferences: [2021-11-02 22:09:04,168 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-02 22:09:04,168 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-02 22:09:04,168 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-02 22:09:04,168 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-02 22:09:04,168 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:04,168 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-02 22:09:04,168 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-02 22:09:04,168 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration2_Loop [2021-11-02 22:09:04,168 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-02 22:09:04,168 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-02 22:09:04,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:04,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:04,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:04,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:04,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:04,249 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-02 22:09:04,249 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-02 22:09:04,250 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:04,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:04,251 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:04,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:04,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:04,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:04,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:04,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:04,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:04,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:04,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-11-02 22:09:04,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:04,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:04,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:04,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:04,326 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:04,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:04,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:04,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:04,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:04,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:04,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-11-02 22:09:04,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:04,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:04,358 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:04,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:04,379 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:04,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:04,380 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:04,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-11-02 22:09:04,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:04,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:04,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:09:04,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:04,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:04,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:04,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:09:04,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:09:04,397 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-02 22:09:04,400 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-11-02 22:09:04,400 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-11-02 22:09:04,401 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:04,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:04,401 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:04,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-11-02 22:09:04,403 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-02 22:09:04,403 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-11-02 22:09:04,403 INFO L513 LassoAnalysis]: Proved termination. [2021-11-02 22:09:04,403 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~i~0 + 1 Supporting invariants [] [2021-11-02 22:09:04,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:04,427 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-11-02 22:09:04,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:04,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 22:09:04,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:04,491 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-02 22:09:04,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:04,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:09:04,549 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-11-02 22:09:04,550 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:04,623 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 49 states and 84 transitions. Complement of second has 10 states. [2021-11-02 22:09:04,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-11-02 22:09:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:04,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2021-11-02 22:09:04,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 3 letters. [2021-11-02 22:09:04,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:09:04,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 9 letters. Loop has 3 letters. [2021-11-02 22:09:04,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:09:04,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 6 letters. [2021-11-02 22:09:04,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:09:04,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 84 transitions. [2021-11-02 22:09:04,640 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2021-11-02 22:09:04,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 37 states and 57 transitions. [2021-11-02 22:09:04,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-11-02 22:09:04,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-11-02 22:09:04,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 57 transitions. [2021-11-02 22:09:04,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:09:04,643 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 57 transitions. [2021-11-02 22:09:04,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 57 transitions. [2021-11-02 22:09:04,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2021-11-02 22:09:04,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2021-11-02 22:09:04,649 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 45 transitions. [2021-11-02 22:09:04,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:09:04,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:09:04,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:09:04,683 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:04,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:04,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:09:04,748 INFO L93 Difference]: Finished difference Result 30 states and 45 transitions. [2021-11-02 22:09:04,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:09:04,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 45 transitions. [2021-11-02 22:09:04,751 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-02 22:09:04,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 45 transitions. [2021-11-02 22:09:04,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-11-02 22:09:04,753 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-11-02 22:09:04,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 45 transitions. [2021-11-02 22:09:04,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:09:04,754 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2021-11-02 22:09:04,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 45 transitions. [2021-11-02 22:09:04,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2021-11-02 22:09:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 28 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:04,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2021-11-02 22:09:04,760 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 44 transitions. [2021-11-02 22:09:04,760 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 44 transitions. [2021-11-02 22:09:04,760 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-02 22:09:04,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 44 transitions. [2021-11-02 22:09:04,762 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-02 22:09:04,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:09:04,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:09:04,763 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:09:04,763 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:09:04,763 INFO L791 eck$LassoCheckResult]: Stem: 369#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 370#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 367#L565 assume !(main_~array_size~0 < 1); 368#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 371#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 372#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 373#L552-3 assume !(lis_~i~0 < lis_~N); 374#L552-4 lis_~i~0 := 1; 375#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 376#L555-3 [2021-11-02 22:09:04,764 INFO L793 eck$LassoCheckResult]: Loop: 376#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 377#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 383#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 385#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 387#L555-3 assume !(lis_~j~0 < lis_~i~0); 390#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 391#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 376#L555-3 [2021-11-02 22:09:04,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:04,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2021-11-02 22:09:04,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:04,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601592644] [2021-11-02 22:09:04,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:04,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:09:04,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:09:04,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601592644] [2021-11-02 22:09:04,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601592644] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:09:04,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700401486] [2021-11-02 22:09:04,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:04,836 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:09:04,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:04,837 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:09:04,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-02 22:09:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:04,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-02 22:09:04,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:04,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:09:04,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700401486] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:09:04,945 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:09:04,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-11-02 22:09:04,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100043754] [2021-11-02 22:09:04,946 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-02 22:09:04,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:04,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 1 times [2021-11-02 22:09:04,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:04,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860911921] [2021-11-02 22:09:04,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:04,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:04,961 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:04,977 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:05,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:09:05,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 22:09:05,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:09:05,346 INFO L87 Difference]: Start difference. First operand 29 states and 44 transitions. cyclomatic complexity: 19 Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:05,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:09:05,463 INFO L93 Difference]: Finished difference Result 59 states and 84 transitions. [2021-11-02 22:09:05,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 22:09:05,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 84 transitions. [2021-11-02 22:09:05,465 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-11-02 22:09:05,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 51 states and 74 transitions. [2021-11-02 22:09:05,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-11-02 22:09:05,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-11-02 22:09:05,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 74 transitions. [2021-11-02 22:09:05,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:09:05,467 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 74 transitions. [2021-11-02 22:09:05,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 74 transitions. [2021-11-02 22:09:05,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2021-11-02 22:09:05,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:05,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2021-11-02 22:09:05,471 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2021-11-02 22:09:05,471 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2021-11-02 22:09:05,471 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-02 22:09:05,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2021-11-02 22:09:05,472 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-02 22:09:05,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:09:05,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:09:05,472 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:09:05,473 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:09:05,473 INFO L791 eck$LassoCheckResult]: Stem: 496#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 497#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 494#L565 assume !(main_~array_size~0 < 1); 495#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 498#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 499#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 500#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 501#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 524#L552-3 assume !(lis_~i~0 < lis_~N); 502#L552-4 lis_~i~0 := 1; 503#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 504#L555-3 [2021-11-02 22:09:05,473 INFO L793 eck$LassoCheckResult]: Loop: 504#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 505#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 509#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 513#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 515#L555-3 assume !(lis_~j~0 < lis_~i~0); 519#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 520#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 504#L555-3 [2021-11-02 22:09:05,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:05,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2021-11-02 22:09:05,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:05,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080618364] [2021-11-02 22:09:05,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:05,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:05,501 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:05,534 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:05,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:05,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 2 times [2021-11-02 22:09:05,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:05,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143382496] [2021-11-02 22:09:05,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:05,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:05,563 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:05,590 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:05,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:05,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1776402153, now seen corresponding path program 1 times [2021-11-02 22:09:05,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:05,591 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379985894] [2021-11-02 22:09:05,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:05,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:09:05,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:09:05,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379985894] [2021-11-02 22:09:05,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379985894] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:09:05,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140941413] [2021-11-02 22:09:05,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:05,697 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:09:05,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:05,698 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:09:05,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-02 22:09:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:05,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 22:09:05,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:05,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:09:05,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140941413] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:09:05,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:09:05,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-11-02 22:09:05,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26316574] [2021-11-02 22:09:06,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:09:06,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 22:09:06,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-11-02 22:09:06,295 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. cyclomatic complexity: 18 Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:06,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:09:06,482 INFO L93 Difference]: Finished difference Result 99 states and 142 transitions. [2021-11-02 22:09:06,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 22:09:06,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 142 transitions. [2021-11-02 22:09:06,484 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2021-11-02 22:09:06,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 79 states and 114 transitions. [2021-11-02 22:09:06,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2021-11-02 22:09:06,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2021-11-02 22:09:06,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 114 transitions. [2021-11-02 22:09:06,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:09:06,486 INFO L681 BuchiCegarLoop]: Abstraction has 79 states and 114 transitions. [2021-11-02 22:09:06,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 114 transitions. [2021-11-02 22:09:06,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 49. [2021-11-02 22:09:06,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 48 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:06,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2021-11-02 22:09:06,491 INFO L704 BuchiCegarLoop]: Abstraction has 49 states and 71 transitions. [2021-11-02 22:09:06,491 INFO L587 BuchiCegarLoop]: Abstraction has 49 states and 71 transitions. [2021-11-02 22:09:06,491 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-02 22:09:06,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 71 transitions. [2021-11-02 22:09:06,491 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2021-11-02 22:09:06,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:09:06,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:09:06,492 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:09:06,492 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-11-02 22:09:06,492 INFO L791 eck$LassoCheckResult]: Stem: 699#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 700#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 697#L565 assume !(main_~array_size~0 < 1); 698#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 701#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 702#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 703#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 704#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 722#L552-3 assume !(lis_~i~0 < lis_~N); 710#L552-4 lis_~i~0 := 1; 711#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 719#L555-3 [2021-11-02 22:09:06,492 INFO L793 eck$LassoCheckResult]: Loop: 719#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 712#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 713#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 717#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 719#L555-3 [2021-11-02 22:09:06,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:06,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 3 times [2021-11-02 22:09:06,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:06,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382609531] [2021-11-02 22:09:06,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:06,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:06,507 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:06,523 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:06,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:06,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 1 times [2021-11-02 22:09:06,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:06,524 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655298640] [2021-11-02 22:09:06,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:06,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:06,536 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:06,554 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:06,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:06,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1166707861, now seen corresponding path program 1 times [2021-11-02 22:09:06,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:06,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224214913] [2021-11-02 22:09:06,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:06,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:06,606 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:06,671 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:07,860 INFO L210 LassoAnalysis]: Preferences: [2021-11-02 22:09:07,860 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-02 22:09:07,860 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-02 22:09:07,860 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-02 22:09:07,861 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-02 22:09:07,861 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:07,861 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-02 22:09:07,861 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-02 22:09:07,861 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration5_Lasso [2021-11-02 22:09:07,861 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-02 22:09:07,861 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-02 22:09:07,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:07,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:07,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:07,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:07,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:07,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:07,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:07,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:07,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:07,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:07,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:07,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:07,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:08,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:08,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:08,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:08,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:08,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:08,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:08,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:08,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:08,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:08,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:09,439 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-02 22:09:09,439 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-02 22:09:09,440 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:09,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:09,443 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:09,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-11-02 22:09:09,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:09,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:09,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:09:09,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:09,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:09,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:09,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:09:09,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:09:09,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:09,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:09,475 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:09,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:09,476 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:09,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-11-02 22:09:09,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:09,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:09,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:09:09,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:09,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:09,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:09,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:09:09,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:09:09,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:09,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:09,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:09,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:09,507 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:09,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-11-02 22:09:09,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:09,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:09,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:09:09,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:09,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:09,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:09,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:09:09,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:09:09,526 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:09,548 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2021-11-02 22:09:09,549 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:09,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:09,550 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:09,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-11-02 22:09:09,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:09,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:09,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:09:09,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:09,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:09,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:09,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:09:09,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:09:09,563 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:09,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:09,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:09,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:09,584 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:09,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-11-02 22:09:09,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:09,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:09,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:09,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:09,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:09,597 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:09,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:09,599 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:09,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:09,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:09,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:09,619 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:09,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-11-02 22:09:09,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:09,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:09,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:09:09,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:09,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:09,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:09,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:09:09,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:09:09,629 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:09,648 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:09,649 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:09,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:09,649 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:09,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-11-02 22:09:09,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:09,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:09,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:09:09,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:09,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:09,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:09,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:09:09,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:09:09,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:09,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-11-02 22:09:09,687 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:09,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:09,688 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:09,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-11-02 22:09:09,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:09,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:09,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:09,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:09,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:09,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:09,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:09,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:09,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-11-02 22:09:09,727 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:09,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:09,729 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:09,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-11-02 22:09:09,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:09,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:09,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:09,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:09,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:09,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:09,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:09,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:09,764 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-11-02 22:09:09,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:09,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:09,767 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:09,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-11-02 22:09:09,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:09,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:09,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:09:09,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:09,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:09,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:09,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:09:09,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:09:09,777 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:09,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:09,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:09,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:09,797 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:09,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-11-02 22:09:09,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:09,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:09,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:09:09,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:09,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:09,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:09,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:09:09,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:09:09,809 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:09,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-11-02 22:09:09,831 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:09,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:09,832 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:09,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-11-02 22:09:09,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:09,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:09,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:09,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:09,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:09,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:09,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:09,848 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:09,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-11-02 22:09:09,867 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:09,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:09,868 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:09,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-11-02 22:09:09,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:09,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:09,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:09,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:09,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:09,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:09,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:09,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:09,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:09,917 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:09,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:09,918 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:09,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-11-02 22:09:09,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:09,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:09,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:09,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:09,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:09,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:09,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:09,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:09,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:09,950 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:09,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:09,951 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:09,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-11-02 22:09:09,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:09,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:09,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:09:09,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:09,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:09,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:09,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:09:09,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:09:09,973 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:09,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:09,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:09,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:09,996 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:09,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-11-02 22:09:09,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:10,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:10,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:10,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:10,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:10,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:10,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:10,064 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-02 22:09:10,183 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2021-11-02 22:09:10,183 INFO L444 ModelExtractionUtils]: 28 out of 67 variables were initially zero. Simplification set additionally 36 variables to zero. [2021-11-02 22:09:10,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:10,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:10,191 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:10,194 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-02 22:09:10,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-11-02 22:09:10,204 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-02 22:09:10,204 INFO L513 LassoAnalysis]: Proved termination. [2021-11-02 22:09:10,204 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0, v_rep(select #length ULTIMATE.start_lis_~best~0.base)_2) = -16*ULTIMATE.start_lis_~j~0 + 1*v_rep(select #length ULTIMATE.start_lis_~best~0.base)_2 Supporting invariants [] [2021-11-02 22:09:10,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-11-02 22:09:10,422 INFO L297 tatePredicateManager]: 40 out of 43 supporting invariants were superfluous and have been removed [2021-11-02 22:09:10,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:10,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-02 22:09:10,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:10,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-02 22:09:10,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:10,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:09:10,821 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2021-11-02 22:09:10,821 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 71 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:10,882 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 71 transitions. cyclomatic complexity: 28. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 88 states and 134 transitions. Complement of second has 11 states. [2021-11-02 22:09:10,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 3 non-accepting loop states 1 accepting loop states [2021-11-02 22:09:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2021-11-02 22:09:10,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 11 letters. Loop has 4 letters. [2021-11-02 22:09:10,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:09:10,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 15 letters. Loop has 4 letters. [2021-11-02 22:09:10,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:09:10,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 11 letters. Loop has 8 letters. [2021-11-02 22:09:10,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:09:10,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 134 transitions. [2021-11-02 22:09:10,888 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2021-11-02 22:09:10,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 79 states and 115 transitions. [2021-11-02 22:09:10,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-11-02 22:09:10,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2021-11-02 22:09:10,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 115 transitions. [2021-11-02 22:09:10,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:09:10,891 INFO L681 BuchiCegarLoop]: Abstraction has 79 states and 115 transitions. [2021-11-02 22:09:10,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 115 transitions. [2021-11-02 22:09:10,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2021-11-02 22:09:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.48) internal successors, (111), 74 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 111 transitions. [2021-11-02 22:09:10,897 INFO L704 BuchiCegarLoop]: Abstraction has 75 states and 111 transitions. [2021-11-02 22:09:10,897 INFO L587 BuchiCegarLoop]: Abstraction has 75 states and 111 transitions. [2021-11-02 22:09:10,897 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-02 22:09:10,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 111 transitions. [2021-11-02 22:09:10,898 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2021-11-02 22:09:10,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:09:10,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:09:10,899 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:09:10,899 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-11-02 22:09:10,899 INFO L791 eck$LassoCheckResult]: Stem: 1092#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1093#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1090#L565 assume !(main_~array_size~0 < 1); 1091#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1094#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1095#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1096#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1097#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1139#L552-3 assume !(lis_~i~0 < lis_~N); 1102#L552-4 lis_~i~0 := 1; 1103#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1121#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1099#L556 [2021-11-02 22:09:10,899 INFO L793 eck$LassoCheckResult]: Loop: 1099#L556 assume !lis_#t~short11; 1110#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 1111#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1098#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1099#L556 [2021-11-02 22:09:10,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:10,900 INFO L85 PathProgramCache]: Analyzing trace with hash -304736135, now seen corresponding path program 1 times [2021-11-02 22:09:10,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:10,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160621601] [2021-11-02 22:09:10,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:10,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:10,913 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:10,935 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:10,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:10,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2284026, now seen corresponding path program 1 times [2021-11-02 22:09:10,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:10,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850719118] [2021-11-02 22:09:10,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:10,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:10,948 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:10,951 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:10,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:10,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1808266866, now seen corresponding path program 1 times [2021-11-02 22:09:10,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:10,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083272515] [2021-11-02 22:09:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:10,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-02 22:09:10,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:09:10,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083272515] [2021-11-02 22:09:10,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083272515] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:09:10,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868820380] [2021-11-02 22:09:10,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:10,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:09:10,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:10,995 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:09:11,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-11-02 22:09:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:11,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-02 22:09:11,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:11,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-02 22:09:11,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868820380] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:09:11,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-02 22:09:11,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2021-11-02 22:09:11,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347230175] [2021-11-02 22:09:11,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:09:11,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 22:09:11,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:09:11,283 INFO L87 Difference]: Start difference. First operand 75 states and 111 transitions. cyclomatic complexity: 46 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:11,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:09:11,344 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2021-11-02 22:09:11,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 22:09:11,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 104 transitions. [2021-11-02 22:09:11,345 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-02 22:09:11,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 61 states and 84 transitions. [2021-11-02 22:09:11,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-11-02 22:09:11,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-11-02 22:09:11,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 84 transitions. [2021-11-02 22:09:11,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:09:11,346 INFO L681 BuchiCegarLoop]: Abstraction has 61 states and 84 transitions. [2021-11-02 22:09:11,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 84 transitions. [2021-11-02 22:09:11,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2021-11-02 22:09:11,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 52 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:11,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2021-11-02 22:09:11,356 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 75 transitions. [2021-11-02 22:09:11,357 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 75 transitions. [2021-11-02 22:09:11,358 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-11-02 22:09:11,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 75 transitions. [2021-11-02 22:09:11,358 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-02 22:09:11,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:09:11,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:09:11,360 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:09:11,360 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:09:11,361 INFO L791 eck$LassoCheckResult]: Stem: 1304#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1305#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1302#L565 assume !(main_~array_size~0 < 1); 1303#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1306#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1307#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1308#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1309#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1329#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1346#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1345#L552-3 assume !(lis_~i~0 < lis_~N); 1315#L552-4 lis_~i~0 := 1; 1316#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1333#L555-3 assume !(lis_~j~0 < lis_~i~0); 1348#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1347#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1336#L555-3 [2021-11-02 22:09:11,361 INFO L793 eck$LassoCheckResult]: Loop: 1336#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1342#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1344#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1343#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1341#L555-3 assume !(lis_~j~0 < lis_~i~0); 1339#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1337#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1336#L555-3 [2021-11-02 22:09:11,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:11,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1270630400, now seen corresponding path program 1 times [2021-11-02 22:09:11,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:11,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235692613] [2021-11-02 22:09:11,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:11,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:11,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-02 22:09:11,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:09:11,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235692613] [2021-11-02 22:09:11,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235692613] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:09:11,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:09:11,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:09:11,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610535512] [2021-11-02 22:09:11,403 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-02 22:09:11,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:11,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 3 times [2021-11-02 22:09:11,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:11,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548380823] [2021-11-02 22:09:11,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:11,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:11,415 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:11,430 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:11,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:09:11,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:09:11,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:09:11,773 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. cyclomatic complexity: 26 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:11,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:09:11,816 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2021-11-02 22:09:11,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:09:11,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 72 transitions. [2021-11-02 22:09:11,817 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-02 22:09:11,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 72 transitions. [2021-11-02 22:09:11,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-11-02 22:09:11,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-11-02 22:09:11,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 72 transitions. [2021-11-02 22:09:11,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:09:11,819 INFO L681 BuchiCegarLoop]: Abstraction has 52 states and 72 transitions. [2021-11-02 22:09:11,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 72 transitions. [2021-11-02 22:09:11,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2021-11-02 22:09:11,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.392156862745098) internal successors, (71), 50 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2021-11-02 22:09:11,823 INFO L704 BuchiCegarLoop]: Abstraction has 51 states and 71 transitions. [2021-11-02 22:09:11,823 INFO L587 BuchiCegarLoop]: Abstraction has 51 states and 71 transitions. [2021-11-02 22:09:11,823 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-11-02 22:09:11,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 71 transitions. [2021-11-02 22:09:11,824 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-02 22:09:11,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:09:11,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:09:11,825 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:09:11,825 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:09:11,825 INFO L791 eck$LassoCheckResult]: Stem: 1416#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1417#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1414#L565 assume !(main_~array_size~0 < 1); 1415#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1418#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1419#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1420#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1421#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1445#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1461#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1460#L552-3 assume !(lis_~i~0 < lis_~N); 1427#L552-4 lis_~i~0 := 1; 1428#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1459#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1458#L556 assume !lis_#t~short11; 1457#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 1456#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1455#L555-3 assume !(lis_~j~0 < lis_~i~0); 1446#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1447#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1422#L555-3 [2021-11-02 22:09:11,826 INFO L793 eck$LassoCheckResult]: Loop: 1422#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1423#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1436#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1437#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1440#L555-3 assume !(lis_~j~0 < lis_~i~0); 1453#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1451#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1422#L555-3 [2021-11-02 22:09:11,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:11,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1523485369, now seen corresponding path program 1 times [2021-11-02 22:09:11,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:11,827 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797782567] [2021-11-02 22:09:11,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:11,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:11,843 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:11,863 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:11,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:11,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 4 times [2021-11-02 22:09:11,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:11,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477396439] [2021-11-02 22:09:11,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:11,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:11,873 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:11,882 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:11,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:11,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1322701164, now seen corresponding path program 1 times [2021-11-02 22:09:11,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:11,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048056421] [2021-11-02 22:09:11,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:11,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:11,936 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-02 22:09:11,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:09:11,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048056421] [2021-11-02 22:09:11,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048056421] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:09:11,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528074810] [2021-11-02 22:09:11,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:11,937 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:09:11,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:11,943 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:09:11,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-11-02 22:09:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:12,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-02 22:09:12,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-02 22:09:12,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528074810] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:09:12,180 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:09:12,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-11-02 22:09:12,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044010166] [2021-11-02 22:09:12,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:09:12,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 22:09:12,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-11-02 22:09:12,504 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. cyclomatic complexity: 24 Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:12,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:09:12,595 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2021-11-02 22:09:12,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 22:09:12,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 89 transitions. [2021-11-02 22:09:12,597 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-11-02 22:09:12,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 41 states and 55 transitions. [2021-11-02 22:09:12,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2021-11-02 22:09:12,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2021-11-02 22:09:12,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 55 transitions. [2021-11-02 22:09:12,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:09:12,598 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 55 transitions. [2021-11-02 22:09:12,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 55 transitions. [2021-11-02 22:09:12,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2021-11-02 22:09:12,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 37 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2021-11-02 22:09:12,601 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2021-11-02 22:09:12,601 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2021-11-02 22:09:12,602 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-11-02 22:09:12,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 50 transitions. [2021-11-02 22:09:12,602 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-11-02 22:09:12,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:09:12,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:09:12,603 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:09:12,603 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2021-11-02 22:09:12,604 INFO L791 eck$LassoCheckResult]: Stem: 1627#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1628#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1625#L565 assume !(main_~array_size~0 < 1); 1626#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1629#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1630#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1631#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1632#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1651#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1648#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1647#L552-3 assume !(lis_~i~0 < lis_~N); 1635#L552-4 lis_~i~0 := 1; 1636#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1661#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1659#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1658#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 1655#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1654#L555-3 assume !(lis_~j~0 < lis_~i~0); 1644#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1645#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1646#L555-3 [2021-11-02 22:09:12,604 INFO L793 eck$LassoCheckResult]: Loop: 1646#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1662#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1640#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1641#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1633#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1634#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1637#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1653#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1652#L555-3 assume !(lis_~j~0 < lis_~i~0); 1650#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1649#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1646#L555-3 [2021-11-02 22:09:12,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:12,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1466227067, now seen corresponding path program 1 times [2021-11-02 22:09:12,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:12,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033171578] [2021-11-02 22:09:12,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:12,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:09:12,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:09:12,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033171578] [2021-11-02 22:09:12,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033171578] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:09:12,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96599092] [2021-11-02 22:09:12,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:12,881 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:09:12,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:12,885 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:09:12,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-11-02 22:09:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:13,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-02 22:09:13,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:13,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-11-02 22:09:13,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2021-11-02 22:09:13,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:09:13,212 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-02 22:09:13,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 43 [2021-11-02 22:09:13,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:09:13,436 INFO L354 Elim1Store]: treesize reduction 394, result has 10.0 percent of original size [2021-11-02 22:09:13,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 79 treesize of output 74 [2021-11-02 22:09:13,733 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [ULTIMATE.start_lis_~i~0] [2021-11-02 22:09:13,733 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-02 22:09:13,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-11-02 22:09:13,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604482475] [2021-11-02 22:09:13,734 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-02 22:09:13,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:13,734 INFO L85 PathProgramCache]: Analyzing trace with hash 178424733, now seen corresponding path program 5 times [2021-11-02 22:09:13,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:13,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758184101] [2021-11-02 22:09:13,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:13,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:13,748 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:13,763 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:14,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:09:14,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 22:09:14,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-11-02 22:09:14,561 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. cyclomatic complexity: 15 Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:14,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:09:14,870 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2021-11-02 22:09:14,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 22:09:14,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 93 transitions. [2021-11-02 22:09:14,871 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2021-11-02 22:09:14,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 93 transitions. [2021-11-02 22:09:14,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2021-11-02 22:09:14,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2021-11-02 22:09:14,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 93 transitions. [2021-11-02 22:09:14,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:09:14,873 INFO L681 BuchiCegarLoop]: Abstraction has 70 states and 93 transitions. [2021-11-02 22:09:14,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 93 transitions. [2021-11-02 22:09:14,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 37. [2021-11-02 22:09:14,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 36 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:14,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2021-11-02 22:09:14,876 INFO L704 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2021-11-02 22:09:14,876 INFO L587 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2021-11-02 22:09:14,876 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-11-02 22:09:14,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2021-11-02 22:09:14,877 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-11-02 22:09:14,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:09:14,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:09:14,878 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:09:14,878 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2021-11-02 22:09:14,878 INFO L791 eck$LassoCheckResult]: Stem: 1795#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1796#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1793#L565 assume !(main_~array_size~0 < 1); 1794#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1797#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1798#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1799#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1800#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1813#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1817#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1816#L552-3 assume !(lis_~i~0 < lis_~N); 1801#L552-4 lis_~i~0 := 1; 1802#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1826#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1827#L556 assume !lis_#t~short11; 1809#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 1810#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1803#L555-3 assume !(lis_~j~0 < lis_~i~0); 1804#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1814#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1815#L555-3 [2021-11-02 22:09:14,878 INFO L793 eck$LassoCheckResult]: Loop: 1815#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1829#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1828#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1825#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1824#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1821#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1823#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1822#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1820#L555-3 assume !(lis_~j~0 < lis_~i~0); 1819#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1818#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1815#L555-3 [2021-11-02 22:09:14,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:14,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1523485369, now seen corresponding path program 2 times [2021-11-02 22:09:14,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:14,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139680980] [2021-11-02 22:09:14,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:14,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:14,892 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:14,908 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:14,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:14,909 INFO L85 PathProgramCache]: Analyzing trace with hash 178424733, now seen corresponding path program 6 times [2021-11-02 22:09:14,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:14,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343723234] [2021-11-02 22:09:14,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:14,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:14,921 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:14,936 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:14,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:14,937 INFO L85 PathProgramCache]: Analyzing trace with hash -840393243, now seen corresponding path program 2 times [2021-11-02 22:09:14,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:14,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391263296] [2021-11-02 22:09:14,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:14,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-02 22:09:15,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:09:15,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391263296] [2021-11-02 22:09:15,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391263296] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:09:15,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43781049] [2021-11-02 22:09:15,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-02 22:09:15,014 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:09:15,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:15,015 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:09:15,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-11-02 22:09:15,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-02 22:09:15,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:09:15,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-02 22:09:15,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-02 22:09:15,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43781049] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:09:15,337 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:09:15,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2021-11-02 22:09:15,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919940006] [2021-11-02 22:09:16,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:09:16,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-02 22:09:16,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-11-02 22:09:16,150 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. cyclomatic complexity: 14 Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:16,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:09:16,371 INFO L93 Difference]: Finished difference Result 107 states and 143 transitions. [2021-11-02 22:09:16,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 22:09:16,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 143 transitions. [2021-11-02 22:09:16,373 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2021-11-02 22:09:16,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 93 states and 125 transitions. [2021-11-02 22:09:16,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2021-11-02 22:09:16,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2021-11-02 22:09:16,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 125 transitions. [2021-11-02 22:09:16,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:09:16,376 INFO L681 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2021-11-02 22:09:16,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 125 transitions. [2021-11-02 22:09:16,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 65. [2021-11-02 22:09:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.323076923076923) internal successors, (86), 64 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:16,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2021-11-02 22:09:16,382 INFO L704 BuchiCegarLoop]: Abstraction has 65 states and 86 transitions. [2021-11-02 22:09:16,382 INFO L587 BuchiCegarLoop]: Abstraction has 65 states and 86 transitions. [2021-11-02 22:09:16,382 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-11-02 22:09:16,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 86 transitions. [2021-11-02 22:09:16,383 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2021-11-02 22:09:16,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:09:16,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:09:16,385 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:09:16,385 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-11-02 22:09:16,385 INFO L791 eck$LassoCheckResult]: Stem: 2056#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2057#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2054#L565 assume !(main_~array_size~0 < 1); 2055#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2058#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2059#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2082#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2084#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2060#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2061#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2072#L552-3 assume !(lis_~i~0 < lis_~N); 2079#L552-4 lis_~i~0 := 1; 2117#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2113#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2114#L556 assume !lis_#t~short11; 2108#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 2105#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2103#L555-3 assume !(lis_~j~0 < lis_~i~0); 2073#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2074#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2064#L555-3 [2021-11-02 22:09:16,385 INFO L793 eck$LassoCheckResult]: Loop: 2064#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2065#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2068#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2069#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2064#L555-3 [2021-11-02 22:09:16,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:16,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1523485369, now seen corresponding path program 3 times [2021-11-02 22:09:16,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:16,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234103529] [2021-11-02 22:09:16,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:16,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:16,401 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:16,421 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:16,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:16,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 2 times [2021-11-02 22:09:16,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:16,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094353458] [2021-11-02 22:09:16,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:16,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:16,434 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:16,442 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:16,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:16,444 INFO L85 PathProgramCache]: Analyzing trace with hash -423959456, now seen corresponding path program 3 times [2021-11-02 22:09:16,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:16,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965570584] [2021-11-02 22:09:16,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:16,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:16,492 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:16,521 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:18,465 INFO L210 LassoAnalysis]: Preferences: [2021-11-02 22:09:18,465 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-02 22:09:18,466 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-02 22:09:18,466 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-02 22:09:18,466 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-02 22:09:18,466 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:18,466 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-02 22:09:18,466 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-02 22:09:18,466 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration11_Lasso [2021-11-02 22:09:18,467 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-02 22:09:18,467 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-02 22:09:18,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:18,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:18,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:18,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:18,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:18,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:18,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:18,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:19,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:19,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:19,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:19,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:19,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:19,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:19,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:19,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:19,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:19,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:19,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:19,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:19,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:19,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:19,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:09:20,442 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-02 22:09:20,442 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-02 22:09:20,442 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:20,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:20,446 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:20,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-11-02 22:09:20,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:20,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:20,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:09:20,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:20,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:20,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:20,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:09:20,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:09:20,473 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:20,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:20,509 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:20,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:20,514 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:20,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:20,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:20,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:20,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:20,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:20,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:20,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:20,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-11-02 22:09:20,542 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:20,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:20,578 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:20,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:20,579 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:20,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:20,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:20,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:09:20,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:20,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:20,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:20,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:09:20,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:09:20,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-11-02 22:09:20,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:20,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:20,634 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:20,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:20,635 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:20,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-11-02 22:09:20,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:20,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:20,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:20,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:20,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:20,645 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:20,645 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:20,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:20,679 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2021-11-02 22:09:20,680 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:20,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:20,681 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:20,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-11-02 22:09:20,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:20,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:20,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:09:20,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:20,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:20,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:20,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:09:20,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:09:20,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:20,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-11-02 22:09:20,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:20,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:20,719 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:20,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-11-02 22:09:20,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:20,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:20,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:09:20,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:20,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:20,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:20,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:09:20,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:09:20,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:20,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-11-02 22:09:20,748 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:20,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:20,749 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:20,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-11-02 22:09:20,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:20,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:20,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:09:20,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:20,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:20,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:20,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:09:20,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:09:20,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:20,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2021-11-02 22:09:20,781 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:20,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:20,782 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:20,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-11-02 22:09:20,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:20,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:20,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:20,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:20,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:20,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:20,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:20,826 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:20,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:20,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:20,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:20,849 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:20,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:20,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-11-02 22:09:20,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:20,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:20,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:20,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:20,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:20,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:20,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:20,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:20,889 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:20,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:20,889 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:20,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-11-02 22:09:20,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:20,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:20,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:20,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:20,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:20,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:20,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:20,902 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:20,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2021-11-02 22:09:20,921 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:20,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:20,922 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:20,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-11-02 22:09:20,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:20,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:20,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:20,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:20,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:20,932 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:20,932 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:20,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:20,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:20,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:20,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:20,969 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:20,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-11-02 22:09:20,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:20,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:20,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:20,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:20,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:20,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:20,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:20,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:21,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2021-11-02 22:09:21,011 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:21,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:21,012 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:21,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-11-02 22:09:21,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:21,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:21,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:21,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:21,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:21,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:21,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:21,032 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:21,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-11-02 22:09:21,052 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:21,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:21,053 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:21,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-11-02 22:09:21,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:21,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:21,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:21,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:21,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:21,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:21,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:21,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:09:21,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2021-11-02 22:09:21,085 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:21,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:21,086 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:21,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:09:21,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-11-02 22:09:21,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:09:21,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:09:21,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:09:21,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:09:21,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:09:21,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:09:21,142 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-02 22:09:21,237 INFO L443 ModelExtractionUtils]: Simplification made 35 calls to the SMT solver. [2021-11-02 22:09:21,237 INFO L444 ModelExtractionUtils]: 23 out of 61 variables were initially zero. Simplification set additionally 35 variables to zero. [2021-11-02 22:09:21,237 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:09:21,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:21,238 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:09:21,239 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-02 22:09:21,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-11-02 22:09:21,247 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-02 22:09:21,248 INFO L513 LassoAnalysis]: Proved termination. [2021-11-02 22:09:21,248 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0) = -2*ULTIMATE.start_lis_~j~0 + 3 Supporting invariants [] [2021-11-02 22:09:21,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2021-11-02 22:09:21,560 INFO L297 tatePredicateManager]: 74 out of 77 supporting invariants were superfluous and have been removed [2021-11-02 22:09:21,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:21,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-02 22:09:21,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:21,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2021-11-02 22:09:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:21,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-02 22:09:21,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:09:22,062 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2021-11-02 22:09:22,062 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 86 transitions. cyclomatic complexity: 26 Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:22,096 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 86 transitions. cyclomatic complexity: 26. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 65 states and 86 transitions. Complement of second has 5 states. [2021-11-02 22:09:22,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2021-11-02 22:09:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2021-11-02 22:09:22,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 20 letters. Loop has 4 letters. [2021-11-02 22:09:22,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:09:22,098 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-11-02 22:09:22,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:22,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-02 22:09:22,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:22,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-02 22:09:22,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:09:22,534 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2021-11-02 22:09:22,534 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 86 transitions. cyclomatic complexity: 26 Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:22,565 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 86 transitions. cyclomatic complexity: 26. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 65 states and 86 transitions. Complement of second has 5 states. [2021-11-02 22:09:22,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2021-11-02 22:09:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:22,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2021-11-02 22:09:22,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 20 letters. Loop has 4 letters. [2021-11-02 22:09:22,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:09:22,566 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-11-02 22:09:22,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:22,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-02 22:09:22,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:23,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-02 22:09:23,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:09:23,167 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2021-11-02 22:09:23,167 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 86 transitions. cyclomatic complexity: 26 Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:23,330 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 86 transitions. cyclomatic complexity: 26. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 79 states and 109 transitions. Complement of second has 12 states. [2021-11-02 22:09:23,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2021-11-02 22:09:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:23,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2021-11-02 22:09:23,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 58 transitions. Stem has 20 letters. Loop has 4 letters. [2021-11-02 22:09:23,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:09:23,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 58 transitions. Stem has 24 letters. Loop has 4 letters. [2021-11-02 22:09:23,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:09:23,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 58 transitions. Stem has 20 letters. Loop has 8 letters. [2021-11-02 22:09:23,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:09:23,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 109 transitions. [2021-11-02 22:09:23,334 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-11-02 22:09:23,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 53 states and 70 transitions. [2021-11-02 22:09:23,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-11-02 22:09:23,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2021-11-02 22:09:23,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 70 transitions. [2021-11-02 22:09:23,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:09:23,336 INFO L681 BuchiCegarLoop]: Abstraction has 53 states and 70 transitions. [2021-11-02 22:09:23,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 70 transitions. [2021-11-02 22:09:23,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2021-11-02 22:09:23,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.32) internal successors, (66), 49 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2021-11-02 22:09:23,339 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 66 transitions. [2021-11-02 22:09:23,339 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 66 transitions. [2021-11-02 22:09:23,339 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-11-02 22:09:23,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 66 transitions. [2021-11-02 22:09:23,340 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-11-02 22:09:23,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:09:23,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:09:23,341 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-02 22:09:23,342 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2021-11-02 22:09:23,342 INFO L791 eck$LassoCheckResult]: Stem: 2925#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2926#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2923#L565 assume !(main_~array_size~0 < 1); 2924#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2927#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2928#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2929#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2930#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2962#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2960#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2958#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2954#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2953#L552-3 assume !(lis_~i~0 < lis_~N); 2931#L552-4 lis_~i~0 := 1; 2932#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2972#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2937#L556 assume !lis_#t~short11; 2938#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 2942#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2945#L555-3 assume !(lis_~j~0 < lis_~i~0); 2949#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2950#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2933#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2934#L556 assume !lis_#t~short11; 2939#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 2969#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2935#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2936#L556 assume !lis_#t~short11; 2943#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 2944#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2946#L555-3 assume !(lis_~j~0 < lis_~i~0); 2968#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2967#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2952#L555-3 [2021-11-02 22:09:23,342 INFO L793 eck$LassoCheckResult]: Loop: 2952#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2966#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2965#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2964#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2963#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2957#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2961#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2959#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2956#L555-3 assume !(lis_~j~0 < lis_~i~0); 2955#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2951#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2952#L555-3 [2021-11-02 22:09:23,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:23,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1144628291, now seen corresponding path program 4 times [2021-11-02 22:09:23,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:23,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375461227] [2021-11-02 22:09:23,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:23,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:23,366 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:23,390 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:23,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:23,391 INFO L85 PathProgramCache]: Analyzing trace with hash 178424733, now seen corresponding path program 7 times [2021-11-02 22:09:23,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:23,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365116663] [2021-11-02 22:09:23,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:23,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:23,404 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:23,415 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:23,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:23,415 INFO L85 PathProgramCache]: Analyzing trace with hash -494466533, now seen corresponding path program 4 times [2021-11-02 22:09:23,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:23,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254692896] [2021-11-02 22:09:23,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:23,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:23,488 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-02 22:09:23,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:09:23,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254692896] [2021-11-02 22:09:23,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254692896] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:09:23,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619703714] [2021-11-02 22:09:23,489 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-02 22:09:23,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:09:23,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:23,490 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:09:23,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2021-11-02 22:09:23,745 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-02 22:09:23,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:09:23,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 22:09:23,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-02 22:09:23,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619703714] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:09:23,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:09:23,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-11-02 22:09:23,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819496586] [2021-11-02 22:09:24,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:09:24,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-02 22:09:24,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-11-02 22:09:24,830 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. cyclomatic complexity: 20 Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:24,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:09:24,972 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2021-11-02 22:09:24,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 22:09:24,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 77 transitions. [2021-11-02 22:09:24,973 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2021-11-02 22:09:24,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 77 transitions. [2021-11-02 22:09:24,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-11-02 22:09:24,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-11-02 22:09:24,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 77 transitions. [2021-11-02 22:09:24,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:09:24,974 INFO L681 BuchiCegarLoop]: Abstraction has 57 states and 77 transitions. [2021-11-02 22:09:24,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 77 transitions. [2021-11-02 22:09:24,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2021-11-02 22:09:24,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 53 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:24,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2021-11-02 22:09:24,978 INFO L704 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2021-11-02 22:09:24,978 INFO L587 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2021-11-02 22:09:24,978 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-11-02 22:09:24,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 72 transitions. [2021-11-02 22:09:24,978 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-11-02 22:09:24,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:09:24,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:09:24,980 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:09:24,980 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1] [2021-11-02 22:09:24,980 INFO L791 eck$LassoCheckResult]: Stem: 3186#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3187#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 3184#L565 assume !(main_~array_size~0 < 1); 3185#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 3188#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3189#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3190#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3191#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3219#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3218#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3217#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3214#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3213#L552-3 assume !(lis_~i~0 < lis_~N); 3192#L552-4 lis_~i~0 := 1; 3193#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3230#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3228#L556 assume !lis_#t~short11; 3225#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3223#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3220#L555-3 assume !(lis_~j~0 < lis_~i~0); 3221#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3232#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3229#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3227#L556 assume !lis_#t~short11; 3224#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 3222#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3196#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3197#L556 assume !lis_#t~short11; 3199#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 3203#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3206#L555-3 assume !(lis_~j~0 < lis_~i~0); 3209#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3210#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3211#L555-3 [2021-11-02 22:09:24,980 INFO L793 eck$LassoCheckResult]: Loop: 3211#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3237#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 3236#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3204#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3205#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3235#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 3233#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3234#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3194#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3195#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 3198#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3202#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3216#L555-3 assume !(lis_~j~0 < lis_~i~0); 3215#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3212#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3211#L555-3 [2021-11-02 22:09:24,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:24,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2129270651, now seen corresponding path program 1 times [2021-11-02 22:09:24,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:24,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221888846] [2021-11-02 22:09:24,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:24,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-02 22:09:25,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:09:25,009 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221888846] [2021-11-02 22:09:25,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221888846] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:09:25,009 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:09:25,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:09:25,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362423020] [2021-11-02 22:09:25,010 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-02 22:09:25,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:25,010 INFO L85 PathProgramCache]: Analyzing trace with hash -335947882, now seen corresponding path program 8 times [2021-11-02 22:09:25,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:25,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847903050] [2021-11-02 22:09:25,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:25,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:25,026 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:25,040 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:27,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:09:27,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:09:27,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:09:27,573 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. cyclomatic complexity: 22 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:27,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:09:27,582 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2021-11-02 22:09:27,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:09:27,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 77 transitions. [2021-11-02 22:09:27,583 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2021-11-02 22:09:27,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 59 states and 76 transitions. [2021-11-02 22:09:27,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-11-02 22:09:27,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-11-02 22:09:27,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 76 transitions. [2021-11-02 22:09:27,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:09:27,584 INFO L681 BuchiCegarLoop]: Abstraction has 59 states and 76 transitions. [2021-11-02 22:09:27,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 76 transitions. [2021-11-02 22:09:27,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-11-02 22:09:27,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 58 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:27,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2021-11-02 22:09:27,588 INFO L704 BuchiCegarLoop]: Abstraction has 59 states and 76 transitions. [2021-11-02 22:09:27,588 INFO L587 BuchiCegarLoop]: Abstraction has 59 states and 76 transitions. [2021-11-02 22:09:27,588 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-11-02 22:09:27,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 76 transitions. [2021-11-02 22:09:27,588 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2021-11-02 22:09:27,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:09:27,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:09:27,590 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:09:27,590 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1] [2021-11-02 22:09:27,590 INFO L791 eck$LassoCheckResult]: Stem: 3306#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3307#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 3304#L565 assume !(main_~array_size~0 < 1); 3305#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 3308#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3309#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3310#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3311#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3348#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3345#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3343#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3339#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3338#L552-3 assume !(lis_~i~0 < lis_~N); 3312#L552-4 lis_~i~0 := 1; 3313#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3359#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3357#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 3355#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3327#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3328#L555-3 assume !(lis_~j~0 < lis_~i~0); 3360#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3335#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3314#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3315#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 3321#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 3326#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3316#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3317#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 3361#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 3329#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3330#L555-3 assume !(lis_~j~0 < lis_~i~0); 3333#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3334#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3337#L555-3 [2021-11-02 22:09:27,590 INFO L793 eck$LassoCheckResult]: Loop: 3337#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3318#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 3319#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3325#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3354#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3353#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 3351#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3350#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3349#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3342#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 3346#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3344#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3341#L555-3 assume !(lis_~j~0 < lis_~i~0); 3340#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3336#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3337#L555-3 [2021-11-02 22:09:27,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:27,591 INFO L85 PathProgramCache]: Analyzing trace with hash -205154041, now seen corresponding path program 1 times [2021-11-02 22:09:27,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:27,591 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58729172] [2021-11-02 22:09:27,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:27,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:09:28,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:09:28,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58729172] [2021-11-02 22:09:28,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58729172] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:09:28,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304721455] [2021-11-02 22:09:28,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:28,588 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:09:28,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:28,590 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:09:28,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2021-11-02 22:09:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:28,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-02 22:09:28,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:28,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-11-02 22:09:28,951 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:09:28,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2021-11-02 22:09:29,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:09:29,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:09:29,091 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-02 22:09:29,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 55 [2021-11-02 22:09:29,324 INFO L354 Elim1Store]: treesize reduction 184, result has 20.3 percent of original size [2021-11-02 22:09:29,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 94 [2021-11-02 22:09:29,591 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [ULTIMATE.start_lis_~i~0] [2021-11-02 22:09:29,591 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-02 22:09:29,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2021-11-02 22:09:29,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143024919] [2021-11-02 22:09:29,592 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-02 22:09:29,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:29,592 INFO L85 PathProgramCache]: Analyzing trace with hash -335947882, now seen corresponding path program 9 times [2021-11-02 22:09:29,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:29,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950086691] [2021-11-02 22:09:29,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:29,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:29,607 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:29,620 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:31,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:09:31,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-02 22:09:31,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2021-11-02 22:09:31,529 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. cyclomatic complexity: 21 Second operand has 21 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:33,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:09:33,562 INFO L93 Difference]: Finished difference Result 179 states and 235 transitions. [2021-11-02 22:09:33,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-02 22:09:33,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 235 transitions. [2021-11-02 22:09:33,564 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 31 [2021-11-02 22:09:33,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 156 states and 205 transitions. [2021-11-02 22:09:33,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2021-11-02 22:09:33,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2021-11-02 22:09:33,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 205 transitions. [2021-11-02 22:09:33,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:09:33,567 INFO L681 BuchiCegarLoop]: Abstraction has 156 states and 205 transitions. [2021-11-02 22:09:33,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 205 transitions. [2021-11-02 22:09:33,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 102. [2021-11-02 22:09:33,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.2843137254901962) internal successors, (131), 101 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 131 transitions. [2021-11-02 22:09:33,572 INFO L704 BuchiCegarLoop]: Abstraction has 102 states and 131 transitions. [2021-11-02 22:09:33,572 INFO L587 BuchiCegarLoop]: Abstraction has 102 states and 131 transitions. [2021-11-02 22:09:33,572 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-11-02 22:09:33,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 131 transitions. [2021-11-02 22:09:33,573 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2021-11-02 22:09:33,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:09:33,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:09:33,574 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:09:33,574 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1] [2021-11-02 22:09:33,574 INFO L791 eck$LassoCheckResult]: Stem: 3664#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3665#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 3662#L565 assume !(main_~array_size~0 < 1); 3663#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 3666#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3667#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3668#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3669#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3689#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3719#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3717#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3718#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3698#L552-3 assume !(lis_~i~0 < lis_~N); 3700#L552-4 lis_~i~0 := 1; 3742#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3740#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3739#L556 assume !lis_#t~short11; 3738#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 3737#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3736#L555-3 assume !(lis_~j~0 < lis_~i~0); 3735#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3734#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3733#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3731#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 3732#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3686#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3672#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3673#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 3679#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 3684#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3752#L555-3 assume !(lis_~j~0 < lis_~i~0); 3716#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3715#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3694#L555-3 [2021-11-02 22:09:33,575 INFO L793 eck$LassoCheckResult]: Loop: 3694#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3714#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 3712#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3711#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3710#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3709#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 3707#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3706#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3705#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3697#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 3703#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3701#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3696#L555-3 assume !(lis_~j~0 < lis_~i~0); 3695#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3693#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3694#L555-3 [2021-11-02 22:09:33,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:33,575 INFO L85 PathProgramCache]: Analyzing trace with hash 800338629, now seen corresponding path program 5 times [2021-11-02 22:09:33,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:33,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262435298] [2021-11-02 22:09:33,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:33,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:33,608 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:33,648 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:33,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:33,649 INFO L85 PathProgramCache]: Analyzing trace with hash -335947882, now seen corresponding path program 10 times [2021-11-02 22:09:33,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:33,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015487467] [2021-11-02 22:09:33,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:33,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:33,677 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:33,691 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:33,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:33,691 INFO L85 PathProgramCache]: Analyzing trace with hash 248071250, now seen corresponding path program 6 times [2021-11-02 22:09:33,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:33,692 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711272872] [2021-11-02 22:09:33,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:33,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:33,800 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 34 proven. 50 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-02 22:09:33,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:09:33,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711272872] [2021-11-02 22:09:33,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711272872] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:09:33,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942995391] [2021-11-02 22:09:33,801 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-02 22:09:33,801 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:09:33,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:33,803 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:09:33,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2021-11-02 22:09:34,222 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2021-11-02 22:09:34,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:09:34,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-02 22:09:34,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 68 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-02 22:09:34,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942995391] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:09:34,508 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:09:34,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-11-02 22:09:34,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988673959] [2021-11-02 22:09:36,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:09:36,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-02 22:09:36,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2021-11-02 22:09:36,724 INFO L87 Difference]: Start difference. First operand 102 states and 131 transitions. cyclomatic complexity: 35 Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:36,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:09:36,935 INFO L93 Difference]: Finished difference Result 195 states and 257 transitions. [2021-11-02 22:09:36,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-02 22:09:36,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 257 transitions. [2021-11-02 22:09:36,937 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 41 [2021-11-02 22:09:36,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 178 states and 235 transitions. [2021-11-02 22:09:36,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 133 [2021-11-02 22:09:36,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2021-11-02 22:09:36,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 235 transitions. [2021-11-02 22:09:36,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:09:36,942 INFO L681 BuchiCegarLoop]: Abstraction has 178 states and 235 transitions. [2021-11-02 22:09:36,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 235 transitions. [2021-11-02 22:09:36,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 120. [2021-11-02 22:09:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 120 states have (on average 1.3) internal successors, (156), 119 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 156 transitions. [2021-11-02 22:09:36,948 INFO L704 BuchiCegarLoop]: Abstraction has 120 states and 156 transitions. [2021-11-02 22:09:36,948 INFO L587 BuchiCegarLoop]: Abstraction has 120 states and 156 transitions. [2021-11-02 22:09:36,948 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-11-02 22:09:36,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 156 transitions. [2021-11-02 22:09:36,949 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 31 [2021-11-02 22:09:36,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:09:36,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:09:36,950 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:09:36,950 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-11-02 22:09:36,950 INFO L791 eck$LassoCheckResult]: Stem: 4134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4135#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 4132#L565 assume !(main_~array_size~0 < 1); 4133#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 4136#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4137#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4224#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4157#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4158#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4225#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4138#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4139#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4170#L552-3 assume !(lis_~i~0 < lis_~N); 4144#L552-4 lis_~i~0 := 1; 4145#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4240#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4238#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 4235#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4230#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4231#L555-3 assume !(lis_~j~0 < lis_~i~0); 4249#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4248#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4247#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4246#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 4245#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4154#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4142#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4143#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 4233#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 4229#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4226#L555-3 assume !(lis_~j~0 < lis_~i~0); 4159#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4160#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4140#L555-3 [2021-11-02 22:09:36,951 INFO L793 eck$LassoCheckResult]: Loop: 4140#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4141#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 4148#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4153#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4140#L555-3 [2021-11-02 22:09:36,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:36,951 INFO L85 PathProgramCache]: Analyzing trace with hash -885212411, now seen corresponding path program 2 times [2021-11-02 22:09:36,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:36,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356034019] [2021-11-02 22:09:36,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:36,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:09:37,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:09:37,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356034019] [2021-11-02 22:09:37,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356034019] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:09:37,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877664047] [2021-11-02 22:09:37,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-02 22:09:37,931 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:09:37,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:37,943 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:09:37,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2021-11-02 22:09:38,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-02 22:09:38,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:09:38,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-02 22:09:38,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:38,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-11-02 22:09:38,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:09:38,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 32 [2021-11-02 22:09:38,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:09:38,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:09:38,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:09:38,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:09:38,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:09:38,732 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:09:38,785 INFO L354 Elim1Store]: treesize reduction 291, result has 13.6 percent of original size [2021-11-02 22:09:38,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 88 treesize of output 69 [2021-11-02 22:09:39,056 INFO L354 Elim1Store]: treesize reduction 190, result has 1.6 percent of original size [2021-11-02 22:09:39,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 120 treesize of output 61 [2021-11-02 22:09:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-02 22:09:39,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877664047] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:09:39,081 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:09:39,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 27 [2021-11-02 22:09:39,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116052618] [2021-11-02 22:09:39,082 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-02 22:09:39,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:39,083 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 3 times [2021-11-02 22:09:39,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:39,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393284893] [2021-11-02 22:09:39,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:39,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:39,091 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:39,097 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:39,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:09:39,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-02 22:09:39,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2021-11-02 22:09:39,332 INFO L87 Difference]: Start difference. First operand 120 states and 156 transitions. cyclomatic complexity: 43 Second operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:41,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:09:41,677 INFO L93 Difference]: Finished difference Result 286 states and 379 transitions. [2021-11-02 22:09:41,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-11-02 22:09:41,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 286 states and 379 transitions. [2021-11-02 22:09:41,679 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 93 [2021-11-02 22:09:41,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 286 states to 286 states and 379 transitions. [2021-11-02 22:09:41,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 203 [2021-11-02 22:09:41,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 203 [2021-11-02 22:09:41,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 379 transitions. [2021-11-02 22:09:41,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:09:41,683 INFO L681 BuchiCegarLoop]: Abstraction has 286 states and 379 transitions. [2021-11-02 22:09:41,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 379 transitions. [2021-11-02 22:09:41,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 199. [2021-11-02 22:09:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 199 states have (on average 1.3266331658291457) internal successors, (264), 198 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 264 transitions. [2021-11-02 22:09:41,689 INFO L704 BuchiCegarLoop]: Abstraction has 199 states and 264 transitions. [2021-11-02 22:09:41,690 INFO L587 BuchiCegarLoop]: Abstraction has 199 states and 264 transitions. [2021-11-02 22:09:41,690 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-11-02 22:09:41,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 199 states and 264 transitions. [2021-11-02 22:09:41,691 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 58 [2021-11-02 22:09:41,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:09:41,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:09:41,692 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:09:41,692 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-11-02 22:09:41,693 INFO L791 eck$LassoCheckResult]: Stem: 4740#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4741#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 4738#L565 assume !(main_~array_size~0 < 1); 4739#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 4742#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4743#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4744#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4745#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4766#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4779#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4778#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4776#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4777#L552-3 assume !(lis_~i~0 < lis_~N); 4750#L552-4 lis_~i~0 := 1; 4751#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4910#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4909#L556 assume !lis_#t~short11; 4907#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 4903#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4904#L555-3 assume !(lis_~j~0 < lis_~i~0); 4923#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4922#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4921#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4920#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 4918#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 4917#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4748#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4749#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 4755#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 4911#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4902#L555-3 assume !(lis_~j~0 < lis_~i~0); 4767#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4768#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4762#L555-3 [2021-11-02 22:09:41,693 INFO L793 eck$LassoCheckResult]: Loop: 4762#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4914#L556 assume !lis_#t~short11; 4754#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 4759#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4762#L555-3 [2021-11-02 22:09:41,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:41,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1480396999, now seen corresponding path program 1 times [2021-11-02 22:09:41,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:41,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095697617] [2021-11-02 22:09:41,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:41,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:42,148 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-02 22:09:42,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:09:42,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095697617] [2021-11-02 22:09:42,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095697617] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:09:42,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119806215] [2021-11-02 22:09:42,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:42,149 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:09:42,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:09:42,150 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:09:42,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2021-11-02 22:09:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:09:42,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-02 22:09:42,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:09:42,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-11-02 22:09:42,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2021-11-02 22:09:42,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:09:42,681 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-02 22:09:42,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 55 [2021-11-02 22:09:42,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:09:42,876 INFO L354 Elim1Store]: treesize reduction 432, result has 10.0 percent of original size [2021-11-02 22:09:42,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 83 treesize of output 78 [2021-11-02 22:09:43,147 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [ULTIMATE.start_lis_~i~0] [2021-11-02 22:09:43,147 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-02 22:09:43,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2021-11-02 22:09:43,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378999592] [2021-11-02 22:09:43,148 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-02 22:09:43,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:43,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2129256, now seen corresponding path program 2 times [2021-11-02 22:09:43,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:43,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914143417] [2021-11-02 22:09:43,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:43,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:43,154 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:43,157 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:43,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:09:43,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-02 22:09:43,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2021-11-02 22:09:43,223 INFO L87 Difference]: Start difference. First operand 199 states and 264 transitions. cyclomatic complexity: 76 Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:43,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:09:43,786 INFO L93 Difference]: Finished difference Result 270 states and 361 transitions. [2021-11-02 22:09:43,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-02 22:09:43,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 361 transitions. [2021-11-02 22:09:43,789 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 68 [2021-11-02 22:09:43,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 248 states and 331 transitions. [2021-11-02 22:09:43,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 164 [2021-11-02 22:09:43,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 164 [2021-11-02 22:09:43,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 248 states and 331 transitions. [2021-11-02 22:09:43,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:09:43,793 INFO L681 BuchiCegarLoop]: Abstraction has 248 states and 331 transitions. [2021-11-02 22:09:43,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states and 331 transitions. [2021-11-02 22:09:43,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 199. [2021-11-02 22:09:43,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 199 states have (on average 1.321608040201005) internal successors, (263), 198 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:09:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 263 transitions. [2021-11-02 22:09:43,799 INFO L704 BuchiCegarLoop]: Abstraction has 199 states and 263 transitions. [2021-11-02 22:09:43,799 INFO L587 BuchiCegarLoop]: Abstraction has 199 states and 263 transitions. [2021-11-02 22:09:43,799 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-11-02 22:09:43,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 199 states and 263 transitions. [2021-11-02 22:09:43,800 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 58 [2021-11-02 22:09:43,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:09:43,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:09:43,801 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:09:43,801 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-11-02 22:09:43,802 INFO L791 eck$LassoCheckResult]: Stem: 5292#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 5293#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 5290#L565 assume !(main_~array_size~0 < 1); 5291#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 5294#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5295#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5296#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5297#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5316#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5332#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5330#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5331#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5322#L552-3 assume !(lis_~i~0 < lis_~N); 5302#L552-4 lis_~i~0 := 1; 5303#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5458#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5304#L556 assume !lis_#t~short11; 5305#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 5310#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5312#L555-3 assume !(lis_~j~0 < lis_~i~0); 5317#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 5318#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5298#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5299#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 5487#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5313#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5300#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5301#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 5306#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 5311#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5486#L555-3 assume !(lis_~j~0 < lis_~i~0); 5485#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 5484#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5483#L555-3 [2021-11-02 22:09:43,802 INFO L793 eck$LassoCheckResult]: Loop: 5483#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5482#L556 assume !lis_#t~short11; 5461#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 5451#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5483#L555-3 [2021-11-02 22:09:43,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:43,802 INFO L85 PathProgramCache]: Analyzing trace with hash 800338629, now seen corresponding path program 7 times [2021-11-02 22:09:43,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:43,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917439440] [2021-11-02 22:09:43,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:43,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:43,829 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:43,885 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:43,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:43,885 INFO L85 PathProgramCache]: Analyzing trace with hash 2129256, now seen corresponding path program 3 times [2021-11-02 22:09:43,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:43,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001935758] [2021-11-02 22:09:43,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:43,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:43,892 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:43,895 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:43,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:09:43,895 INFO L85 PathProgramCache]: Analyzing trace with hash 20295212, now seen corresponding path program 8 times [2021-11-02 22:09:43,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:09:43,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523582403] [2021-11-02 22:09:43,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:09:43,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:09:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:43,940 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:09:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:09:44,003 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:09:54,891 WARN L207 SmtUtils]: Spent 10.79 s on a formula simplification. DAG size of input: 359 DAG size of output: 236 [2021-11-02 22:10:00,480 INFO L210 LassoAnalysis]: Preferences: [2021-11-02 22:10:00,480 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-02 22:10:00,480 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-02 22:10:00,480 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-02 22:10:00,480 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-02 22:10:00,480 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:00,481 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-02 22:10:00,481 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-02 22:10:00,481 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration18_Lasso [2021-11-02 22:10:00,481 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-02 22:10:00,481 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-02 22:10:00,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:00,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:00,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:00,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:00,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:00,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:00,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:00,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:00,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:00,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:00,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:00,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:04,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:04,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:04,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:04,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:04,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:04,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:04,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:04,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:04,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:04,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:04,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:04,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-02 22:10:04,906 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-02 22:10:04,906 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-02 22:10:04,907 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:04,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:04,912 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:04,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-11-02 22:10:04,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:04,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:04,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:10:04,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:04,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:04,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:04,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:10:04,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:10:04,924 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:04,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2021-11-02 22:10:04,948 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:04,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:04,949 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:04,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-11-02 22:10:04,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:04,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:04,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:10:04,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:04,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:04,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:04,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:10:04,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:10:04,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:04,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2021-11-02 22:10:04,986 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:04,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:04,987 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:04,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-11-02 22:10:04,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:04,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:04,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:04,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:04,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:10:05,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:10:05,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2021-11-02 22:10:05,051 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,052 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-11-02 22:10:05,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,064 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:10:05,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:10:05,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:10:05,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2021-11-02 22:10:05,090 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,091 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2021-11-02 22:10:05,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:10:05,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:10:05,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:10:05,103 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2021-11-02 22:10:05,127 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,128 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2021-11-02 22:10:05,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,140 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:10:05,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:10:05,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2021-11-02 22:10:05,167 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,168 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2021-11-02 22:10:05,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:10:05,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:10:05,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:10:05,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,201 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2021-11-02 22:10:05,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,202 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2021-11-02 22:10:05,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:10:05,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:10:05,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:10:05,213 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2021-11-02 22:10:05,236 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,237 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-11-02 22:10:05,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:10:05,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:10:05,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2021-11-02 22:10:05,274 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,275 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-11-02 22:10:05,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:10:05,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:10:05,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2021-11-02 22:10:05,312 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,313 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2021-11-02 22:10:05,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:10:05,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:10:05,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:10:05,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,349 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2021-11-02 22:10:05,350 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,351 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-11-02 22:10:05,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:10:05,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:10:05,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2021-11-02 22:10:05,390 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,391 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-11-02 22:10:05,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,404 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:10:05,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:10:05,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2021-11-02 22:10:05,433 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,434 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-11-02 22:10:05,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:10:05,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:10:05,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2021-11-02 22:10:05,473 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,474 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-11-02 22:10:05,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:10:05,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:10:05,500 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2021-11-02 22:10:05,524 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,525 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-11-02 22:10:05,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:10:05,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:10:05,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2021-11-02 22:10:05,563 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,564 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-11-02 22:10:05,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:10:05,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:10:05,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2021-11-02 22:10:05,604 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,605 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-11-02 22:10:05,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:10:05,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:10:05,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2021-11-02 22:10:05,643 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,644 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2021-11-02 22:10:05,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:10:05,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:10:05,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2021-11-02 22:10:05,683 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,683 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2021-11-02 22:10:05,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,696 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:10:05,696 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:10:05,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,723 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2021-11-02 22:10:05,723 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,730 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2021-11-02 22:10:05,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:10:05,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:10:05,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2021-11-02 22:10:05,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,768 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2021-11-02 22:10:05,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:10:05,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:10:05,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2021-11-02 22:10:05,808 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,810 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2021-11-02 22:10:05,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:10:05,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:10:05,825 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2021-11-02 22:10:05,849 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,850 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2021-11-02 22:10:05,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:10:05,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:10:05,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2021-11-02 22:10:05,887 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,888 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2021-11-02 22:10:05,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:10:05,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:10:05,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2021-11-02 22:10:05,927 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,928 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2021-11-02 22:10:05,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:10:05,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:10:05,945 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:05,966 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2021-11-02 22:10:05,967 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:05,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:05,967 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:05,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2021-11-02 22:10:05,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:05,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:05,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:10:05,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:05,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:05,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:05,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:10:05,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:10:05,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:06,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2021-11-02 22:10:06,002 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:06,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:06,003 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:06,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2021-11-02 22:10:06,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:06,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:06,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-02 22:10:06,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:06,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:06,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:06,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-02 22:10:06,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-02 22:10:06,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-02 22:10:06,042 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2021-11-02 22:10:06,042 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:06,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:06,043 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:06,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2021-11-02 22:10:06,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-02 22:10:06,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-02 22:10:06,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-02 22:10:06,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-02 22:10:06,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-02 22:10:06,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-02 22:10:06,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-02 22:10:06,078 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-02 22:10:06,143 INFO L443 ModelExtractionUtils]: Simplification made 33 calls to the SMT solver. [2021-11-02 22:10:06,143 INFO L444 ModelExtractionUtils]: 16 out of 46 variables were initially zero. Simplification set additionally 27 variables to zero. [2021-11-02 22:10:06,144 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:10:06,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:06,145 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:10:06,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2021-11-02 22:10:06,146 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-02 22:10:06,154 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-02 22:10:06,154 INFO L513 LassoAnalysis]: Proved termination. [2021-11-02 22:10:06,154 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0) = -2*ULTIMATE.start_lis_~j~0 + 5 Supporting invariants [] [2021-11-02 22:10:06,176 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2021-11-02 22:10:06,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2021-11-02 22:10:06,883 INFO L297 tatePredicateManager]: 106 out of 107 supporting invariants were superfluous and have been removed [2021-11-02 22:10:06,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:10:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:10:06,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-02 22:10:06,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:10:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:10:07,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-02 22:10:07,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:10:07,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:10:07,184 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2021-11-02 22:10:07,184 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 199 states and 263 transitions. cyclomatic complexity: 75 Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:10:07,214 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 199 states and 263 transitions. cyclomatic complexity: 75. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 199 states and 263 transitions. Complement of second has 4 states. [2021-11-02 22:10:07,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-11-02 22:10:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:10:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2021-11-02 22:10:07,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 33 letters. Loop has 4 letters. [2021-11-02 22:10:07,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:10:07,217 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-11-02 22:10:07,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:10:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:10:07,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-02 22:10:07,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:10:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:10:07,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-02 22:10:07,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:10:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:10:07,506 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2021-11-02 22:10:07,506 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 199 states and 263 transitions. cyclomatic complexity: 75 Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:10:07,540 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 199 states and 263 transitions. cyclomatic complexity: 75. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 199 states and 263 transitions. Complement of second has 4 states. [2021-11-02 22:10:07,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-11-02 22:10:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:10:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2021-11-02 22:10:07,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 33 letters. Loop has 4 letters. [2021-11-02 22:10:07,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:10:07,541 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-11-02 22:10:07,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:10:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:10:07,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-02 22:10:07,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:10:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:10:07,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-02 22:10:07,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:10:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:10:07,835 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2021-11-02 22:10:07,835 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 199 states and 263 transitions. cyclomatic complexity: 75 Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:10:07,961 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 199 states and 263 transitions. cyclomatic complexity: 75. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 238 states and 324 transitions. Complement of second has 12 states. [2021-11-02 22:10:07,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2021-11-02 22:10:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:10:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2021-11-02 22:10:07,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 33 letters. Loop has 4 letters. [2021-11-02 22:10:07,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:10:07,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 37 letters. Loop has 4 letters. [2021-11-02 22:10:07,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:10:07,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 33 letters. Loop has 8 letters. [2021-11-02 22:10:07,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-02 22:10:07,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 238 states and 324 transitions. [2021-11-02 22:10:07,967 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 43 [2021-11-02 22:10:07,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 238 states to 144 states and 191 transitions. [2021-11-02 22:10:07,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2021-11-02 22:10:07,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2021-11-02 22:10:07,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 191 transitions. [2021-11-02 22:10:07,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-02 22:10:07,970 INFO L681 BuchiCegarLoop]: Abstraction has 144 states and 191 transitions. [2021-11-02 22:10:07,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 191 transitions. [2021-11-02 22:10:07,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-11-02 22:10:07,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 144 states have (on average 1.3263888888888888) internal successors, (191), 143 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:10:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 191 transitions. [2021-11-02 22:10:07,974 INFO L704 BuchiCegarLoop]: Abstraction has 144 states and 191 transitions. [2021-11-02 22:10:07,975 INFO L587 BuchiCegarLoop]: Abstraction has 144 states and 191 transitions. [2021-11-02 22:10:07,975 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-11-02 22:10:07,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 144 states and 191 transitions. [2021-11-02 22:10:07,976 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 43 [2021-11-02 22:10:07,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:10:07,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:10:07,977 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:10:07,978 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1, 1] [2021-11-02 22:10:07,978 INFO L791 eck$LassoCheckResult]: Stem: 6949#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 6950#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 6947#L565 assume !(main_~array_size~0 < 1); 6948#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 6951#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6952#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6953#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6954#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6974#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6984#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6983#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6982#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6981#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6980#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6979#L552-3 assume !(lis_~i~0 < lis_~N); 6960#L552-4 lis_~i~0 := 1; 6961#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6955#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 6956#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 7088#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7087#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7083#L555-3 assume !(lis_~j~0 < lis_~i~0); 7080#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 7078#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7076#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7074#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 7071#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7068#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7064#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7062#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 7058#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7056#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7052#L555-3 assume !(lis_~j~0 < lis_~i~0); 7050#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 7048#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7047#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7044#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 7041#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7037#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7034#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7031#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 7028#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7026#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7023#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7012#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 7014#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 7013#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7011#L555-3 assume !(lis_~j~0 < lis_~i~0); 7007#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 7006#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7005#L555-3 [2021-11-02 22:10:07,978 INFO L793 eck$LassoCheckResult]: Loop: 7005#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7004#L556 assume !lis_#t~short11; 6968#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 6969#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6971#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7089#L556 assume !lis_#t~short11; 6998#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 6996#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6995#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 6988#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 6993#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6989#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6987#L555-3 assume !(lis_~j~0 < lis_~i~0); 6985#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 6986#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7005#L555-3 [2021-11-02 22:10:07,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:10:07,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1549338680, now seen corresponding path program 3 times [2021-11-02 22:10:07,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:10:07,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371971525] [2021-11-02 22:10:07,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:10:07,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:10:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:10:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 18 proven. 95 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-02 22:10:08,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:10:08,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371971525] [2021-11-02 22:10:08,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371971525] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:10:08,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378452773] [2021-11-02 22:10:08,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-02 22:10:08,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:10:08,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:10:08,618 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:10:08,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3b1856b-4386-418a-a038-10149efabb23/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2021-11-02 22:10:09,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-11-02 22:10:09,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:10:09,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 68 conjunts are in the unsatisfiable core [2021-11-02 22:10:09,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:10:09,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-11-02 22:10:09,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2021-11-02 22:10:09,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:09,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:09,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:09,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:09,849 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:09,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:09,861 INFO L354 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2021-11-02 22:10:09,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 55 [2021-11-02 22:10:10,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:10,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:10,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:10,090 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-02 22:10:10,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 92 treesize of output 87 [2021-11-02 22:10:10,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,401 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:10,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,406 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:10,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,409 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:10,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,412 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:10,425 INFO L354 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2021-11-02 22:10:10,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 118 treesize of output 119 [2021-11-02 22:10:10,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:10,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,738 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:10,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:10,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:10,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:10,749 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:10,762 INFO L354 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2021-11-02 22:10:10,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 144 treesize of output 151 [2021-11-02 22:10:11,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:11,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:11,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:11,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:11,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:11,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:11,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:11,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:11,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:11,747 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:11,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:11,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:11,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:11,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:11,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:11,753 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:11,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:11,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:11,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:11,757 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:11,771 INFO L354 Elim1Store]: treesize reduction 59, result has 15.7 percent of original size [2021-11-02 22:10:11,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 10 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 47 case distinctions, treesize of input 132 treesize of output 119 [2021-11-02 22:10:12,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:12,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:12,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:12,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:12,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:12,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:12,535 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:12,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:12,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:12,538 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:12,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:12,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:12,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:12,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:12,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:12,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:12,545 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:12,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:12,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:12,548 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:13,121 INFO L354 Elim1Store]: treesize reduction 1150, result has 17.3 percent of original size [2021-11-02 22:10:13,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 10 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 79 case distinctions, treesize of input 167 treesize of output 287 [2021-11-02 22:10:15,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:15,256 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:15,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:15,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:15,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:15,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:15,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:15,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:15,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:15,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:15,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:15,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:15,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:15,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:15,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:15,270 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:15,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:15,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:15,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:15,273 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:16,159 INFO L354 Elim1Store]: treesize reduction 1500, result has 17.5 percent of original size [2021-11-02 22:10:16,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 10 disjoint index pairs (out of 91 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 392 treesize of output 508 [2021-11-02 22:10:22,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:22,501 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:22,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:22,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:22,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:22,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:22,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:22,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:22,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:22,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:22,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:22,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:22,513 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:22,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:22,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:22,517 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:22,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:22,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:22,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:10:22,520 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:10:23,991 INFO L354 Elim1Store]: treesize reduction 1978, result has 17.5 percent of original size [2021-11-02 22:10:23,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 10 disjoint index pairs (out of 105 index pairs), introduced 16 new quantified variables, introduced 121 case distinctions, treesize of input 420 treesize of output 629 [2021-11-02 22:14:01,735 WARN L207 SmtUtils]: Spent 8.69 s on a formula simplification. DAG size of input: 455 DAG size of output: 310 [2021-11-02 22:14:25,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:25,317 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:14:25,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:25,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:25,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:25,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:25,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:25,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:25,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:14:25,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:25,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:25,326 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:14:25,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:25,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:25,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:14:25,331 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 22:14:29,981 INFO L354 Elim1Store]: treesize reduction 3593, result has 11.9 percent of original size [2021-11-02 22:14:29,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 21 select indices, 21 select index equivalence classes, 10 disjoint index pairs (out of 210 index pairs), introduced 23 new quantified variables, introduced 231 case distinctions, treesize of input 3616 treesize of output 2203