./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --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 32bit --witnessprinter.graph.data.programhash 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:15:18,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:15:18,908 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-31 22:15:18,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:15:18,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:15:18,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:15:18,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:15:18,934 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:15:18,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:15:18,935 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:15:18,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:15:18,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:15:18,936 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:15:18,936 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-31 22:15:18,937 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-31 22:15:18,937 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-31 22:15:18,937 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-31 22:15:18,938 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-31 22:15:18,938 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-31 22:15:18,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:15:18,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-31 22:15:18,939 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:15:18,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:15:18,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:15:18,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:15:18,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-31 22:15:18,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-31 22:15:18,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-31 22:15:18,941 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:15:18,942 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:15:18,942 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:15:18,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:15:18,942 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-31 22:15:18,943 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:15:18,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:15:18,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:15:18,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:15:18,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:15:18,945 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-31 22:15:18,945 INFO L153 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_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/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_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b [2024-10-31 22:15:19,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:15:19,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:15:19,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:15:19,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:15:19,281 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:15:19,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c Unable to find full path for "g++" [2024-10-31 22:15:21,368 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:15:21,566 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:15:21,567 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2024-10-31 22:15:21,577 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/data/eea378092/53ada08488dd4378824c9e6a50e1da52/FLAG766cd62e4 [2024-10-31 22:15:21,601 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/data/eea378092/53ada08488dd4378824c9e6a50e1da52 [2024-10-31 22:15:21,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:15:21,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:15:21,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:15:21,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:15:21,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:15:21,620 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:15:21" (1/1) ... [2024-10-31 22:15:21,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@510d9815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:21, skipping insertion in model container [2024-10-31 22:15:21,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:15:21" (1/1) ... [2024-10-31 22:15:21,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:15:21,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:15:21,913 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:15:21,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:15:21,957 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:15:21,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:21 WrapperNode [2024-10-31 22:15:21,958 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:15:21,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:15:21,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:15:21,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:15:21,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:21" (1/1) ... [2024-10-31 22:15:21,979 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:21" (1/1) ... [2024-10-31 22:15:22,002 INFO L138 Inliner]: procedures = 13, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2024-10-31 22:15:22,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:15:22,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:15:22,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:15:22,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:15:22,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:21" (1/1) ... [2024-10-31 22:15:22,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:21" (1/1) ... [2024-10-31 22:15:22,019 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:21" (1/1) ... [2024-10-31 22:15:22,045 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 6, 6]. 43 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 1]. The 4 writes are split as follows [0, 2, 2]. [2024-10-31 22:15:22,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:21" (1/1) ... [2024-10-31 22:15:22,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:21" (1/1) ... [2024-10-31 22:15:22,058 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:21" (1/1) ... [2024-10-31 22:15:22,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:21" (1/1) ... [2024-10-31 22:15:22,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:21" (1/1) ... [2024-10-31 22:15:22,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:21" (1/1) ... [2024-10-31 22:15:22,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:15:22,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:15:22,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:15:22,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:15:22,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:21" (1/1) ... [2024-10-31 22:15:22,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:22,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:22,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:22,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-31 22:15:22,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:15:22,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:15:22,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:15:22,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-31 22:15:22,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-31 22:15:22,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:15:22,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:15:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 22:15:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2024-10-31 22:15:22,172 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2024-10-31 22:15:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:15:22,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:15:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:15:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:15:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-31 22:15:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2024-10-31 22:15:22,173 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2024-10-31 22:15:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 22:15:22,290 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:15:22,292 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:15:22,530 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-31 22:15:22,530 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:15:22,546 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:15:22,546 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:15:22,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:15:22 BoogieIcfgContainer [2024-10-31 22:15:22,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:15:22,549 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-31 22:15:22,549 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-31 22:15:22,554 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-31 22:15:22,555 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 22:15:22,556 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.10 10:15:21" (1/3) ... [2024-10-31 22:15:22,558 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19c1eefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.10 10:15:22, skipping insertion in model container [2024-10-31 22:15:22,558 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 22:15:22,559 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:21" (2/3) ... [2024-10-31 22:15:22,559 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19c1eefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.10 10:15:22, skipping insertion in model container [2024-10-31 22:15:22,559 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 22:15:22,560 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:15:22" (3/3) ... [2024-10-31 22:15:22,561 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_2.c [2024-10-31 22:15:22,633 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-31 22:15:22,633 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-31 22:15:22,633 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-31 22:15:22,633 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-31 22:15:22,634 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-31 22:15:22,634 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-31 22:15:22,634 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-31 22:15:22,634 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-31 22:15:22,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-31 22:15:22,669 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-31 22:15:22,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:15:22,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:15:22,677 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-31 22:15:22,677 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:22,677 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-31 22:15:22,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-31 22:15:22,680 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-31 22:15:22,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:15:22,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:15:22,681 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-31 22:15:22,681 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:22,690 INFO L745 eck$LassoCheckResult]: Stem: 19#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem10#1, main_#t~mem11#1, main_#t~short12#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 21#L65true call func_to_recursive_line_20_to_21_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 22#$Ultimate##0true [2024-10-31 22:15:22,691 INFO L747 eck$LassoCheckResult]: Loop: 22#$Ultimate##0true ~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem7 := read~int#2(~a.base, ~a.offset, 4); 10#L41true assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~b.base, ~b.offset, 4); 14#L47true call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 11#$Ultimate##0true ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 8#L25true assume !(#t~mem4 < 6);havoc #t~mem4; 4#L25-1true assume true; 13#func_to_recursive_line_21_to_21_0EXITtrue >#44#return; 18#L47-1true call #t~mem8 := read~int#2(~a.base, ~a.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~a.base, ~a.offset, 4);havoc #t~mem8;havoc #t~pre9; 5#L52true call func_to_recursive_line_20_to_21_0(~b.base, ~b.offset, ~a.base, ~a.offset);< 22#$Ultimate##0true [2024-10-31 22:15:22,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:22,701 INFO L85 PathProgramCache]: Analyzing trace with hash 40812, now seen corresponding path program 1 times [2024-10-31 22:15:22,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:22,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662285973] [2024-10-31 22:15:22,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:22,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:22,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:15:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:22,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:15:22,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:22,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1256528503, now seen corresponding path program 1 times [2024-10-31 22:15:22,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:22,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646647087] [2024-10-31 22:15:22,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:22,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:23,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-31 22:15:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:15:23,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:23,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646647087] [2024-10-31 22:15:23,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646647087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:23,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:23,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:15:23,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871966104] [2024-10-31 22:15:23,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:23,491 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:15:23,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:23,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:15:23,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:15:23,538 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 22:15:23,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:23,689 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2024-10-31 22:15:23,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2024-10-31 22:15:23,697 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-31 22:15:23,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 15 states and 17 transitions. [2024-10-31 22:15:23,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-31 22:15:23,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-10-31 22:15:23,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2024-10-31 22:15:23,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:15:23,710 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-10-31 22:15:23,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2024-10-31 22:15:23,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-31 22:15:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-31 22:15:23,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-10-31 22:15:23,740 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-10-31 22:15:23,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:15:23,746 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-10-31 22:15:23,746 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-31 22:15:23,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2024-10-31 22:15:23,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-31 22:15:23,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:15:23,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:15:23,747 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-31 22:15:23,747 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:23,748 INFO L745 eck$LassoCheckResult]: Stem: 82#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 77#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem10#1, main_#t~mem11#1, main_#t~short12#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 74#L65 call func_to_recursive_line_20_to_21_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 75#$Ultimate##0 [2024-10-31 22:15:23,748 INFO L747 eck$LassoCheckResult]: Loop: 75#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem7 := read~int#2(~a.base, ~a.offset, 4); 78#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~b.base, ~b.offset, 4); 70#L47 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 79#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 76#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 71#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 79#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 76#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 69#L25-1 assume true; 72#func_to_recursive_line_21_to_21_0EXIT >#50#return; 80#L25-1 assume true; 83#func_to_recursive_line_21_to_21_0EXIT >#44#return; 81#L47-1 call #t~mem8 := read~int#2(~a.base, ~a.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~a.base, ~a.offset, 4);havoc #t~mem8;havoc #t~pre9; 73#L52 call func_to_recursive_line_20_to_21_0(~b.base, ~b.offset, ~a.base, ~a.offset);< 75#$Ultimate##0 [2024-10-31 22:15:23,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:23,749 INFO L85 PathProgramCache]: Analyzing trace with hash 40812, now seen corresponding path program 2 times [2024-10-31 22:15:23,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:23,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723127872] [2024-10-31 22:15:23,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:23,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:23,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:15:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:23,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:15:23,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:23,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1085452703, now seen corresponding path program 1 times [2024-10-31 22:15:23,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:23,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243977727] [2024-10-31 22:15:23,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:23,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:24,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-31 22:15:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:24,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-31 22:15:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:24,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:15:24,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:24,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243977727] [2024-10-31 22:15:24,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243977727] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:15:24,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578079291] [2024-10-31 22:15:24,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:24,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:15:24,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:24,494 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:15:24,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:15:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:24,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-31 22:15:24,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:15:24,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-31 22:15:25,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:15:25,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:15:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:15:25,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578079291] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:15:25,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:15:25,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2024-10-31 22:15:25,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271746050] [2024-10-31 22:15:25,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:15:25,587 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:15:25,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:25,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-31 22:15:25,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2024-10-31 22:15:25,590 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand has 22 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-31 22:15:25,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:25,921 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-10-31 22:15:25,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2024-10-31 22:15:25,923 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-31 22:15:25,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2024-10-31 22:15:25,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-31 22:15:25,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-10-31 22:15:25,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2024-10-31 22:15:25,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:15:25,925 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-10-31 22:15:25,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2024-10-31 22:15:25,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-31 22:15:25,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-31 22:15:25,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-10-31 22:15:25,928 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-10-31 22:15:25,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:15:25,929 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-10-31 22:15:25,930 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-31 22:15:25,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2024-10-31 22:15:25,931 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-31 22:15:25,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:15:25,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:15:25,932 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-31 22:15:25,932 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:25,932 INFO L745 eck$LassoCheckResult]: Stem: 242#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 237#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem10#1, main_#t~mem11#1, main_#t~short12#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 234#L65 call func_to_recursive_line_20_to_21_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 235#$Ultimate##0 [2024-10-31 22:15:25,932 INFO L747 eck$LassoCheckResult]: Loop: 235#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem7 := read~int#2(~a.base, ~a.offset, 4); 238#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~b.base, ~b.offset, 4); 231#L47 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 239#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 230#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 239#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 230#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 239#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 230#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 239#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 236#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 229#L25-1 assume true; 232#func_to_recursive_line_21_to_21_0EXIT >#50#return; 240#L25-1 assume true; 247#func_to_recursive_line_21_to_21_0EXIT >#50#return; 246#L25-1 assume true; 245#func_to_recursive_line_21_to_21_0EXIT >#50#return; 244#L25-1 assume true; 243#func_to_recursive_line_21_to_21_0EXIT >#44#return; 241#L47-1 call #t~mem8 := read~int#2(~a.base, ~a.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~a.base, ~a.offset, 4);havoc #t~mem8;havoc #t~pre9; 233#L52 call func_to_recursive_line_20_to_21_0(~b.base, ~b.offset, ~a.base, ~a.offset);< 235#$Ultimate##0 [2024-10-31 22:15:25,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:25,933 INFO L85 PathProgramCache]: Analyzing trace with hash 40812, now seen corresponding path program 3 times [2024-10-31 22:15:25,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:25,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370933733] [2024-10-31 22:15:25,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:25,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:25,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:15:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:25,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:15:25,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:25,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1462582353, now seen corresponding path program 2 times [2024-10-31 22:15:25,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:25,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988793700] [2024-10-31 22:15:25,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:25,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-31 22:15:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-31 22:15:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-31 22:15:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-31 22:15:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,923 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-31 22:15:26,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:26,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988793700] [2024-10-31 22:15:26,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988793700] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:15:26,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953451084] [2024-10-31 22:15:26,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-31 22:15:26,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:15:26,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:26,934 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:15:26,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 22:15:27,014 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-31 22:15:27,015 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 22:15:27,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-10-31 22:15:27,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:15:27,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-31 22:15:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-31 22:15:27,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:15:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:15:28,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953451084] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:15:28,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:15:28,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 18] total 29 [2024-10-31 22:15:28,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408283512] [2024-10-31 22:15:28,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:15:28,790 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:15:28,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:28,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-31 22:15:28,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2024-10-31 22:15:28,792 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 4 Second operand has 29 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-31 22:15:29,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:29,097 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-10-31 22:15:29,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2024-10-31 22:15:29,098 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-31 22:15:29,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 23 transitions. [2024-10-31 22:15:29,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-10-31 22:15:29,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-10-31 22:15:29,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2024-10-31 22:15:29,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:15:29,100 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-10-31 22:15:29,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2024-10-31 22:15:29,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-31 22:15:29,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-31 22:15:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-10-31 22:15:29,104 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-10-31 22:15:29,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:15:29,107 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-10-31 22:15:29,107 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-31 22:15:29,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2024-10-31 22:15:29,108 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-31 22:15:29,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:15:29,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:15:29,109 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-31 22:15:29,109 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:29,109 INFO L745 eck$LassoCheckResult]: Stem: 507#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 502#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem10#1, main_#t~mem11#1, main_#t~short12#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 498#L65 call func_to_recursive_line_20_to_21_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 499#$Ultimate##0 [2024-10-31 22:15:29,109 INFO L747 eck$LassoCheckResult]: Loop: 499#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem7 := read~int#2(~a.base, ~a.offset, 4); 503#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~b.base, ~b.offset, 4); 495#L47 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 504#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 500#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 494#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 504#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 500#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 494#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 504#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 500#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 494#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 504#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 500#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 494#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 504#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 500#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 501#L25-1 assume true; 505#func_to_recursive_line_21_to_21_0EXIT >#50#return; 493#L25-1 assume true; 496#func_to_recursive_line_21_to_21_0EXIT >#50#return; 513#L25-1 assume true; 512#func_to_recursive_line_21_to_21_0EXIT >#50#return; 511#L25-1 assume true; 510#func_to_recursive_line_21_to_21_0EXIT >#50#return; 509#L25-1 assume true; 508#func_to_recursive_line_21_to_21_0EXIT >#44#return; 506#L47-1 call #t~mem8 := read~int#2(~a.base, ~a.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~a.base, ~a.offset, 4);havoc #t~mem8;havoc #t~pre9; 497#L52 call func_to_recursive_line_20_to_21_0(~b.base, ~b.offset, ~a.base, ~a.offset);< 499#$Ultimate##0 [2024-10-31 22:15:29,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:29,110 INFO L85 PathProgramCache]: Analyzing trace with hash 40812, now seen corresponding path program 4 times [2024-10-31 22:15:29,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:29,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805325221] [2024-10-31 22:15:29,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:29,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:29,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:15:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:29,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:15:29,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:29,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1353511273, now seen corresponding path program 3 times [2024-10-31 22:15:29,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:29,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059374833] [2024-10-31 22:15:29,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:29,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-31 22:15:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:30,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-31 22:15:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:30,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-31 22:15:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:30,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-31 22:15:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:30,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-31 22:15:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-31 22:15:30,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:30,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059374833] [2024-10-31 22:15:30,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059374833] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:15:30,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064849029] [2024-10-31 22:15:30,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-31 22:15:30,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:15:30,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:30,813 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:15:30,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-31 22:15:30,925 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-31 22:15:30,925 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 22:15:30,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-10-31 22:15:30,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:15:30,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-31 22:15:31,442 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-31 22:15:31,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:15:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:15:33,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064849029] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:15:33,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:15:33,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 22] total 34 [2024-10-31 22:15:33,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716403303] [2024-10-31 22:15:33,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:15:33,208 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:15:33,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:33,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-31 22:15:33,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-10-31 22:15:33,209 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand has 34 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 9 states have call successors, (9), 7 states have call predecessors, (9), 10 states have return successors, (15), 9 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-31 22:15:33,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:33,476 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-10-31 22:15:33,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2024-10-31 22:15:33,477 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-31 22:15:33,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2024-10-31 22:15:33,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-10-31 22:15:33,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-10-31 22:15:33,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2024-10-31 22:15:33,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:15:33,478 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-10-31 22:15:33,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2024-10-31 22:15:33,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-31 22:15:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-31 22:15:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2024-10-31 22:15:33,482 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-10-31 22:15:33,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-31 22:15:33,484 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-10-31 22:15:33,484 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-31 22:15:33,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2024-10-31 22:15:33,485 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-31 22:15:33,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:15:33,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:15:33,486 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-31 22:15:33,486 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:33,486 INFO L745 eck$LassoCheckResult]: Stem: 834#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 829#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem10#1, main_#t~mem11#1, main_#t~short12#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 825#L65 call func_to_recursive_line_20_to_21_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 826#$Ultimate##0 [2024-10-31 22:15:33,486 INFO L747 eck$LassoCheckResult]: Loop: 826#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem7 := read~int#2(~a.base, ~a.offset, 4); 830#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~b.base, ~b.offset, 4); 821#L47 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 831#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 827#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 822#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 831#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 827#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 822#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 831#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 827#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 822#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 831#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 827#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 822#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 831#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 827#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 822#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 831#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 827#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 828#L25-1 assume true; 832#func_to_recursive_line_21_to_21_0EXIT >#50#return; 820#L25-1 assume true; 823#func_to_recursive_line_21_to_21_0EXIT >#50#return; 842#L25-1 assume true; 841#func_to_recursive_line_21_to_21_0EXIT >#50#return; 840#L25-1 assume true; 839#func_to_recursive_line_21_to_21_0EXIT >#50#return; 838#L25-1 assume true; 837#func_to_recursive_line_21_to_21_0EXIT >#50#return; 836#L25-1 assume true; 835#func_to_recursive_line_21_to_21_0EXIT >#44#return; 833#L47-1 call #t~mem8 := read~int#2(~a.base, ~a.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~a.base, ~a.offset, 4);havoc #t~mem8;havoc #t~pre9; 824#L52 call func_to_recursive_line_20_to_21_0(~b.base, ~b.offset, ~a.base, ~a.offset);< 826#$Ultimate##0 [2024-10-31 22:15:33,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:33,487 INFO L85 PathProgramCache]: Analyzing trace with hash 40812, now seen corresponding path program 5 times [2024-10-31 22:15:33,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:33,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226043062] [2024-10-31 22:15:33,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:33,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:33,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:15:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:33,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:15:33,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:33,516 INFO L85 PathProgramCache]: Analyzing trace with hash 892489151, now seen corresponding path program 4 times [2024-10-31 22:15:33,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:33,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409706650] [2024-10-31 22:15:33,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:33,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:34,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-31 22:15:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:34,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-31 22:15:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-31 22:15:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-31 22:15:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-31 22:15:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-31 22:15:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,717 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-31 22:15:35,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:35,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409706650] [2024-10-31 22:15:35,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409706650] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:15:35,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302056922] [2024-10-31 22:15:35,721 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-31 22:15:35,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:15:35,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:35,725 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:15:35,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-31 22:15:35,849 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-31 22:15:35,849 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 22:15:35,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-10-31 22:15:35,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:15:35,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-31 22:15:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-31 22:15:36,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:15:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:15:39,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302056922] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:15:39,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:15:39,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 26] total 42 [2024-10-31 22:15:39,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065032552] [2024-10-31 22:15:39,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:15:39,200 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:15:39,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:39,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-31 22:15:39,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1383, Unknown=0, NotChecked=0, Total=1722 [2024-10-31 22:15:39,204 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. cyclomatic complexity: 4 Second operand has 42 states, 32 states have (on average 1.1875) internal successors, (38), 35 states have internal predecessors, (38), 11 states have call successors, (12), 8 states have call predecessors, (12), 13 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2024-10-31 22:15:39,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:39,696 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-10-31 22:15:39,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2024-10-31 22:15:39,697 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-31 22:15:39,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2024-10-31 22:15:39,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-10-31 22:15:39,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-31 22:15:39,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2024-10-31 22:15:39,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:15:39,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-10-31 22:15:39,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2024-10-31 22:15:39,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-31 22:15:39,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-31 22:15:39,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-10-31 22:15:39,704 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-10-31 22:15:39,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 22:15:39,705 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-10-31 22:15:39,706 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-31 22:15:39,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2024-10-31 22:15:39,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-31 22:15:39,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:15:39,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:15:39,708 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-31 22:15:39,708 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:39,708 INFO L745 eck$LassoCheckResult]: Stem: 1240#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1235#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem10#1, main_#t~mem11#1, main_#t~short12#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1231#L65 call func_to_recursive_line_20_to_21_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 1232#$Ultimate##0 [2024-10-31 22:15:39,708 INFO L747 eck$LassoCheckResult]: Loop: 1232#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem7 := read~int#2(~a.base, ~a.offset, 4); 1236#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~b.base, ~b.offset, 4); 1227#L47 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 1237#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 1233#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 1228#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 1237#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 1233#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 1228#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 1237#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 1233#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 1228#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 1237#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 1233#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 1228#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 1237#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 1233#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 1228#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 1237#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 1233#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 1228#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 1237#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 1233#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1234#L25-1 assume true; 1238#func_to_recursive_line_21_to_21_0EXIT >#50#return; 1226#L25-1 assume true; 1229#func_to_recursive_line_21_to_21_0EXIT >#50#return; 1250#L25-1 assume true; 1249#func_to_recursive_line_21_to_21_0EXIT >#50#return; 1248#L25-1 assume true; 1247#func_to_recursive_line_21_to_21_0EXIT >#50#return; 1246#L25-1 assume true; 1245#func_to_recursive_line_21_to_21_0EXIT >#50#return; 1244#L25-1 assume true; 1243#func_to_recursive_line_21_to_21_0EXIT >#50#return; 1242#L25-1 assume true; 1241#func_to_recursive_line_21_to_21_0EXIT >#44#return; 1239#L47-1 call #t~mem8 := read~int#2(~a.base, ~a.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~a.base, ~a.offset, 4);havoc #t~mem8;havoc #t~pre9; 1230#L52 call func_to_recursive_line_20_to_21_0(~b.base, ~b.offset, ~a.base, ~a.offset);< 1232#$Ultimate##0 [2024-10-31 22:15:39,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:39,709 INFO L85 PathProgramCache]: Analyzing trace with hash 40812, now seen corresponding path program 6 times [2024-10-31 22:15:39,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:39,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690777736] [2024-10-31 22:15:39,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:39,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:39,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:15:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:39,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:15:39,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:39,725 INFO L85 PathProgramCache]: Analyzing trace with hash -288932697, now seen corresponding path program 5 times [2024-10-31 22:15:39,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:39,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145235355] [2024-10-31 22:15:39,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:39,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:39,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:15:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:39,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:15:39,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:39,771 INFO L85 PathProgramCache]: Analyzing trace with hash -253400356, now seen corresponding path program 1 times [2024-10-31 22:15:39,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:39,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660842353] [2024-10-31 22:15:39,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:39,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:39,797 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:15:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:39,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:15:42,660 INFO L204 LassoAnalysis]: Preferences: [2024-10-31 22:15:42,661 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-31 22:15:42,661 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-31 22:15:42,661 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-31 22:15:42,661 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-31 22:15:42,661 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:42,661 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-31 22:15:42,661 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-31 22:15:42,661 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_2.c_Iteration6_Lasso [2024-10-31 22:15:42,661 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-31 22:15:42,662 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-31 22:15:42,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:42,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:42,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:42,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:42,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:42,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:42,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:43,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:43,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:43,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:43,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:43,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:43,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:43,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:43,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:43,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:43,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:43,633 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-31 22:15:43,638 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-31 22:15:43,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:43,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:43,640 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:43,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-31 22:15:43,643 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 [2024-10-31 22:15:43,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:43,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 22:15:43,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:43,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:43,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:43,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 22:15:43,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 22:15:43,663 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:15:43,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-31 22:15:43,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:43,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:43,680 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:43,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-31 22:15:43,698 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 [2024-10-31 22:15:43,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:43,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:43,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:43,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:43,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 22:15:43,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 22:15:43,720 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:15:43,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-31 22:15:43,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:43,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:43,736 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:43,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-31 22:15:43,738 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 [2024-10-31 22:15:43,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:43,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:43,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:43,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:43,752 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 22:15:43,752 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 22:15:43,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:15:43,768 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-31 22:15:43,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:43,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:43,770 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:43,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-31 22:15:43,772 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 [2024-10-31 22:15:43,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:43,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 22:15:43,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:43,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:43,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:43,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 22:15:43,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 22:15:43,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:15:43,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-31 22:15:43,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:43,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:43,799 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:43,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-31 22:15:43,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-31 22:15:43,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:43,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 22:15:43,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:43,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:43,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:43,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 22:15:43,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 22:15:43,815 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:15:43,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-31 22:15:43,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:43,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:43,834 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:43,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-31 22:15:43,836 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 [2024-10-31 22:15:43,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:43,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 22:15:43,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:43,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:43,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:43,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 22:15:43,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 22:15:43,849 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:15:43,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-31 22:15:43,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:43,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:43,864 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:43,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-31 22:15:43,866 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 [2024-10-31 22:15:43,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:43,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:43,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:43,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:43,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 22:15:43,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 22:15:43,885 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:15:43,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-31 22:15:43,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:43,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:43,899 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:43,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-31 22:15:43,901 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 [2024-10-31 22:15:43,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:43,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:43,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:43,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:43,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 22:15:43,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 22:15:43,922 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:15:43,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-31 22:15:43,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:43,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:43,944 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:43,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-31 22:15:43,946 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 [2024-10-31 22:15:43,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:43,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:43,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:43,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:43,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 22:15:43,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 22:15:43,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:15:43,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-31 22:15:43,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:43,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:43,992 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:43,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-31 22:15:43,995 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 [2024-10-31 22:15:44,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:44,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:44,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:44,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:44,012 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 22:15:44,012 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 22:15:44,018 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:15:44,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-31 22:15:44,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:44,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:44,037 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:44,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-31 22:15:44,039 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 [2024-10-31 22:15:44,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:44,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:44,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:44,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:44,055 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 22:15:44,055 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 22:15:44,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:15:44,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-31 22:15:44,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:44,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:44,076 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:44,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-31 22:15:44,078 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 [2024-10-31 22:15:44,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:44,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:44,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:44,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:44,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 22:15:44,094 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 22:15:44,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:15:44,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-31 22:15:44,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:44,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:44,119 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:44,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-31 22:15:44,123 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 [2024-10-31 22:15:44,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:44,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:44,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:44,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:44,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 22:15:44,139 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 22:15:44,146 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:15:44,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-31 22:15:44,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:44,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:44,168 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:44,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-31 22:15:44,173 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 [2024-10-31 22:15:44,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:44,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:44,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:44,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:44,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 22:15:44,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 22:15:44,202 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-31 22:15:44,220 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-10-31 22:15:44,220 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-10-31 22:15:44,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:44,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:44,230 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:44,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-31 22:15:44,236 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-31 22:15:44,252 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-31 22:15:44,253 INFO L474 LassoAnalysis]: Proved termination. [2024-10-31 22:15:44,253 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 func_to_recursive_line_20_to_21_0_#in~a.base) func_to_recursive_line_20_to_21_0_#in~a.offset)_1) = -2*v_rep(select (select #memory_int#2 func_to_recursive_line_20_to_21_0_#in~a.base) func_to_recursive_line_20_to_21_0_#in~a.offset)_1 + 11 Supporting invariants [] [2024-10-31 22:15:44,272 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-31 22:15:44,324 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2024-10-31 22:15:44,332 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-31 22:15:44,333 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-31 22:15:44,333 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-10-31 22:15:44,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:44,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-31 22:15:44,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:15:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:44,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-31 22:15:44,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:15:44,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 47 treesize of output 20 [2024-10-31 22:15:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-31 22:15:44,852 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-10-31 22:15:44,853 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 27 transitions. cyclomatic complexity: 4 Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:15:45,041 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 27 transitions. cyclomatic complexity: 4. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 89 states and 97 transitions. Complement of second has 19 states. [2024-10-31 22:15:45,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-31 22:15:45,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:15:45,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2024-10-31 22:15:45,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 3 letters. Loop has 39 letters. [2024-10-31 22:15:45,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-31 22:15:45,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 42 letters. Loop has 39 letters. [2024-10-31 22:15:45,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-31 22:15:45,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 3 letters. Loop has 78 letters. [2024-10-31 22:15:45,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-31 22:15:45,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 97 transitions. [2024-10-31 22:15:45,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-31 22:15:45,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 45 states and 51 transitions. [2024-10-31 22:15:45,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-31 22:15:45,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-31 22:15:45,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 51 transitions. [2024-10-31 22:15:45,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-31 22:15:45,060 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-10-31 22:15:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 51 transitions. [2024-10-31 22:15:45,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2024-10-31 22:15:45,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-31 22:15:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-10-31 22:15:45,063 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-10-31 22:15:45,063 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-10-31 22:15:45,063 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-31 22:15:45,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 38 transitions. [2024-10-31 22:15:45,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-31 22:15:45,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:15:45,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:15:45,065 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-31 22:15:45,065 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-31 22:15:45,065 INFO L745 eck$LassoCheckResult]: Stem: 1573#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1564#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem10#1, main_#t~mem11#1, main_#t~short12#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1558#L65 call func_to_recursive_line_20_to_21_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 1574#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem7 := read~int#2(~a.base, ~a.offset, 4); 1565#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~b.base, ~b.offset, 4); 1562#L47 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 1568#$Ultimate##0 [2024-10-31 22:15:45,065 INFO L747 eck$LassoCheckResult]: Loop: 1568#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 1560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 1561#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 1568#$Ultimate##0 [2024-10-31 22:15:45,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:45,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1215830428, now seen corresponding path program 1 times [2024-10-31 22:15:45,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:45,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763264538] [2024-10-31 22:15:45,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:45,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:45,079 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:15:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:45,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:15:45,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:45,089 INFO L85 PathProgramCache]: Analyzing trace with hash 63661, now seen corresponding path program 1 times [2024-10-31 22:15:45,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:45,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441817764] [2024-10-31 22:15:45,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:45,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:45,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:15:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:45,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:15:45,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:45,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1345107250, now seen corresponding path program 1 times [2024-10-31 22:15:45,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:45,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634773307] [2024-10-31 22:15:45,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:45,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:45,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:15:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:45,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:15:45,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-31 22:15:46,601 INFO L204 LassoAnalysis]: Preferences: [2024-10-31 22:15:46,602 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-31 22:15:46,602 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-31 22:15:46,602 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-31 22:15:46,602 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-31 22:15:46,602 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:46,602 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-31 22:15:46,602 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-31 22:15:46,602 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_2.c_Iteration7_Lasso [2024-10-31 22:15:46,602 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-31 22:15:46,602 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-31 22:15:46,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:46,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:15:47,274 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-31 22:15:47,274 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-31 22:15:47,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:47,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:47,277 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:47,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-31 22:15:47,279 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 [2024-10-31 22:15:47,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:47,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 22:15:47,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:47,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:47,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:47,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 22:15:47,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 22:15:47,292 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:15:47,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-31 22:15:47,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:47,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:47,307 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:47,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-31 22:15:47,309 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 [2024-10-31 22:15:47,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:47,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 22:15:47,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:47,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:47,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:47,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 22:15:47,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 22:15:47,321 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:15:47,334 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-31 22:15:47,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:47,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:47,335 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:47,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-31 22:15:47,338 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 [2024-10-31 22:15:47,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:47,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 22:15:47,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:47,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:47,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:47,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 22:15:47,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 22:15:47,350 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:15:47,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-31 22:15:47,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:47,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:47,363 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:47,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-31 22:15:47,365 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 [2024-10-31 22:15:47,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:47,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 22:15:47,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:47,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:47,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:47,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 22:15:47,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 22:15:47,377 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:15:47,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-31 22:15:47,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:47,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:47,391 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:47,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-31 22:15:47,393 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 [2024-10-31 22:15:47,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:47,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:47,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:47,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:47,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 22:15:47,405 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 22:15:47,411 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:15:47,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-31 22:15:47,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:47,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:47,425 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:47,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-31 22:15:47,426 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 [2024-10-31 22:15:47,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:47,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:47,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:47,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:47,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 22:15:47,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 22:15:47,443 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:15:47,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-31 22:15:47,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:47,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:47,455 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:47,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-31 22:15:47,458 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 [2024-10-31 22:15:47,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:47,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:47,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:47,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:47,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 22:15:47,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 22:15:47,477 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:15:47,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-31 22:15:47,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:47,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:47,493 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:47,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-31 22:15:47,495 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 [2024-10-31 22:15:47,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:15:47,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:15:47,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:15:47,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:15:47,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 22:15:47,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 22:15:47,529 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-31 22:15:47,570 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2024-10-31 22:15:47,570 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-10-31 22:15:47,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:15:47,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:47,573 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:47,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-31 22:15:47,577 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-31 22:15:47,590 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-31 22:15:47,590 INFO L474 LassoAnalysis]: Proved termination. [2024-10-31 22:15:47,590 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 func_to_recursive_line_21_to_21_0_#in~b.base) 0)_1) = -2*v_rep(select (select #memory_int#1 func_to_recursive_line_21_to_21_0_#in~b.base) 0)_1 + 11 Supporting invariants [] [2024-10-31 22:15:47,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-31 22:15:47,622 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-10-31 22:15:47,624 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-31 22:15:47,624 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-31 22:15:47,624 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-10-31 22:15:47,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:47,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-31 22:15:47,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:15:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:47,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-31 22:15:47,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:15:47,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 47 treesize of output 20 [2024-10-31 22:15:47,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6b37ae-e542-4e0d-aa2c-6c9f88706f9b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-31 22:15:47,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:15:47,873 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2024-10-31 22:15:47,874 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 38 transitions. cyclomatic complexity: 7 Second operand has 8 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:15:48,052 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 38 transitions. cyclomatic complexity: 7. Second operand has 8 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 62 states and 74 transitions. Complement of second has 18 states. [2024-10-31 22:15:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-31 22:15:48,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:15:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2024-10-31 22:15:48,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2024-10-31 22:15:48,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-31 22:15:48,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. Stem has 9 letters. Loop has 3 letters. [2024-10-31 22:15:48,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-31 22:15:48,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. Stem has 6 letters. Loop has 6 letters. [2024-10-31 22:15:48,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-31 22:15:48,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 74 transitions. [2024-10-31 22:15:48,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-31 22:15:48,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 45 states and 56 transitions. [2024-10-31 22:15:48,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-31 22:15:48,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-31 22:15:48,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 56 transitions. [2024-10-31 22:15:48,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-31 22:15:48,064 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 56 transitions. [2024-10-31 22:15:48,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 56 transitions. [2024-10-31 22:15:48,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-31 22:15:48,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 30 states have internal predecessors, (30), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2024-10-31 22:15:48,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2024-10-31 22:15:48,076 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 56 transitions. [2024-10-31 22:15:48,076 INFO L425 stractBuchiCegarLoop]: Abstraction has 45 states and 56 transitions. [2024-10-31 22:15:48,076 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-31 22:15:48,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 56 transitions. [2024-10-31 22:15:48,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-31 22:15:48,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:15:48,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:15:48,078 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:48,078 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-31 22:15:48,079 INFO L745 eck$LassoCheckResult]: Stem: 1774#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1764#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem10#1, main_#t~mem11#1, main_#t~short12#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1758#L65 call func_to_recursive_line_20_to_21_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 1775#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem7 := read~int#2(~a.base, ~a.offset, 4); 1776#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~b.base, ~b.offset, 4); 1778#L47 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 1797#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 1796#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 1755#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 1772#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 1763#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 1754#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 1772#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 1763#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 1754#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 1772#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 1763#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 1754#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 1772#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 1763#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 1754#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 1772#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 1763#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 1754#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 1772#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 1791#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1753#L25-1 assume true; 1756#func_to_recursive_line_21_to_21_0EXIT >#50#return; 1771#L25-1 assume true; 1790#func_to_recursive_line_21_to_21_0EXIT >#50#return; 1789#L25-1 assume true; 1788#func_to_recursive_line_21_to_21_0EXIT >#50#return; 1787#L25-1 assume true; 1786#func_to_recursive_line_21_to_21_0EXIT >#50#return; 1785#L25-1 assume true; 1784#func_to_recursive_line_21_to_21_0EXIT >#50#return; 1783#L25-1 assume true; 1780#func_to_recursive_line_21_to_21_0EXIT >#50#return; 1779#L25-1 assume true; 1777#func_to_recursive_line_21_to_21_0EXIT >#44#return; 1773#L47-1 call #t~mem8 := read~int#2(~a.base, ~a.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~a.base, ~a.offset, 4);havoc #t~mem8;havoc #t~pre9; 1757#L52 call func_to_recursive_line_20_to_21_0(~b.base, ~b.offset, ~a.base, ~a.offset);< 1759#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem7 := read~int#2(~a.base, ~a.offset, 4); 1765#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~b.base, ~b.offset, 4); 1761#L47 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 1768#$Ultimate##0 [2024-10-31 22:15:48,079 INFO L747 eck$LassoCheckResult]: Loop: 1768#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem4 := read~int#1(~b.base, ~b.offset, 4); 1760#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~b.base, ~b.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~b.base, ~b.offset, 4);havoc #t~mem5;havoc #t~pre6; 1762#L32 call func_to_recursive_line_21_to_21_0(~b.base, ~b.offset);< 1768#$Ultimate##0 [2024-10-31 22:15:48,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:48,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1502500908, now seen corresponding path program 2 times [2024-10-31 22:15:48,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:48,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094107633] [2024-10-31 22:15:48,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:48,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:48,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:15:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:48,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:15:48,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:48,153 INFO L85 PathProgramCache]: Analyzing trace with hash 63661, now seen corresponding path program 2 times [2024-10-31 22:15:48,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:48,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967626355] [2024-10-31 22:15:48,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:48,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:48,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:15:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:48,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:15:48,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:48,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1144574814, now seen corresponding path program 3 times [2024-10-31 22:15:48,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:48,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021999176] [2024-10-31 22:15:48,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:48,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:48,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:15:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:48,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace