./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 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/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_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY --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-47ea020 [2021-11-07 08:31:43,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 08:31:43,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 08:31:44,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 08:31:44,025 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 08:31:44,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 08:31:44,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 08:31:44,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 08:31:44,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 08:31:44,040 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 08:31:44,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 08:31:44,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 08:31:44,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 08:31:44,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 08:31:44,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 08:31:44,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 08:31:44,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 08:31:44,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 08:31:44,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 08:31:44,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 08:31:44,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 08:31:44,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 08:31:44,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 08:31:44,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 08:31:44,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 08:31:44,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 08:31:44,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 08:31:44,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 08:31:44,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 08:31:44,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 08:31:44,088 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 08:31:44,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 08:31:44,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 08:31:44,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 08:31:44,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 08:31:44,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 08:31:44,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 08:31:44,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 08:31:44,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 08:31:44,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 08:31:44,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 08:31:44,107 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-11-07 08:31:44,173 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 08:31:44,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 08:31:44,174 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 08:31:44,174 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 08:31:44,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 08:31:44,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 08:31:44,176 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 08:31:44,176 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-07 08:31:44,177 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-07 08:31:44,177 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-07 08:31:44,177 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-07 08:31:44,177 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-07 08:31:44,178 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-07 08:31:44,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 08:31:44,178 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 08:31:44,178 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 08:31:44,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 08:31:44,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-07 08:31:44,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-07 08:31:44,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-07 08:31:44,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 08:31:44,180 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-07 08:31:44,180 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 08:31:44,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-07 08:31:44,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 08:31:44,181 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 08:31:44,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 08:31:44,181 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 08:31:44,181 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 08:31:44,186 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-07 08:31:44,186 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_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/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_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY 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-07 08:31:44,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 08:31:44,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 08:31:44,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 08:31:44,611 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 08:31:44,612 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 08:31:44,613 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/../../sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i [2021-11-07 08:31:44,716 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/data/9d5687c74/2181c458bf8a42a3aad9c1250aa4155a/FLAG168fed624 [2021-11-07 08:31:45,483 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 08:31:45,483 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i [2021-11-07 08:31:45,515 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/data/9d5687c74/2181c458bf8a42a3aad9c1250aa4155a/FLAG168fed624 [2021-11-07 08:31:45,721 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/data/9d5687c74/2181c458bf8a42a3aad9c1250aa4155a [2021-11-07 08:31:45,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 08:31:45,725 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 08:31:45,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 08:31:45,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 08:31:45,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 08:31:45,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:31:45" (1/1) ... [2021-11-07 08:31:45,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@169c9831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:45, skipping insertion in model container [2021-11-07 08:31:45,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:31:45" (1/1) ... [2021-11-07 08:31:45,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 08:31:45,821 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 08:31:46,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:31:46,190 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 08:31:46,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:31:46,276 INFO L208 MainTranslator]: Completed translation [2021-11-07 08:31:46,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:46 WrapperNode [2021-11-07 08:31:46,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 08:31:46,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 08:31:46,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 08:31:46,279 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 08:31:46,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:46" (1/1) ... [2021-11-07 08:31:46,305 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:46" (1/1) ... [2021-11-07 08:31:46,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 08:31:46,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 08:31:46,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 08:31:46,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 08:31:46,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:46" (1/1) ... [2021-11-07 08:31:46,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:46" (1/1) ... [2021-11-07 08:31:46,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:46" (1/1) ... [2021-11-07 08:31:46,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:46" (1/1) ... [2021-11-07 08:31:46,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:46" (1/1) ... [2021-11-07 08:31:46,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:46" (1/1) ... [2021-11-07 08:31:46,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:46" (1/1) ... [2021-11-07 08:31:46,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 08:31:46,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 08:31:46,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 08:31:46,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 08:31:46,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:46" (1/1) ... [2021-11-07 08:31:46,387 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:46,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:46,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:46,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-07 08:31:46,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 08:31:46,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 08:31:46,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 08:31:46,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 08:31:46,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 08:31:46,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 08:31:47,024 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 08:31:47,025 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-11-07 08:31:47,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:31:47 BoogieIcfgContainer [2021-11-07 08:31:47,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 08:31:47,032 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-07 08:31:47,032 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-07 08:31:47,039 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-07 08:31:47,040 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-07 08:31:47,040 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.11 08:31:45" (1/3) ... [2021-11-07 08:31:47,042 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45476894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 08:31:47, skipping insertion in model container [2021-11-07 08:31:47,042 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-07 08:31:47,043 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:46" (2/3) ... [2021-11-07 08:31:47,043 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45476894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 08:31:47, skipping insertion in model container [2021-11-07 08:31:47,043 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-07 08:31:47,044 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:31:47" (3/3) ... [2021-11-07 08:31:47,047 INFO L389 chiAutomizerObserver]: Analyzing ICFG lis-alloca-2.i [2021-11-07 08:31:47,126 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-07 08:31:47,127 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-07 08:31:47,127 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-07 08:31:47,127 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-07 08:31:47,128 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-07 08:31:47,128 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-07 08:31:47,128 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-07 08:31:47,128 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-07 08:31:47,153 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-07 08:31:47,184 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-11-07 08:31:47,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:31:47,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:31:47,192 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-11-07 08:31:47,193 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-07 08:31:47,193 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-07 08:31:47,194 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-07 08:31:47,200 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-11-07 08:31:47,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:31:47,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:31:47,201 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-11-07 08:31:47,202 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-07 08:31:47,210 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-07 08:31:47,212 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-07 08:31:47,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:47,220 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-11-07 08:31:47,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:47,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729958231] [2021-11-07 08:31:47,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:47,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:47,399 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:47,461 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:47,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:47,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2021-11-07 08:31:47,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:47,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514189398] [2021-11-07 08:31:47,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:47,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:47,479 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:47,492 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:47,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:47,494 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2021-11-07 08:31:47,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:47,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607856038] [2021-11-07 08:31:47,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:47,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:47,558 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:47,630 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:48,667 INFO L210 LassoAnalysis]: Preferences: [2021-11-07 08:31:48,668 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-07 08:31:48,668 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-07 08:31:48,668 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-07 08:31:48,668 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-07 08:31:48,668 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:48,669 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-07 08:31:48,669 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-07 08:31:48,669 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration1_Lasso [2021-11-07 08:31:48,669 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-07 08:31:48,670 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-07 08:31:48,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-07 08:31:48,712 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-07 08:31:48,716 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-07 08:31:49,122 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-07 08:31:49,129 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-07 08:31:49,133 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-07 08:31:49,136 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-07 08:31:49,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-07 08:31:49,142 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-07 08:31:49,145 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-07 08:31:49,147 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-07 08:31:49,151 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-07 08:31:49,154 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-07 08:31:49,157 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-07 08:31:49,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-07 08:31:49,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-07 08:31:49,180 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-07 08:31:49,184 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-07 08:31:49,186 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-07 08:31:49,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-07 08:31:49,198 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-07 08:31:49,201 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-07 08:31:49,203 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-07 08:31:49,207 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-07 08:31:49,210 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-07 08:31:49,752 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-07 08:31:49,765 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-07 08:31:49,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:49,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:49,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:49,774 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-07 08:31:49,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-11-07 08:31:49,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:49,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:49,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:49,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:49,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:49,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:49,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:49,802 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:49,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:49,854 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:49,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:49,863 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:49,871 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-07 08:31:49,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:49,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:49,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:49,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:49,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:49,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:49,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-11-07 08:31:49,897 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:49,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-11-07 08:31:49,927 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:49,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:49,928 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:49,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-11-07 08:31:49,947 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-07 08:31:49,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:49,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:49,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:49,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:49,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:49,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:49,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:49,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:50,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:50,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:50,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:50,019 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:50,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-11-07 08:31:50,022 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-07 08:31:50,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:50,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:50,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:50,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:50,036 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:50,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:50,041 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:50,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-11-07 08:31:50,067 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:50,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:50,068 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:50,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-11-07 08:31:50,073 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-07 08:31:50,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:50,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:50,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:50,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:50,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:50,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:50,133 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-07 08:31:50,202 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-11-07 08:31:50,203 INFO L444 ModelExtractionUtils]: 18 out of 43 variables were initially zero. Simplification set additionally 21 variables to zero. [2021-11-07 08:31:50,205 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:50,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:50,209 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:50,230 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-07 08:31:50,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-11-07 08:31:50,263 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-11-07 08:31:50,263 INFO L513 LassoAnalysis]: Proved termination. [2021-11-07 08:31:50,264 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-07 08:31:50,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:50,396 INFO L297 tatePredicateManager]: 15 out of 17 supporting invariants were superfluous and have been removed [2021-11-07 08:31:50,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:50,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 08:31:50,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:50,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-07 08:31:50,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:50,600 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-07 08:31:50,623 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-07 08:31:50,625 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-07 08:31:50,700 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-07 08:31:50,700 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-07 08:31:50,702 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-07 08:31:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2021-11-07 08:31:50,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 2 letters. [2021-11-07 08:31:50,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:31:50,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 2 letters. [2021-11-07 08:31:50,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:31:50,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 4 letters. [2021-11-07 08:31:50,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:31:50,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 64 transitions. [2021-11-07 08:31:50,715 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-11-07 08:31:50,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 18 states and 28 transitions. [2021-11-07 08:31:50,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-11-07 08:31:50,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-11-07 08:31:50,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 28 transitions. [2021-11-07 08:31:50,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:31:50,722 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2021-11-07 08:31:50,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 28 transitions. [2021-11-07 08:31:50,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-11-07 08:31:50,748 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-07 08:31:50,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2021-11-07 08:31:50,751 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2021-11-07 08:31:50,751 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2021-11-07 08:31:50,752 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-07 08:31:50,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2021-11-07 08:31:50,754 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-11-07 08:31:50,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:31:50,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:31:50,755 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-11-07 08:31:50,755 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-07 08:31:50,756 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-07 08:31:50,757 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-07 08:31:50,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:50,757 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2021-11-07 08:31:50,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:50,759 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438968445] [2021-11-07 08:31:50,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:50,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:50,911 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-07 08:31:50,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:31:50,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438968445] [2021-11-07 08:31:50,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438968445] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:31:50,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:31:50,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:31:50,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466974120] [2021-11-07 08:31:50,916 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 08:31:50,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:50,917 INFO L85 PathProgramCache]: Analyzing trace with hash 60785, now seen corresponding path program 1 times [2021-11-07 08:31:50,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:50,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129873777] [2021-11-07 08:31:50,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:50,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:50,932 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:50,941 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:50,969 INFO L210 LassoAnalysis]: Preferences: [2021-11-07 08:31:50,976 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-07 08:31:50,976 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-07 08:31:50,977 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-07 08:31:50,979 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-11-07 08:31:50,979 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:50,979 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-07 08:31:50,979 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-07 08:31:50,979 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration2_Loop [2021-11-07 08:31:50,979 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-07 08:31:50,980 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-07 08:31:50,982 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-07 08:31:50,985 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-07 08:31:50,988 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-07 08:31:50,998 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-07 08:31:51,000 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-07 08:31:51,059 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-07 08:31:51,059 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-11-07 08:31:51,061 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:51,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:51,063 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:51,075 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-07 08:31:51,075 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-07 08:31:51,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-11-07 08:31:51,096 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-07 08:31:51,096 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-07 08:31:51,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:51,133 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:51,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:51,138 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:51,145 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-07 08:31:51,145 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-07 08:31:51,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-11-07 08:31:51,174 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-07 08:31:51,174 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-07 08:31:51,213 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2021-11-07 08:31:51,214 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:51,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:51,215 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:51,231 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-07 08:31:51,232 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-07 08:31:51,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-11-07 08:31:51,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:51,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:51,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:51,301 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:51,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-11-07 08:31:51,303 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-11-07 08:31:51,303 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-07 08:31:51,487 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-11-07 08:31:51,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:51,494 INFO L210 LassoAnalysis]: Preferences: [2021-11-07 08:31:51,494 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-07 08:31:51,494 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-07 08:31:51,494 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-07 08:31:51,494 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-07 08:31:51,494 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:51,494 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-07 08:31:51,494 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-07 08:31:51,494 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration2_Loop [2021-11-07 08:31:51,494 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-07 08:31:51,495 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-07 08:31:51,496 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-07 08:31:51,507 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-07 08:31:51,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-07 08:31:51,520 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-07 08:31:51,524 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-07 08:31:51,582 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-07 08:31:51,582 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-07 08:31:51,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:51,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:51,588 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:51,594 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-07 08:31:51,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:51,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:51,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:51,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:51,607 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:51,607 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:51,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-11-07 08:31:51,618 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:51,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:51,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:51,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:51,668 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:51,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-11-07 08:31:51,673 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-07 08:31:51,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:51,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:51,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:51,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:51,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:51,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:51,718 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:51,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:51,762 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:51,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:51,764 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:51,770 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-07 08:31:51,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:51,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:51,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:51,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:51,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:51,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:51,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:51,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-11-07 08:31:51,798 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-07 08:31:51,803 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-11-07 08:31:51,804 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-11-07 08:31:51,804 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:51,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:51,806 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:51,813 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-07 08:31:51,813 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-11-07 08:31:51,813 INFO L513 LassoAnalysis]: Proved termination. [2021-11-07 08:31:51,813 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-07 08:31:51,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-11-07 08:31:51,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:51,863 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-11-07 08:31:51,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:51,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 08:31:51,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:51,938 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 08:31:51,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:51,999 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-07 08:31:52,003 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-07 08:31:52,003 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-07 08:31:52,102 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-07 08:31:52,103 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-07 08:31:52,104 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-07 08:31:52,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2021-11-07 08:31:52,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 3 letters. [2021-11-07 08:31:52,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:31:52,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 9 letters. Loop has 3 letters. [2021-11-07 08:31:52,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:31:52,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 6 letters. [2021-11-07 08:31:52,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:31:52,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 84 transitions. [2021-11-07 08:31:52,122 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2021-11-07 08:31:52,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 37 states and 57 transitions. [2021-11-07 08:31:52,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-11-07 08:31:52,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-11-07 08:31:52,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 57 transitions. [2021-11-07 08:31:52,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:31:52,126 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 57 transitions. [2021-11-07 08:31:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 57 transitions. [2021-11-07 08:31:52,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2021-11-07 08:31:52,158 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-07 08:31:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2021-11-07 08:31:52,161 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 45 transitions. [2021-11-07 08:31:52,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:31:52,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:31:52,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:31:52,166 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-07 08:31:52,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:52,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:31:52,263 INFO L93 Difference]: Finished difference Result 30 states and 45 transitions. [2021-11-07 08:31:52,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:31:52,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 45 transitions. [2021-11-07 08:31:52,265 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-07 08:31:52,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 45 transitions. [2021-11-07 08:31:52,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-11-07 08:31:52,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-11-07 08:31:52,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 45 transitions. [2021-11-07 08:31:52,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:31:52,266 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2021-11-07 08:31:52,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 45 transitions. [2021-11-07 08:31:52,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2021-11-07 08:31:52,269 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-07 08:31:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2021-11-07 08:31:52,270 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 44 transitions. [2021-11-07 08:31:52,270 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 44 transitions. [2021-11-07 08:31:52,270 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-07 08:31:52,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 44 transitions. [2021-11-07 08:31:52,271 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-07 08:31:52,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:31:52,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:31:52,272 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:31:52,272 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:31:52,272 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-07 08:31:52,273 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-07 08:31:52,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:52,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2021-11-07 08:31:52,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:52,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399231490] [2021-11-07 08:31:52,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:52,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:52,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:52,383 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-07 08:31:52,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:31:52,389 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399231490] [2021-11-07 08:31:52,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399231490] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:31:52,389 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448935240] [2021-11-07 08:31:52,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:52,390 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:31:52,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:52,391 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:31:52,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-07 08:31:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:52,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 08:31:52,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:52,524 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-07 08:31:52,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448935240] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:31:52,524 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:31:52,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-11-07 08:31:52,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61999438] [2021-11-07 08:31:52,526 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 08:31:52,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:52,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 1 times [2021-11-07 08:31:52,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:52,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090997403] [2021-11-07 08:31:52,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:52,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:52,566 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:52,582 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:52,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:31:52,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 08:31:52,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:31:52,996 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-07 08:31:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:31:53,141 INFO L93 Difference]: Finished difference Result 59 states and 84 transitions. [2021-11-07 08:31:53,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 08:31:53,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 84 transitions. [2021-11-07 08:31:53,146 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-11-07 08:31:53,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 51 states and 74 transitions. [2021-11-07 08:31:53,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-11-07 08:31:53,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-11-07 08:31:53,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 74 transitions. [2021-11-07 08:31:53,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:31:53,151 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 74 transitions. [2021-11-07 08:31:53,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 74 transitions. [2021-11-07 08:31:53,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2021-11-07 08:31:53,157 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-07 08:31:53,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2021-11-07 08:31:53,158 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2021-11-07 08:31:53,158 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2021-11-07 08:31:53,158 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-07 08:31:53,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2021-11-07 08:31:53,160 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-07 08:31:53,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:31:53,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:31:53,161 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:31:53,162 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:31:53,162 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-07 08:31:53,162 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-07 08:31:53,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:53,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2021-11-07 08:31:53,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:53,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176606523] [2021-11-07 08:31:53,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:53,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:53,216 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:53,262 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:53,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:53,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 2 times [2021-11-07 08:31:53,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:53,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734583616] [2021-11-07 08:31:53,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:53,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:53,278 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:53,294 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:53,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:53,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1776402153, now seen corresponding path program 1 times [2021-11-07 08:31:53,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:53,295 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337060791] [2021-11-07 08:31:53,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:53,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:53,387 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-07 08:31:53,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:31:53,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337060791] [2021-11-07 08:31:53,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337060791] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:31:53,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454164841] [2021-11-07 08:31:53,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:53,389 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:31:53,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:53,392 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:31:53,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-07 08:31:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:53,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-07 08:31:53,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:53,571 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-07 08:31:53,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454164841] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:31:53,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:31:53,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-11-07 08:31:53,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329832102] [2021-11-07 08:31:54,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:31:54,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 08:31:54,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-11-07 08:31:54,075 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-07 08:31:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:31:54,317 INFO L93 Difference]: Finished difference Result 99 states and 142 transitions. [2021-11-07 08:31:54,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 08:31:54,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 142 transitions. [2021-11-07 08:31:54,319 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2021-11-07 08:31:54,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 79 states and 114 transitions. [2021-11-07 08:31:54,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2021-11-07 08:31:54,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2021-11-07 08:31:54,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 114 transitions. [2021-11-07 08:31:54,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:31:54,321 INFO L681 BuchiCegarLoop]: Abstraction has 79 states and 114 transitions. [2021-11-07 08:31:54,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 114 transitions. [2021-11-07 08:31:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 49. [2021-11-07 08:31:54,326 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-07 08:31:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2021-11-07 08:31:54,327 INFO L704 BuchiCegarLoop]: Abstraction has 49 states and 71 transitions. [2021-11-07 08:31:54,327 INFO L587 BuchiCegarLoop]: Abstraction has 49 states and 71 transitions. [2021-11-07 08:31:54,327 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-07 08:31:54,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 71 transitions. [2021-11-07 08:31:54,328 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2021-11-07 08:31:54,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:31:54,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:31:54,329 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:31:54,329 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-11-07 08:31:54,330 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-07 08:31:54,330 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-07 08:31:54,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:54,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 3 times [2021-11-07 08:31:54,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:54,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223848006] [2021-11-07 08:31:54,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:54,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:54,349 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:54,382 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:54,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:54,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 1 times [2021-11-07 08:31:54,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:54,387 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506334743] [2021-11-07 08:31:54,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:54,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:54,400 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:54,423 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:54,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:54,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1166707861, now seen corresponding path program 1 times [2021-11-07 08:31:54,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:54,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541163445] [2021-11-07 08:31:54,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:54,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:54,481 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:54,556 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:55,915 INFO L210 LassoAnalysis]: Preferences: [2021-11-07 08:31:55,916 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-07 08:31:55,916 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-07 08:31:55,916 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-07 08:31:55,916 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-07 08:31:55,916 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:55,916 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-07 08:31:55,916 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-07 08:31:55,916 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration5_Lasso [2021-11-07 08:31:55,916 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-07 08:31:55,916 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-07 08:31:55,923 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-07 08:31:55,926 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-07 08:31:55,928 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-07 08:31:55,931 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-07 08:31:55,933 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-07 08:31:55,936 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-07 08:31:55,939 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-07 08:31:55,941 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-07 08:31:55,945 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-07 08:31:55,948 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-07 08:31:55,950 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-07 08:31:55,953 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-07 08:31:55,956 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-07 08:31:57,006 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-07 08:31:57,010 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-07 08:31:57,012 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-07 08:31:57,014 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-07 08:31:57,018 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-07 08:31:57,020 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-07 08:31:57,023 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-07 08:31:57,025 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-07 08:31:57,028 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-07 08:31:57,039 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-07 08:31:57,850 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-07 08:31:57,850 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-07 08:31:57,851 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:57,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:57,862 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:57,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-11-07 08:31:57,877 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-07 08:31:57,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:57,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:57,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:57,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:57,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:57,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:57,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:57,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:57,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:57,928 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:57,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:57,929 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:57,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-11-07 08:31:57,930 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-07 08:31:57,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:57,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:57,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:57,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:57,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:57,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:57,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:57,940 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:57,966 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:57,967 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:57,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:57,967 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:57,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-11-07 08:31:57,974 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-07 08:31:57,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:57,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:57,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:57,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:57,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:57,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:57,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:57,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:58,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:58,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:58,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:58,016 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:58,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-11-07 08:31:58,017 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-07 08:31:58,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:58,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:58,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:58,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:58,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:58,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:58,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:58,028 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:58,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:58,052 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:58,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:58,053 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:58,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-11-07 08:31:58,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-07 08:31:58,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:58,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:58,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:58,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:58,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:58,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:58,076 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:58,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:58,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:58,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:58,096 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:58,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-11-07 08:31:58,109 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-07 08:31:58,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:58,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:58,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:58,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:58,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:58,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:58,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:58,119 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:58,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:58,142 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:58,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:58,142 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:58,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-11-07 08:31:58,144 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-07 08:31:58,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:58,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:58,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:58,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:58,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:58,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:58,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:58,153 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:58,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-11-07 08:31:58,172 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:58,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:58,173 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:58,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-11-07 08:31:58,175 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-07 08:31:58,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:58,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:58,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:58,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:58,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:58,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:58,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:58,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:58,229 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:58,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:58,230 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:58,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-11-07 08:31:58,234 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-07 08:31:58,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:58,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:58,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:58,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:58,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:58,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:58,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:58,265 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-11-07 08:31:58,266 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:58,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:58,266 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:58,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-11-07 08:31:58,270 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-07 08:31:58,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:58,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:58,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:58,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:58,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:58,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:58,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:58,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:58,298 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-11-07 08:31:58,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:58,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:58,300 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:58,302 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-07 08:31:58,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-11-07 08:31:58,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:58,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:58,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:58,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:58,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:58,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:58,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:58,313 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:58,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-11-07 08:31:58,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:58,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:58,337 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:58,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-11-07 08:31:58,339 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-07 08:31:58,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:58,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:58,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:58,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:58,349 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:58,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:58,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:58,378 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-11-07 08:31:58,378 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:58,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:58,379 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:58,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-11-07 08:31:58,380 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-07 08:31:58,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:58,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:58,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:58,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:58,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:58,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:58,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:58,416 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-11-07 08:31:58,416 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:58,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:58,417 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:58,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-11-07 08:31:58,419 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-07 08:31:58,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:58,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:58,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:58,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:58,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:58,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:58,458 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:58,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:58,498 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:58,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:58,499 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:58,507 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-07 08:31:58,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:58,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:31:58,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:58,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:58,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:58,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:31:58,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:31:58,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-11-07 08:31:58,538 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:31:58,567 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-11-07 08:31:58,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:58,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:58,568 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:58,572 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-07 08:31:58,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:31:58,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:31:58,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:31:58,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:31:58,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-11-07 08:31:58,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:31:58,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:31:58,654 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-07 08:31:58,833 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2021-11-07 08:31:58,833 INFO L444 ModelExtractionUtils]: 28 out of 67 variables were initially zero. Simplification set additionally 36 variables to zero. [2021-11-07 08:31:58,834 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:31:58,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:58,839 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:31:58,841 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-07 08:31:58,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-11-07 08:31:58,875 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-07 08:31:58,875 INFO L513 LassoAnalysis]: Proved termination. [2021-11-07 08:31:58,875 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-07 08:31:58,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-11-07 08:31:59,139 INFO L297 tatePredicateManager]: 40 out of 43 supporting invariants were superfluous and have been removed [2021-11-07 08:31:59,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:59,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-07 08:31:59,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:59,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-07 08:31:59,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:59,576 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-07 08:31:59,576 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-07 08:31:59,577 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-07 08:31:59,651 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-07 08:31:59,651 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-07 08:31:59,652 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-07 08:31:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2021-11-07 08:31:59,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 11 letters. Loop has 4 letters. [2021-11-07 08:31:59,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:31:59,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 15 letters. Loop has 4 letters. [2021-11-07 08:31:59,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:31:59,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 11 letters. Loop has 8 letters. [2021-11-07 08:31:59,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:31:59,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 134 transitions. [2021-11-07 08:31:59,656 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2021-11-07 08:31:59,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 79 states and 115 transitions. [2021-11-07 08:31:59,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-11-07 08:31:59,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2021-11-07 08:31:59,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 115 transitions. [2021-11-07 08:31:59,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:31:59,660 INFO L681 BuchiCegarLoop]: Abstraction has 79 states and 115 transitions. [2021-11-07 08:31:59,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 115 transitions. [2021-11-07 08:31:59,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2021-11-07 08:31:59,666 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-07 08:31:59,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 111 transitions. [2021-11-07 08:31:59,667 INFO L704 BuchiCegarLoop]: Abstraction has 75 states and 111 transitions. [2021-11-07 08:31:59,667 INFO L587 BuchiCegarLoop]: Abstraction has 75 states and 111 transitions. [2021-11-07 08:31:59,667 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-07 08:31:59,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 111 transitions. [2021-11-07 08:31:59,668 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2021-11-07 08:31:59,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:31:59,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:31:59,669 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:31:59,670 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-11-07 08:31:59,670 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-07 08:31:59,670 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-07 08:31:59,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:59,671 INFO L85 PathProgramCache]: Analyzing trace with hash -304736135, now seen corresponding path program 1 times [2021-11-07 08:31:59,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:59,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371569175] [2021-11-07 08:31:59,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:59,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:59,688 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:59,709 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:59,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:59,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2284026, now seen corresponding path program 1 times [2021-11-07 08:31:59,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:59,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581061060] [2021-11-07 08:31:59,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:59,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:59,715 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:31:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:31:59,720 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:31:59,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:31:59,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1808266866, now seen corresponding path program 1 times [2021-11-07 08:31:59,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:31:59,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075137679] [2021-11-07 08:31:59,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:59,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:31:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:59,762 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-07 08:31:59,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:31:59,762 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075137679] [2021-11-07 08:31:59,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075137679] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:31:59,762 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828238408] [2021-11-07 08:31:59,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:31:59,762 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:31:59,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:31:59,763 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:31:59,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-11-07 08:31:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:31:59,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 08:31:59,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:31:59,944 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-07 08:31:59,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828238408] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:31:59,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-07 08:31:59,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2021-11-07 08:31:59,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254036261] [2021-11-07 08:32:00,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:32:00,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 08:32:00,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:32:00,067 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-07 08:32:00,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:32:00,175 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2021-11-07 08:32:00,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:32:00,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 104 transitions. [2021-11-07 08:32:00,177 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-07 08:32:00,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 61 states and 84 transitions. [2021-11-07 08:32:00,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-11-07 08:32:00,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-11-07 08:32:00,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 84 transitions. [2021-11-07 08:32:00,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:32:00,178 INFO L681 BuchiCegarLoop]: Abstraction has 61 states and 84 transitions. [2021-11-07 08:32:00,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 84 transitions. [2021-11-07 08:32:00,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2021-11-07 08:32:00,182 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-07 08:32:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2021-11-07 08:32:00,183 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 75 transitions. [2021-11-07 08:32:00,183 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 75 transitions. [2021-11-07 08:32:00,183 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-11-07 08:32:00,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 75 transitions. [2021-11-07 08:32:00,183 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-07 08:32:00,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:32:00,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:32:00,184 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:32:00,184 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:32:00,184 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-07 08:32:00,185 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-07 08:32:00,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:00,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1270630400, now seen corresponding path program 1 times [2021-11-07 08:32:00,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:00,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851654751] [2021-11-07 08:32:00,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:00,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:00,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-11-07 08:32:00,233 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-07 08:32:00,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:32:00,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851654751] [2021-11-07 08:32:00,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851654751] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:32:00,234 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:32:00,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:32:00,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757200545] [2021-11-07 08:32:00,235 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 08:32:00,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:00,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 3 times [2021-11-07 08:32:00,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:00,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960617] [2021-11-07 08:32:00,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:00,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:00,247 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:00,274 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:00,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:32:00,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:32:00,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:32:00,649 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-07 08:32:00,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:32:00,693 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2021-11-07 08:32:00,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:32:00,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 72 transitions. [2021-11-07 08:32:00,695 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-07 08:32:00,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 72 transitions. [2021-11-07 08:32:00,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-11-07 08:32:00,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-11-07 08:32:00,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 72 transitions. [2021-11-07 08:32:00,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:32:00,696 INFO L681 BuchiCegarLoop]: Abstraction has 52 states and 72 transitions. [2021-11-07 08:32:00,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 72 transitions. [2021-11-07 08:32:00,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2021-11-07 08:32:00,700 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-07 08:32:00,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2021-11-07 08:32:00,700 INFO L704 BuchiCegarLoop]: Abstraction has 51 states and 71 transitions. [2021-11-07 08:32:00,700 INFO L587 BuchiCegarLoop]: Abstraction has 51 states and 71 transitions. [2021-11-07 08:32:00,701 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-11-07 08:32:00,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 71 transitions. [2021-11-07 08:32:00,701 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-07 08:32:00,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:32:00,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:32:00,707 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:32:00,707 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:32:00,707 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-07 08:32:00,707 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-07 08:32:00,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:00,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1523485369, now seen corresponding path program 1 times [2021-11-07 08:32:00,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:00,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763688925] [2021-11-07 08:32:00,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:00,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:00,733 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:00,763 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:00,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:00,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 4 times [2021-11-07 08:32:00,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:00,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369382230] [2021-11-07 08:32:00,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:00,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:00,774 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:00,789 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:00,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:00,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1322701164, now seen corresponding path program 1 times [2021-11-07 08:32:00,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:00,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541035969] [2021-11-07 08:32:00,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:00,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:00,887 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-07 08:32:00,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:32:00,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541035969] [2021-11-07 08:32:00,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541035969] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:00,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891237990] [2021-11-07 08:32:00,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:00,888 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:32:00,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:00,889 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:32:00,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-11-07 08:32:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:01,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 08:32:01,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:32:01,157 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-07 08:32:01,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891237990] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:01,158 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:32:01,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-11-07 08:32:01,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353539395] [2021-11-07 08:32:01,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:32:01,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 08:32:01,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-11-07 08:32:01,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-07 08:32:01,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:32:01,617 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2021-11-07 08:32:01,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 08:32:01,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 89 transitions. [2021-11-07 08:32:01,619 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-11-07 08:32:01,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 41 states and 55 transitions. [2021-11-07 08:32:01,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2021-11-07 08:32:01,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2021-11-07 08:32:01,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 55 transitions. [2021-11-07 08:32:01,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:32:01,621 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 55 transitions. [2021-11-07 08:32:01,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 55 transitions. [2021-11-07 08:32:01,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2021-11-07 08:32:01,624 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-07 08:32:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2021-11-07 08:32:01,625 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2021-11-07 08:32:01,625 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2021-11-07 08:32:01,625 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-11-07 08:32:01,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 50 transitions. [2021-11-07 08:32:01,626 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-11-07 08:32:01,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:32:01,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:32:01,627 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:32:01,627 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2021-11-07 08:32:01,628 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-07 08:32:01,628 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-07 08:32:01,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:01,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1466227067, now seen corresponding path program 1 times [2021-11-07 08:32:01,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:01,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21402065] [2021-11-07 08:32:01,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:01,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:01,947 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-07 08:32:01,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:32:01,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21402065] [2021-11-07 08:32:01,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21402065] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:01,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461800220] [2021-11-07 08:32:01,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:01,948 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:32:01,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:01,958 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:32:01,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-11-07 08:32:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:02,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-07 08:32:02,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:32:02,140 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-07 08:32:02,167 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-07 08:32:02,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:32:02,259 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-07 08:32:02,259 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-07 08:32:02,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:32:02,482 INFO L354 Elim1Store]: treesize reduction 394, result has 10.0 percent of original size [2021-11-07 08:32:02,483 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-07 08:32:02,798 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [ULTIMATE.start_lis_~i~0] [2021-11-07 08:32:02,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 08:32:02,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-11-07 08:32:02,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650975101] [2021-11-07 08:32:02,799 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 08:32:02,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:02,799 INFO L85 PathProgramCache]: Analyzing trace with hash 178424733, now seen corresponding path program 5 times [2021-11-07 08:32:02,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:02,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106372710] [2021-11-07 08:32:02,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:02,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:02,836 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:02,849 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:03,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:32:03,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 08:32:03,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-11-07 08:32:03,698 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-07 08:32:03,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:32:03,993 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2021-11-07 08:32:03,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 08:32:03,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 93 transitions. [2021-11-07 08:32:03,994 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2021-11-07 08:32:03,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 93 transitions. [2021-11-07 08:32:03,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2021-11-07 08:32:03,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2021-11-07 08:32:03,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 93 transitions. [2021-11-07 08:32:03,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:32:03,997 INFO L681 BuchiCegarLoop]: Abstraction has 70 states and 93 transitions. [2021-11-07 08:32:03,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 93 transitions. [2021-11-07 08:32:03,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 37. [2021-11-07 08:32:04,000 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-07 08:32:04,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2021-11-07 08:32:04,000 INFO L704 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2021-11-07 08:32:04,001 INFO L587 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2021-11-07 08:32:04,001 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-11-07 08:32:04,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2021-11-07 08:32:04,001 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-11-07 08:32:04,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:32:04,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:32:04,002 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:32:04,003 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2021-11-07 08:32:04,003 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-07 08:32:04,003 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-07 08:32:04,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:04,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1523485369, now seen corresponding path program 2 times [2021-11-07 08:32:04,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:04,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459494835] [2021-11-07 08:32:04,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:04,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:04,018 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:04,034 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:04,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:04,035 INFO L85 PathProgramCache]: Analyzing trace with hash 178424733, now seen corresponding path program 6 times [2021-11-07 08:32:04,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:04,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415691355] [2021-11-07 08:32:04,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:04,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:04,048 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:04,061 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:04,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:04,061 INFO L85 PathProgramCache]: Analyzing trace with hash -840393243, now seen corresponding path program 2 times [2021-11-07 08:32:04,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:04,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233029558] [2021-11-07 08:32:04,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:04,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:04,150 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-07 08:32:04,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:32:04,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233029558] [2021-11-07 08:32:04,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233029558] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:04,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282867610] [2021-11-07 08:32:04,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 08:32:04,151 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:32:04,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:04,159 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:32:04,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-11-07 08:32:04,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-07 08:32:04,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:32:04,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-07 08:32:04,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:32:04,528 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-07 08:32:04,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282867610] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:04,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:32:04,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2021-11-07 08:32:04,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795266261] [2021-11-07 08:32:05,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:32:05,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 08:32:05,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-11-07 08:32:05,514 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-07 08:32:05,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:32:05,778 INFO L93 Difference]: Finished difference Result 107 states and 143 transitions. [2021-11-07 08:32:05,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 08:32:05,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 143 transitions. [2021-11-07 08:32:05,782 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2021-11-07 08:32:05,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 93 states and 125 transitions. [2021-11-07 08:32:05,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2021-11-07 08:32:05,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2021-11-07 08:32:05,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 125 transitions. [2021-11-07 08:32:05,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:32:05,784 INFO L681 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2021-11-07 08:32:05,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 125 transitions. [2021-11-07 08:32:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 65. [2021-11-07 08:32:05,788 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-07 08:32:05,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2021-11-07 08:32:05,788 INFO L704 BuchiCegarLoop]: Abstraction has 65 states and 86 transitions. [2021-11-07 08:32:05,788 INFO L587 BuchiCegarLoop]: Abstraction has 65 states and 86 transitions. [2021-11-07 08:32:05,789 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-11-07 08:32:05,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 86 transitions. [2021-11-07 08:32:05,789 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2021-11-07 08:32:05,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:32:05,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:32:05,796 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:32:05,796 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-11-07 08:32:05,796 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-07 08:32:05,796 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-07 08:32:05,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:05,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1523485369, now seen corresponding path program 3 times [2021-11-07 08:32:05,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:05,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062850670] [2021-11-07 08:32:05,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:05,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:05,819 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:05,835 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:05,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:05,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 2 times [2021-11-07 08:32:05,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:05,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406000292] [2021-11-07 08:32:05,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:05,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:05,844 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:05,851 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:05,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:05,852 INFO L85 PathProgramCache]: Analyzing trace with hash -423959456, now seen corresponding path program 3 times [2021-11-07 08:32:05,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:05,852 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865845564] [2021-11-07 08:32:05,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:05,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:05,872 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:05,896 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:07,992 INFO L210 LassoAnalysis]: Preferences: [2021-11-07 08:32:07,992 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-07 08:32:07,992 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-07 08:32:07,992 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-07 08:32:07,992 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-07 08:32:07,993 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:32:07,993 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-07 08:32:07,993 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-07 08:32:07,993 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration11_Lasso [2021-11-07 08:32:07,993 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-07 08:32:07,993 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-07 08:32:07,997 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-07 08:32:07,999 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-07 08:32:08,001 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-07 08:32:08,002 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-07 08:32:08,004 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-07 08:32:08,006 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-07 08:32:08,011 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-07 08:32:08,012 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-07 08:32:09,264 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-07 08:32:09,266 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-07 08:32:09,268 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-07 08:32:09,270 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-07 08:32:09,272 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-07 08:32:09,274 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-07 08:32:09,276 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-07 08:32:09,278 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-07 08:32:09,279 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-07 08:32:09,302 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-07 08:32:09,307 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-07 08:32:09,311 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-07 08:32:09,318 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-07 08:32:09,321 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-07 08:32:09,325 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-07 08:32:10,067 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-07 08:32:10,068 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-07 08:32:10,068 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:32:10,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:10,078 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:32:10,080 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-07 08:32:10,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:32:10,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:32:10,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:32:10,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:32:10,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:32:10,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:32:10,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:32:10,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-11-07 08:32:10,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:32:10,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-11-07 08:32:10,139 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:32:10,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:10,140 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:32:10,147 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-07 08:32:10,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:32:10,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:32:10,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:32:10,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:32:10,159 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:32:10,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:32:10,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-11-07 08:32:10,170 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:32:10,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-11-07 08:32:10,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:32:10,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:10,217 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:32:10,221 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-07 08:32:10,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:32:10,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:32:10,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:32:10,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:32:10,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:32:10,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:32:10,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:32:10,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-11-07 08:32:10,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:32:10,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-11-07 08:32:10,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:32:10,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:10,292 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:32:10,294 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-07 08:32:10,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:32:10,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:32:10,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:32:10,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:32:10,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:32:10,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:32:10,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-11-07 08:32:10,318 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:32:10,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2021-11-07 08:32:10,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:32:10,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:10,341 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:32:10,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-11-07 08:32:10,344 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-07 08:32:10,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:32:10,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:32:10,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:32:10,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:32:10,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:32:10,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:32:10,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:32:10,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:32:10,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-11-07 08:32:10,375 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:32:10,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:10,376 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:32:10,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-11-07 08:32:10,379 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-07 08:32:10,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:32:10,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:32:10,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:32:10,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:32:10,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:32:10,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:32:10,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:32:10,389 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:32:10,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-11-07 08:32:10,413 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:32:10,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:10,414 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:32:10,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-11-07 08:32:10,415 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-07 08:32:10,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:32:10,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:32:10,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:32:10,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:32:10,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:32:10,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:32:10,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:32:10,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:32:10,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2021-11-07 08:32:10,447 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:32:10,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:10,448 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:32:10,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-11-07 08:32:10,469 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-07 08:32:10,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:32:10,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:32:10,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:32:10,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:32:10,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:32:10,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:32:10,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:32:10,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2021-11-07 08:32:10,532 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:32:10,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:10,533 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:32:10,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-11-07 08:32:10,541 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-07 08:32:10,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:32:10,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:32:10,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:32:10,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:32:10,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:32:10,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:32:10,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:32:10,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-11-07 08:32:10,586 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:32:10,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:10,587 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:32:10,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-11-07 08:32:10,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-07 08:32:10,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:32:10,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:32:10,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:32:10,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:32:10,597 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:32:10,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:32:10,602 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:32:10,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2021-11-07 08:32:10,626 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:32:10,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:10,627 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:32:10,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-11-07 08:32:10,630 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-07 08:32:10,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:32:10,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:32:10,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:32:10,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:32:10,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:32:10,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:32:10,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:32:10,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2021-11-07 08:32:10,674 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:32:10,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:10,675 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:32:10,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-11-07 08:32:10,676 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-07 08:32:10,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:32:10,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:32:10,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:32:10,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:32:10,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:32:10,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:32:10,718 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:32:10,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2021-11-07 08:32:10,745 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:32:10,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:10,746 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:32:10,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-11-07 08:32:10,748 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-07 08:32:10,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:32:10,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:32:10,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:32:10,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:32:10,758 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:32:10,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:32:10,761 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:32:10,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-11-07 08:32:10,784 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:32:10,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:10,785 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:32:10,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-11-07 08:32:10,786 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-07 08:32:10,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:32:10,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:32:10,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:32:10,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:32:10,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:32:10,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:32:10,798 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:32:10,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2021-11-07 08:32:10,819 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:32:10,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:10,820 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:32:10,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-11-07 08:32:10,821 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-07 08:32:10,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:32:10,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:32:10,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:32:10,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:32:10,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:32:10,843 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:32:10,867 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-07 08:32:10,962 INFO L443 ModelExtractionUtils]: Simplification made 35 calls to the SMT solver. [2021-11-07 08:32:10,962 INFO L444 ModelExtractionUtils]: 23 out of 61 variables were initially zero. Simplification set additionally 35 variables to zero. [2021-11-07 08:32:10,962 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:32:10,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:10,964 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:32:10,965 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-07 08:32:10,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-11-07 08:32:10,973 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-07 08:32:10,973 INFO L513 LassoAnalysis]: Proved termination. [2021-11-07 08:32:10,973 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-07 08:32:10,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2021-11-07 08:32:11,182 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2021-11-07 08:32:11,308 INFO L297 tatePredicateManager]: 74 out of 77 supporting invariants were superfluous and have been removed [2021-11-07 08:32:11,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:11,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-07 08:32:11,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:32:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:11,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-07 08:32:11,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:32:11,902 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-07 08:32:11,902 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-07 08:32:11,903 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-07 08:32:11,941 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-07 08:32:11,946 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-07 08:32:11,946 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-07 08:32:11,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2021-11-07 08:32:11,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 20 letters. Loop has 4 letters. [2021-11-07 08:32:11,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:32:11,947 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-11-07 08:32:11,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:12,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-07 08:32:12,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:32:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:12,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-07 08:32:12,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:32:12,436 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-07 08:32:12,436 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-07 08:32:12,436 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-07 08:32:12,492 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-07 08:32:12,493 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-07 08:32:12,493 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-07 08:32:12,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2021-11-07 08:32:12,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 20 letters. Loop has 4 letters. [2021-11-07 08:32:12,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:32:12,494 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-11-07 08:32:12,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:12,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-07 08:32:12,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:32:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:13,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-07 08:32:13,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:32:13,064 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-07 08:32:13,065 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-07 08:32:13,065 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-07 08:32:13,227 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-07 08:32:13,227 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-07 08:32:13,227 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-07 08:32:13,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2021-11-07 08:32:13,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 58 transitions. Stem has 20 letters. Loop has 4 letters. [2021-11-07 08:32:13,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:32:13,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 58 transitions. Stem has 24 letters. Loop has 4 letters. [2021-11-07 08:32:13,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:32:13,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 58 transitions. Stem has 20 letters. Loop has 8 letters. [2021-11-07 08:32:13,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:32:13,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 109 transitions. [2021-11-07 08:32:13,230 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-11-07 08:32:13,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 53 states and 70 transitions. [2021-11-07 08:32:13,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-11-07 08:32:13,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2021-11-07 08:32:13,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 70 transitions. [2021-11-07 08:32:13,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:32:13,231 INFO L681 BuchiCegarLoop]: Abstraction has 53 states and 70 transitions. [2021-11-07 08:32:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 70 transitions. [2021-11-07 08:32:13,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2021-11-07 08:32:13,233 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-07 08:32:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2021-11-07 08:32:13,233 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 66 transitions. [2021-11-07 08:32:13,233 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 66 transitions. [2021-11-07 08:32:13,233 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-11-07 08:32:13,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 66 transitions. [2021-11-07 08:32:13,233 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-11-07 08:32:13,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:32:13,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:32:13,235 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-07 08:32:13,235 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2021-11-07 08:32:13,235 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-07 08:32:13,235 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-07 08:32:13,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:13,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1144628291, now seen corresponding path program 4 times [2021-11-07 08:32:13,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:13,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874182389] [2021-11-07 08:32:13,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:13,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:13,260 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:13,284 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:13,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:13,285 INFO L85 PathProgramCache]: Analyzing trace with hash 178424733, now seen corresponding path program 7 times [2021-11-07 08:32:13,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:13,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090699506] [2021-11-07 08:32:13,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:13,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:13,297 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:13,309 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:13,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash -494466533, now seen corresponding path program 4 times [2021-11-07 08:32:13,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:13,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033309950] [2021-11-07 08:32:13,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:13,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:13,383 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-07 08:32:13,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:32:13,383 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033309950] [2021-11-07 08:32:13,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033309950] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:13,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142386175] [2021-11-07 08:32:13,384 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 08:32:13,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:32:13,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:13,385 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:32:13,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2021-11-07 08:32:13,670 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 08:32:13,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:32:13,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-07 08:32:13,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:32:13,889 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-07 08:32:13,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142386175] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:13,889 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:32:13,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-11-07 08:32:13,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692443453] [2021-11-07 08:32:14,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:32:14,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 08:32:14,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-11-07 08:32:14,757 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-07 08:32:14,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:32:14,893 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2021-11-07 08:32:14,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 08:32:14,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 77 transitions. [2021-11-07 08:32:14,894 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2021-11-07 08:32:14,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 77 transitions. [2021-11-07 08:32:14,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-11-07 08:32:14,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-11-07 08:32:14,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 77 transitions. [2021-11-07 08:32:14,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:32:14,896 INFO L681 BuchiCegarLoop]: Abstraction has 57 states and 77 transitions. [2021-11-07 08:32:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 77 transitions. [2021-11-07 08:32:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2021-11-07 08:32:14,898 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-07 08:32:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2021-11-07 08:32:14,899 INFO L704 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2021-11-07 08:32:14,899 INFO L587 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2021-11-07 08:32:14,899 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-11-07 08:32:14,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 72 transitions. [2021-11-07 08:32:14,900 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-11-07 08:32:14,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:32:14,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:32:14,901 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:32:14,901 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1] [2021-11-07 08:32:14,902 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-07 08:32:14,902 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-07 08:32:14,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:14,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2129270651, now seen corresponding path program 1 times [2021-11-07 08:32:14,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:14,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902537364] [2021-11-07 08:32:14,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:14,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:14,929 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-07 08:32:14,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:32:14,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902537364] [2021-11-07 08:32:14,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902537364] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:32:14,930 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:32:14,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:32:14,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169885447] [2021-11-07 08:32:14,931 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 08:32:14,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:14,931 INFO L85 PathProgramCache]: Analyzing trace with hash -335947882, now seen corresponding path program 8 times [2021-11-07 08:32:14,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:14,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145805841] [2021-11-07 08:32:14,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:14,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:14,949 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:14,965 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:18,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:32:18,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:32:18,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:32:18,025 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-07 08:32:18,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:32:18,038 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2021-11-07 08:32:18,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:32:18,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 77 transitions. [2021-11-07 08:32:18,039 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2021-11-07 08:32:18,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 59 states and 76 transitions. [2021-11-07 08:32:18,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-11-07 08:32:18,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-11-07 08:32:18,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 76 transitions. [2021-11-07 08:32:18,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:32:18,040 INFO L681 BuchiCegarLoop]: Abstraction has 59 states and 76 transitions. [2021-11-07 08:32:18,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 76 transitions. [2021-11-07 08:32:18,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-11-07 08:32:18,043 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-07 08:32:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2021-11-07 08:32:18,044 INFO L704 BuchiCegarLoop]: Abstraction has 59 states and 76 transitions. [2021-11-07 08:32:18,044 INFO L587 BuchiCegarLoop]: Abstraction has 59 states and 76 transitions. [2021-11-07 08:32:18,044 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-11-07 08:32:18,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 76 transitions. [2021-11-07 08:32:18,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2021-11-07 08:32:18,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:32:18,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:32:18,046 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:32:18,047 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1] [2021-11-07 08:32:18,047 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-07 08:32:18,047 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-07 08:32:18,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:18,048 INFO L85 PathProgramCache]: Analyzing trace with hash -205154041, now seen corresponding path program 1 times [2021-11-07 08:32:18,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:18,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899141709] [2021-11-07 08:32:18,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:18,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:19,262 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-07 08:32:19,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:32:19,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899141709] [2021-11-07 08:32:19,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899141709] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:19,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502485144] [2021-11-07 08:32:19,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:19,264 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:32:19,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:19,266 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:32:19,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2021-11-07 08:32:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:19,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-07 08:32:19,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:32:19,618 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-07 08:32:19,684 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:32:19,685 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-07 08:32:19,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:32:19,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:32:19,855 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-07 08:32:19,855 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-07 08:32:20,144 INFO L354 Elim1Store]: treesize reduction 184, result has 20.3 percent of original size [2021-11-07 08:32:20,145 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-07 08:32:20,569 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [ULTIMATE.start_lis_~i~0] [2021-11-07 08:32:20,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 08:32:20,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2021-11-07 08:32:20,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72390003] [2021-11-07 08:32:20,571 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 08:32:20,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:20,572 INFO L85 PathProgramCache]: Analyzing trace with hash -335947882, now seen corresponding path program 9 times [2021-11-07 08:32:20,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:20,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016890439] [2021-11-07 08:32:20,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:20,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:20,616 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:20,646 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:23,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:32:23,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-07 08:32:23,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2021-11-07 08:32:23,145 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-07 08:32:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:32:25,788 INFO L93 Difference]: Finished difference Result 179 states and 235 transitions. [2021-11-07 08:32:25,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-07 08:32:25,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 235 transitions. [2021-11-07 08:32:25,790 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 31 [2021-11-07 08:32:25,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 156 states and 205 transitions. [2021-11-07 08:32:25,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2021-11-07 08:32:25,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2021-11-07 08:32:25,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 205 transitions. [2021-11-07 08:32:25,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:32:25,793 INFO L681 BuchiCegarLoop]: Abstraction has 156 states and 205 transitions. [2021-11-07 08:32:25,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 205 transitions. [2021-11-07 08:32:25,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 102. [2021-11-07 08:32:25,798 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-07 08:32:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 131 transitions. [2021-11-07 08:32:25,799 INFO L704 BuchiCegarLoop]: Abstraction has 102 states and 131 transitions. [2021-11-07 08:32:25,800 INFO L587 BuchiCegarLoop]: Abstraction has 102 states and 131 transitions. [2021-11-07 08:32:25,800 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-11-07 08:32:25,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 131 transitions. [2021-11-07 08:32:25,801 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2021-11-07 08:32:25,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:32:25,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:32:25,802 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-07 08:32:25,802 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1] [2021-11-07 08:32:25,803 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-07 08:32:25,803 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-07 08:32:25,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:25,804 INFO L85 PathProgramCache]: Analyzing trace with hash 800338629, now seen corresponding path program 5 times [2021-11-07 08:32:25,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:25,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361609406] [2021-11-07 08:32:25,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:25,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:25,846 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:25,899 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:25,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:25,902 INFO L85 PathProgramCache]: Analyzing trace with hash -335947882, now seen corresponding path program 10 times [2021-11-07 08:32:25,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:25,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232494672] [2021-11-07 08:32:25,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:25,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:25,923 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:25,940 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:25,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:25,940 INFO L85 PathProgramCache]: Analyzing trace with hash 248071250, now seen corresponding path program 6 times [2021-11-07 08:32:25,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:25,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595847220] [2021-11-07 08:32:25,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:25,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:26,090 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-07 08:32:26,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:32:26,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595847220] [2021-11-07 08:32:26,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595847220] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:26,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644732666] [2021-11-07 08:32:26,091 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-07 08:32:26,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:32:26,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:26,095 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:32:26,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2021-11-07 08:32:26,585 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2021-11-07 08:32:26,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:32:26,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-07 08:32:26,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:32:26,967 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-07 08:32:26,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644732666] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:26,967 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:32:26,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-11-07 08:32:26,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587861836] [2021-11-07 08:32:29,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:32:29,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 08:32:29,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2021-11-07 08:32:29,887 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-07 08:32:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:32:30,191 INFO L93 Difference]: Finished difference Result 195 states and 257 transitions. [2021-11-07 08:32:30,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 08:32:30,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 257 transitions. [2021-11-07 08:32:30,194 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 41 [2021-11-07 08:32:30,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 178 states and 235 transitions. [2021-11-07 08:32:30,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 133 [2021-11-07 08:32:30,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2021-11-07 08:32:30,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 235 transitions. [2021-11-07 08:32:30,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:32:30,198 INFO L681 BuchiCegarLoop]: Abstraction has 178 states and 235 transitions. [2021-11-07 08:32:30,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 235 transitions. [2021-11-07 08:32:30,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 120. [2021-11-07 08:32:30,203 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-07 08:32:30,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 156 transitions. [2021-11-07 08:32:30,205 INFO L704 BuchiCegarLoop]: Abstraction has 120 states and 156 transitions. [2021-11-07 08:32:30,205 INFO L587 BuchiCegarLoop]: Abstraction has 120 states and 156 transitions. [2021-11-07 08:32:30,205 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-11-07 08:32:30,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 156 transitions. [2021-11-07 08:32:30,207 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 31 [2021-11-07 08:32:30,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:32:30,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:32:30,208 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:32:30,208 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-11-07 08:32:30,209 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-07 08:32:30,209 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-07 08:32:30,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:30,210 INFO L85 PathProgramCache]: Analyzing trace with hash -885212411, now seen corresponding path program 2 times [2021-11-07 08:32:30,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:30,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47422158] [2021-11-07 08:32:30,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:30,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:31,445 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-07 08:32:31,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:32:31,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47422158] [2021-11-07 08:32:31,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47422158] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:31,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204071913] [2021-11-07 08:32:31,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 08:32:31,450 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:32:31,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:31,452 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:32:31,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2021-11-07 08:32:31,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-07 08:32:31,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:32:31,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-07 08:32:31,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:32:31,936 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-07 08:32:32,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:32:32,167 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-07 08:32:32,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:32:32,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:32:32,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:32:32,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:32:32,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:32:32,548 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:32:32,615 INFO L354 Elim1Store]: treesize reduction 291, result has 13.6 percent of original size [2021-11-07 08:32:32,615 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-07 08:32:33,035 INFO L354 Elim1Store]: treesize reduction 190, result has 1.6 percent of original size [2021-11-07 08:32:33,036 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-07 08:32:33,070 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-07 08:32:33,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204071913] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:33,071 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:32:33,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 27 [2021-11-07 08:32:33,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243087478] [2021-11-07 08:32:33,072 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 08:32:33,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:33,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 3 times [2021-11-07 08:32:33,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:33,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604905546] [2021-11-07 08:32:33,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:33,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:33,083 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:33,089 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:33,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:32:33,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-07 08:32:33,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2021-11-07 08:32:33,459 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-07 08:32:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:32:36,615 INFO L93 Difference]: Finished difference Result 286 states and 379 transitions. [2021-11-07 08:32:36,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-11-07 08:32:36,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 286 states and 379 transitions. [2021-11-07 08:32:36,619 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 93 [2021-11-07 08:32:36,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 286 states to 286 states and 379 transitions. [2021-11-07 08:32:36,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 203 [2021-11-07 08:32:36,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 203 [2021-11-07 08:32:36,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 379 transitions. [2021-11-07 08:32:36,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:32:36,625 INFO L681 BuchiCegarLoop]: Abstraction has 286 states and 379 transitions. [2021-11-07 08:32:36,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 379 transitions. [2021-11-07 08:32:36,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 199. [2021-11-07 08:32:36,632 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-07 08:32:36,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 264 transitions. [2021-11-07 08:32:36,633 INFO L704 BuchiCegarLoop]: Abstraction has 199 states and 264 transitions. [2021-11-07 08:32:36,634 INFO L587 BuchiCegarLoop]: Abstraction has 199 states and 264 transitions. [2021-11-07 08:32:36,634 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-11-07 08:32:36,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 199 states and 264 transitions. [2021-11-07 08:32:36,635 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 58 [2021-11-07 08:32:36,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:32:36,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:32:36,637 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:32:36,637 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-11-07 08:32:36,637 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-07 08:32:36,637 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-07 08:32:36,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:36,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1480396999, now seen corresponding path program 1 times [2021-11-07 08:32:36,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:36,638 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649312713] [2021-11-07 08:32:36,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:36,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:37,300 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-07 08:32:37,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:32:37,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649312713] [2021-11-07 08:32:37,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649312713] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:32:37,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674234969] [2021-11-07 08:32:37,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:37,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:32:37,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:32:37,306 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:32:37,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2021-11-07 08:32:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:32:37,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-07 08:32:37,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:32:37,838 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-07 08:32:37,899 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-07 08:32:38,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:32:38,032 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-07 08:32:38,032 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-07 08:32:38,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:32:38,273 INFO L354 Elim1Store]: treesize reduction 432, result has 10.0 percent of original size [2021-11-07 08:32:38,274 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-07 08:32:38,602 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [ULTIMATE.start_lis_~i~0] [2021-11-07 08:32:38,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 08:32:38,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2021-11-07 08:32:38,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466711454] [2021-11-07 08:32:38,603 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 08:32:38,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:38,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2129256, now seen corresponding path program 2 times [2021-11-07 08:32:38,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:38,604 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539111189] [2021-11-07 08:32:38,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:38,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:38,613 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:38,660 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:38,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:32:38,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 08:32:38,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2021-11-07 08:32:38,750 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-07 08:32:39,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:32:39,487 INFO L93 Difference]: Finished difference Result 270 states and 361 transitions. [2021-11-07 08:32:39,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-07 08:32:39,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 361 transitions. [2021-11-07 08:32:39,490 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 68 [2021-11-07 08:32:39,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 248 states and 331 transitions. [2021-11-07 08:32:39,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 164 [2021-11-07 08:32:39,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 164 [2021-11-07 08:32:39,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 248 states and 331 transitions. [2021-11-07 08:32:39,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:32:39,496 INFO L681 BuchiCegarLoop]: Abstraction has 248 states and 331 transitions. [2021-11-07 08:32:39,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states and 331 transitions. [2021-11-07 08:32:39,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 199. [2021-11-07 08:32:39,502 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-07 08:32:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 263 transitions. [2021-11-07 08:32:39,504 INFO L704 BuchiCegarLoop]: Abstraction has 199 states and 263 transitions. [2021-11-07 08:32:39,504 INFO L587 BuchiCegarLoop]: Abstraction has 199 states and 263 transitions. [2021-11-07 08:32:39,504 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-11-07 08:32:39,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 199 states and 263 transitions. [2021-11-07 08:32:39,506 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 58 [2021-11-07 08:32:39,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:32:39,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:32:39,507 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-07 08:32:39,507 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-11-07 08:32:39,508 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-07 08:32:39,508 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-07 08:32:39,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:39,509 INFO L85 PathProgramCache]: Analyzing trace with hash 800338629, now seen corresponding path program 7 times [2021-11-07 08:32:39,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:39,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351762030] [2021-11-07 08:32:39,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:39,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:39,547 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:39,595 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:39,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:39,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2129256, now seen corresponding path program 3 times [2021-11-07 08:32:39,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:39,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501656198] [2021-11-07 08:32:39,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:39,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:39,603 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:39,607 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:39,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:32:39,607 INFO L85 PathProgramCache]: Analyzing trace with hash 20295212, now seen corresponding path program 8 times [2021-11-07 08:32:39,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:32:39,608 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729652064] [2021-11-07 08:32:39,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:32:39,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:32:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:39,661 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:32:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:32:39,754 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:32:53,426 WARN L207 SmtUtils]: Spent 13.58 s on a formula simplification. DAG size of input: 359 DAG size of output: 236 [2021-11-07 08:33:00,163 INFO L210 LassoAnalysis]: Preferences: [2021-11-07 08:33:00,163 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-07 08:33:00,163 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-07 08:33:00,163 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-07 08:33:00,163 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-07 08:33:00,163 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:00,163 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-07 08:33:00,163 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-07 08:33:00,163 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration18_Lasso [2021-11-07 08:33:00,163 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-07 08:33:00,163 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-07 08:33:00,168 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-07 08:33:00,172 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-07 08:33:00,174 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-07 08:33:00,177 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-07 08:33:00,179 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-07 08:33:00,183 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-07 08:33:00,186 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-07 08:33:00,188 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-07 08:33:00,191 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-07 08:33:00,194 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-07 08:33:00,197 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-07 08:33:00,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-07 08:33:04,547 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-07 08:33:04,550 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-07 08:33:04,553 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-07 08:33:04,555 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-07 08:33:04,557 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-07 08:33:04,559 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-07 08:33:04,561 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-07 08:33:04,563 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-07 08:33:04,565 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-07 08:33:04,567 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-07 08:33:04,570 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-07 08:33:04,573 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-07 08:33:05,193 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-07 08:33:05,193 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-07 08:33:05,193 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:05,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:05,197 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:05,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-11-07 08:33: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-07 08:33:05,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:05,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:33:05,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:05,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:05,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:05,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:33:05,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:33:05,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:05,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2021-11-07 08:33:05,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:05,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:05,240 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:05,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-11-07 08:33:05,243 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-07 08:33:05,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:05,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:33:05,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:05,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:05,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:05,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:33:05,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:33:05,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:05,278 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2021-11-07 08:33:05,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:05,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:05,279 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:05,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-11-07 08:33:05,281 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-07 08:33:05,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:05,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:05,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:05,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:05,293 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:33:05,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:33:05,310 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:05,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2021-11-07 08:33:05,345 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:05,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:05,346 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:05,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-11-07 08:33:05,349 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-07 08:33:05,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:05,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:33:05,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:05,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:05,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:05,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:33:05,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:33:05,360 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:05,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2021-11-07 08:33:05,385 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:05,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:05,386 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:05,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2021-11-07 08:33:05,387 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-07 08:33:05,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:05,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:33:05,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:05,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:05,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:05,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:33:05,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:33:05,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:05,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2021-11-07 08:33:05,423 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:05,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:05,423 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:05,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2021-11-07 08:33:05,425 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-07 08:33:05,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:05,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:05,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:05,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:05,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:33:05,437 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:33:05,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:05,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2021-11-07 08:33:05,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:05,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:05,477 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:05,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2021-11-07 08:33:05,478 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-07 08:33:05,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:05,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:33:05,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:05,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:05,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:05,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:33:05,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:33:05,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:05,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2021-11-07 08:33:05,516 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:05,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:05,518 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:05,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2021-11-07 08:33:05,527 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-07 08:33:05,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:05,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:33:05,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:05,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:05,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:05,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:33:05,537 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:33:05,538 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:05,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2021-11-07 08:33:05,563 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:05,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:05,563 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:05,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-11-07 08:33:05,567 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-07 08:33:05,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:05,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:05,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:05,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:05,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:33:05,578 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:33:05,582 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:05,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2021-11-07 08:33:05,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:05,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:05,608 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:05,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-11-07 08:33:05,610 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-07 08:33:05,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:05,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:05,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:05,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:05,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:33:05,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:33:05,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:05,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2021-11-07 08:33:05,649 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:05,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:05,650 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:05,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2021-11-07 08:33:05,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-07 08:33:05,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:05,663 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:33:05,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:05,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:05,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:05,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:33:05,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:33:05,665 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:05,690 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2021-11-07 08:33:05,690 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:05,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:05,691 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:05,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-11-07 08:33:05,693 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-07 08:33:05,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:05,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:05,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:05,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:05,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:33:05,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:33:05,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:05,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2021-11-07 08:33:05,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:05,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:05,734 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:05,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-11-07 08:33:05,736 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-07 08:33:05,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:05,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:05,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:05,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:05,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:33:05,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:33:05,749 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:05,773 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2021-11-07 08:33:05,773 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:05,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:05,774 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:05,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-11-07 08:33:05,776 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-07 08:33:05,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:05,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:05,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:05,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:05,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:33:05,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:33:05,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:05,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2021-11-07 08:33:05,813 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:05,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:05,813 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:05,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-11-07 08:33:05,815 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-07 08:33:05,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:05,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:05,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:05,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:05,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:33:05,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:33:05,854 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:05,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2021-11-07 08:33:05,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:05,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:05,891 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:05,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-11-07 08:33:05,893 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-07 08:33:05,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:05,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:05,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:05,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:05,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:33:05,903 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:33:05,906 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:05,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2021-11-07 08:33:05,930 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:05,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:05,931 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:05,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-11-07 08:33:05,932 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-07 08:33:05,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:05,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:05,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:05,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:05,942 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:33:05,943 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:33:05,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:05,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2021-11-07 08:33:05,971 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:05,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:05,972 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:05,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-11-07 08:33:05,973 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-07 08:33:05,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:05,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:05,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:05,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:05,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:33:05,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:33:05,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:06,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2021-11-07 08:33:06,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:06,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:06,012 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:06,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2021-11-07 08:33:06,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-07 08:33:06,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:06,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:06,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:06,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:06,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:33:06,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:33:06,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:06,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2021-11-07 08:33:06,053 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:06,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:06,054 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:06,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2021-11-07 08:33:06,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-07 08:33:06,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:06,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:06,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:06,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:06,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:33:06,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:33:06,070 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:06,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2021-11-07 08:33:06,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:06,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:06,095 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:06,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2021-11-07 08:33:06,097 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-07 08:33:06,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:06,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:06,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:06,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:06,107 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:33:06,107 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:33:06,109 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:06,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2021-11-07 08:33:06,133 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:06,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:06,134 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:06,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2021-11-07 08:33:06,137 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-07 08:33:06,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:06,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:06,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:06,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:06,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:33:06,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:33:06,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:06,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2021-11-07 08:33:06,175 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:06,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:06,176 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:06,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2021-11-07 08:33:06,178 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-07 08:33:06,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:06,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:06,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:06,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:06,202 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:33:06,202 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:33:06,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:06,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2021-11-07 08:33:06,248 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:06,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:06,248 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:06,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2021-11-07 08:33:06,250 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-07 08:33:06,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:06,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:06,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:06,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:06,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:33:06,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:33:06,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:06,287 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2021-11-07 08:33:06,287 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:06,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:06,288 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:06,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2021-11-07 08:33:06,289 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-07 08:33:06,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:06,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:06,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:06,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:06,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:33:06,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:33:06,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:06,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2021-11-07 08:33:06,328 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:06,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:06,329 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:06,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2021-11-07 08:33:06,331 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-07 08:33:06,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:06,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:06,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:06,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:06,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:33:06,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:33:06,378 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:06,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2021-11-07 08:33:06,404 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:06,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:06,405 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:06,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2021-11-07 08:33:06,408 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-07 08:33:06,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:06,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:33:06,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:06,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:06,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:06,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:33:06,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:33:06,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:06,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2021-11-07 08:33:06,444 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:06,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:06,445 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:06,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2021-11-07 08:33:06,447 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-07 08:33:06,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:06,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 08:33:06,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:06,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:06,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:06,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 08:33:06,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 08:33:06,458 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 08:33:06,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2021-11-07 08:33:06,484 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:06,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:06,485 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:06,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2021-11-07 08:33:06,486 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-07 08:33:06,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 08:33:06,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 08:33:06,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 08:33:06,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 08:33:06,506 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 08:33:06,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 08:33:06,527 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-07 08:33:06,617 INFO L443 ModelExtractionUtils]: Simplification made 33 calls to the SMT solver. [2021-11-07 08:33:06,617 INFO L444 ModelExtractionUtils]: 16 out of 46 variables were initially zero. Simplification set additionally 27 variables to zero. [2021-11-07 08:33:06,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:33:06,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:06,626 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:33:06,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2021-11-07 08:33:06,628 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-07 08:33:06,660 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-07 08:33:06,660 INFO L513 LassoAnalysis]: Proved termination. [2021-11-07 08:33:06,661 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-07 08:33:06,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2021-11-07 08:33:07,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2021-11-07 08:33:07,453 INFO L297 tatePredicateManager]: 106 out of 107 supporting invariants were superfluous and have been removed [2021-11-07 08:33:07,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:33:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:33:07,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-07 08:33:07,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:33:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:33:07,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 08:33:07,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:33:07,750 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-07 08:33:07,751 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-07 08:33:07,751 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-07 08:33:07,798 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-07 08:33:07,799 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-07 08:33:07,799 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-07 08:33:07,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2021-11-07 08:33:07,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 33 letters. Loop has 4 letters. [2021-11-07 08:33:07,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:33:07,800 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-11-07 08:33:07,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:33:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:33:07,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-07 08:33:07,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:33:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:33:08,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 08:33:08,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:33:08,126 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-07 08:33:08,126 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-07 08:33:08,127 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-07 08:33:08,176 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-07 08:33:08,177 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-07 08:33:08,177 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-07 08:33:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2021-11-07 08:33:08,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 33 letters. Loop has 4 letters. [2021-11-07 08:33:08,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:33:08,178 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-11-07 08:33:08,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:33:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:33:08,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-07 08:33:08,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:33:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:33:08,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 08:33:08,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:33:08,547 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-07 08:33:08,548 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-07 08:33:08,548 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-07 08:33:08,727 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-07 08:33:08,727 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-07 08:33:08,728 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-07 08:33:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2021-11-07 08:33:08,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 33 letters. Loop has 4 letters. [2021-11-07 08:33:08,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:33:08,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 37 letters. Loop has 4 letters. [2021-11-07 08:33:08,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:33:08,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 33 letters. Loop has 8 letters. [2021-11-07 08:33:08,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 08:33:08,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 238 states and 324 transitions. [2021-11-07 08:33:08,733 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 43 [2021-11-07 08:33:08,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 238 states to 144 states and 191 transitions. [2021-11-07 08:33:08,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2021-11-07 08:33:08,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2021-11-07 08:33:08,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 191 transitions. [2021-11-07 08:33:08,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 08:33:08,735 INFO L681 BuchiCegarLoop]: Abstraction has 144 states and 191 transitions. [2021-11-07 08:33:08,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 191 transitions. [2021-11-07 08:33:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-11-07 08:33:08,743 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-07 08:33:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 191 transitions. [2021-11-07 08:33:08,744 INFO L704 BuchiCegarLoop]: Abstraction has 144 states and 191 transitions. [2021-11-07 08:33:08,745 INFO L587 BuchiCegarLoop]: Abstraction has 144 states and 191 transitions. [2021-11-07 08:33:08,745 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-11-07 08:33:08,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 144 states and 191 transitions. [2021-11-07 08:33:08,746 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 43 [2021-11-07 08:33:08,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:33:08,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:33:08,755 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:33:08,755 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1, 1] [2021-11-07 08:33:08,756 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-07 08:33:08,756 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-07 08:33:08,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:33:08,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1549338680, now seen corresponding path program 3 times [2021-11-07 08:33:08,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:33:08,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108077197] [2021-11-07 08:33:08,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:33:08,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:33:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:33:09,580 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-07 08:33:09,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:33:09,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108077197] [2021-11-07 08:33:09,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108077197] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:33:09,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970881181] [2021-11-07 08:33:09,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 08:33:09,581 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:33:09,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:33:09,583 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:33:09,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8de95332-2894-42c4-b938-60c723e03624/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2021-11-07 08:33:10,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-11-07 08:33:10,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 08:33:10,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 68 conjunts are in the unsatisfiable core [2021-11-07 08:33:10,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:33:10,612 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-07 08:33:10,677 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-07 08:33:10,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:10,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:10,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:10,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:10,809 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:10,810 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:10,818 INFO L354 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2021-11-07 08:33:10,818 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-07 08:33:11,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,026 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:11,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:11,030 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:11,040 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-07 08:33:11,040 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-07 08:33:11,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,327 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:11,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,333 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:11,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,336 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:11,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,339 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:11,354 INFO L354 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2021-11-07 08:33:11,355 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-07 08:33:11,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,723 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:11,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,730 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:11,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,732 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:11,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:11,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:11,739 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:11,752 INFO L354 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2021-11-07 08:33:11,752 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-07 08:33:12,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:12,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:12,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:12,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:12,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:12,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:12,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:12,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:12,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:12,839 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:12,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:12,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:12,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:12,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:12,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:12,844 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:12,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:12,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:12,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:12,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:12,864 INFO L354 Elim1Store]: treesize reduction 59, result has 15.7 percent of original size [2021-11-07 08:33:12,865 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-07 08:33:13,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:13,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:13,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:13,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:13,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:13,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:13,764 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:13,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:13,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:13,767 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:13,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:13,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:13,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:13,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:13,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:13,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:13,774 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:13,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:13,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:13,778 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:14,423 INFO L354 Elim1Store]: treesize reduction 1150, result has 17.3 percent of original size [2021-11-07 08:33:14,424 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-07 08:33:16,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:16,978 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:16,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:16,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:16,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:16,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:16,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:16,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:16,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:16,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:16,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:16,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:16,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:16,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:16,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:16,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:16,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:16,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:16,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:16,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:17,947 INFO L354 Elim1Store]: treesize reduction 1500, result has 17.5 percent of original size [2021-11-07 08:33:17,948 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-07 08:33:25,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:25,605 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:25,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:25,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:25,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:25,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:25,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:25,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:25,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:25,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:25,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:25,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:25,619 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:25,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:25,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:25,624 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:25,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:25,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:25,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:33:25,628 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:33:27,329 INFO L354 Elim1Store]: treesize reduction 1978, result has 17.5 percent of original size [2021-11-07 08:33:27,329 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-07 08:37:25,569 WARN L207 SmtUtils]: Spent 10.09 s on a formula simplification. DAG size of input: 455 DAG size of output: 310 [2021-11-07 08:37:52,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:37:52,148 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:37:52,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:37:52,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:37:52,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:37:52,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:37:52,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:37:52,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:37:52,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:37:52,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:37:52,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:37:52,169 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:37:52,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:37:52,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:37:52,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:37:52,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 08:37:57,466 WARN L207 SmtUtils]: Spent 5.29 s on a formula simplification. DAG size of input: 892 DAG size of output: 187 [2021-11-07 08:37:57,467 INFO L354 Elim1Store]: treesize reduction 3593, result has 11.9 percent of original size [2021-11-07 08:37:57,468 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