./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-regression/test27-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0e0057cc 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_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/test27-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya --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 78863f43fa37191b47f0d738bb1bc2018c82b38cb68dad85c455cdbd7fd69aa4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:59:58,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:59:58,956 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-28 23:59:58,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:59:58,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:59:58,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:59:58,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:59:58,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:59:58,989 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:59:58,990 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:59:58,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:59:58,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:59:58,992 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:59:58,992 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-28 23:59:58,993 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-28 23:59:58,993 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-28 23:59:58,994 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-28 23:59:58,994 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-28 23:59:58,995 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-28 23:59:58,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:59:58,996 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-28 23:59:58,996 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:59:58,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:59:58,997 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:59:58,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:59:58,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-28 23:59:58,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-28 23:59:58,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-28 23:59:58,999 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 23:59:59,000 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:59:59,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 23:59:59,001 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-28 23:59:59,001 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:59:59,001 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:59:59,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:59:59,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:59:59,003 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 23:59:59,004 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-28 23:59:59,004 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_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/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_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 78863f43fa37191b47f0d738bb1bc2018c82b38cb68dad85c455cdbd7fd69aa4 [2023-11-28 23:59:59,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:59:59,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:59:59,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:59:59,267 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:59:59,268 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:59:59,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/ldv-regression/test27-1.c [2023-11-29 00:00:02,055 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:00:02,279 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:00:02,280 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/sv-benchmarks/c/ldv-regression/test27-1.c [2023-11-29 00:00:02,286 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/data/54d57c813/6242c114fcb847a49b3dff0387417b4b/FLAGc840e8fe4 [2023-11-29 00:00:02,300 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/data/54d57c813/6242c114fcb847a49b3dff0387417b4b [2023-11-29 00:00:02,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:00:02,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:00:02,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:00:02,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:00:02,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:00:02,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3837b210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02, skipping insertion in model container [2023-11-29 00:00:02,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,332 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:00:02,478 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:00:02,491 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:00:02,512 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:00:02,526 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:00:02,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02 WrapperNode [2023-11-29 00:00:02,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:00:02,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:00:02,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:00:02,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:00:02,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,567 INFO L138 Inliner]: procedures = 16, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 113 [2023-11-29 00:00:02,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:00:02,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:00:02,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:00:02,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:00:02,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,582 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,602 INFO L175 MemorySlicer]: Split 20 memory accesses to 5 slices as follows [2, 5, 3, 4, 6]. 30 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 6 writes are split as follows [0, 2, 1, 1, 2]. [2023-11-29 00:00:02,603 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,616 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,623 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:00:02,631 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:00:02,631 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:00:02,631 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:00:02,632 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:00:02,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:00:02,665 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:00:02,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-29 00:00:02,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 00:00:02,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 00:00:02,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 00:00:02,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 00:00:02,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 00:00:02,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:00:02,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:00:02,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:00:02,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 00:00:02,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 00:00:02,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 00:00:02,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 00:00:02,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 00:00:02,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 00:00:02,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 00:00:02,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 00:00:02,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:00:02,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 00:00:02,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 00:00:02,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 00:00:02,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 00:00:02,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 00:00:02,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:00:02,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:00:02,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 00:00:02,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 00:00:02,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 00:00:02,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 00:00:02,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 00:00:02,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:00:02,803 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:00:02,805 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:00:03,018 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:00:03,028 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:00:03,028 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 00:00:03,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:00:03 BoogieIcfgContainer [2023-11-29 00:00:03,030 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:00:03,031 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-29 00:00:03,031 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-29 00:00:03,035 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-29 00:00:03,036 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 00:00:03,036 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:00:02" (1/3) ... [2023-11-29 00:00:03,037 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@249f2933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:00:03, skipping insertion in model container [2023-11-29 00:00:03,037 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 00:00:03,038 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (2/3) ... [2023-11-29 00:00:03,038 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@249f2933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:00:03, skipping insertion in model container [2023-11-29 00:00:03,038 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 00:00:03,038 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:00:03" (3/3) ... [2023-11-29 00:00:03,039 INFO L332 chiAutomizerObserver]: Analyzing ICFG test27-1.c [2023-11-29 00:00:03,087 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-29 00:00:03,088 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-29 00:00:03,088 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-29 00:00:03,088 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-29 00:00:03,088 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-29 00:00:03,088 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-29 00:00:03,088 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-29 00:00:03,088 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-29 00:00:03,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:03,107 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-29 00:00:03,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:00:03,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:00:03,113 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 00:00:03,113 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 00:00:03,113 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-29 00:00:03,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:03,116 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-29 00:00:03,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:00:03,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:00:03,116 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 00:00:03,117 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 00:00:03,123 INFO L748 eck$LassoCheckResult]: Stem: 14#$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); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet8#1;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 12#L29-3true [2023-11-29 00:00:03,124 INFO L750 eck$LassoCheckResult]: Loop: 12#L29-3true assume !!(main_~j~0#1 < 10);havoc main_#t~nondet10#1;call write~int#4(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$#1(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 17#L29-2true main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12#L29-3true [2023-11-29 00:00:03,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:03,130 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-29 00:00:03,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:03,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451303941] [2023-11-29 00:00:03,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:03,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:03,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:00:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:03,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:00:03,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:03,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2023-11-29 00:00:03,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:03,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569152102] [2023-11-29 00:00:03,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:03,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:03,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:00:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:03,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:00:03,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:03,328 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-11-29 00:00:03,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:03,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013902789] [2023-11-29 00:00:03,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:03,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:03,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:00:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:03,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:00:04,239 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 00:00:04,240 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 00:00:04,240 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 00:00:04,240 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 00:00:04,241 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 00:00:04,241 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:00:04,241 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 00:00:04,241 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 00:00:04,241 INFO L133 ssoRankerPreferences]: Filename of dumped script: test27-1.c_Iteration1_Lasso [2023-11-29 00:00:04,241 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 00:00:04,241 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 00:00:04,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:04,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:00:05,256 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 00:00:05,260 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 00:00:05,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:00:05,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:00:05,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:00:05,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-29 00:00:05,265 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 [2023-11-29 00:00:05,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:00:05,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:00:05,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:00:05,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:00:05,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:00:05,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:00:05,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:00:05,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:00:05,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:00:05,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:00:05,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:00:05,289 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:00:05,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-29 00:00:05,292 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 [2023-11-29 00:00:05,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:00:05,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:00:05,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:00:05,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:00:05,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:00:05,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:00:05,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:00:05,306 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:00:05,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-11-29 00:00:05,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:00:05,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:00:05,312 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:00:05,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-29 00:00:05,317 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 [2023-11-29 00:00:05,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:00:05,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:00:05,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:00:05,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:00:05,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:00:05,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:00:05,342 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:00:05,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-11-29 00:00:05,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:00:05,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:00:05,350 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:00:05,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-29 00:00:05,353 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 [2023-11-29 00:00:05,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:00:05,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:00:05,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:00:05,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:00:05,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:00:05,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:00:05,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:00:05,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:00:05,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-11-29 00:00:05,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:00:05,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:00:05,378 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:00:05,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-29 00:00:05,381 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 [2023-11-29 00:00:05,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:00:05,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:00:05,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:00:05,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:00:05,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:00:05,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:00:05,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:00:05,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-11-29 00:00:05,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:00:05,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:00:05,409 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:00:05,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-29 00:00:05,412 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 [2023-11-29 00:00:05,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:00:05,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:00:05,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:00:05,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:00:05,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:00:05,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:00:05,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:00:05,429 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:00:05,433 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-11-29 00:00:05,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:00:05,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:00:05,435 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:00:05,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-29 00:00:05,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 00:00:05,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:00:05,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:00:05,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:00:05,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:00:05,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:00:05,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:00:05,469 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:00:05,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-11-29 00:00:05,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:00:05,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:00:05,474 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:00:05,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-29 00:00:05,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 00:00:05,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:00:05,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:00:05,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:00:05,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:00:05,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:00:05,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:00:05,514 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 00:00:05,558 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2023-11-29 00:00:05,559 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2023-11-29 00:00:05,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:00:05,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:00:05,593 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:00:05,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-29 00:00:05,596 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 00:00:05,611 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 00:00:05,612 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 00:00:05,612 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1) = -8*ULTIMATE.start_main_~j~0#1 + 19*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 Supporting invariants [] [2023-11-29 00:00:05,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-11-29 00:00:05,736 INFO L156 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2023-11-29 00:00:05,746 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~#a~0!base] could not be translated [2023-11-29 00:00:05,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:00:05,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:00:05,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:00:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:00:05,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:00:05,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:00:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:05,895 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-11-29 00:00:05,897 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:05,950 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 49 transitions. Complement of second has 8 states. [2023-11-29 00:00:05,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 00:00:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2023-11-29 00:00:05,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2023-11-29 00:00:05,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:00:05,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-29 00:00:05,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:00:05,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2023-11-29 00:00:05,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:00:05,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 49 transitions. [2023-11-29 00:00:05,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 00:00:05,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 10 states and 12 transitions. [2023-11-29 00:00:05,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2023-11-29 00:00:05,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-11-29 00:00:05,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2023-11-29 00:00:05,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:00:05,972 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2023-11-29 00:00:05,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2023-11-29 00:00:05,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-11-29 00:00:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2023-11-29 00:00:05,994 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2023-11-29 00:00:05,994 INFO L428 stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2023-11-29 00:00:05,994 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-29 00:00:05,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2023-11-29 00:00:05,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 00:00:05,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:00:05,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:00:05,995 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-29 00:00:05,995 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 00:00:06,019 INFO L748 eck$LassoCheckResult]: Stem: 192#$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); 193#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet8#1;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 186#L29-3 assume !(main_~j~0#1 < 10); 187#L29-4 havoc main_~j~0#1; 190#L35 assume main_~i~0#1 > 0 && main_~i~0#1 < 9;call write~int#4(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$#3(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (main_~i~0#1 - 1), main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$#1(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$#2(main_~#dummies~0#1.base, 4 + main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#2(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$#1(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$#3(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, 4 + main_#t~mem13#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int#4(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 184#L41 assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#1(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#3(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int#4(main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1; 185#L43-3 [2023-11-29 00:00:06,019 INFO L750 eck$LassoCheckResult]: Loop: 185#L43-3 call main_#t~mem18#1 := read~int#4(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 191#L43-1 assume !!(main_~i~0#1 < main_#t~mem18#1);havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1; 185#L43-3 [2023-11-29 00:00:06,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:06,020 INFO L85 PathProgramCache]: Analyzing trace with hash 889605038, now seen corresponding path program 1 times [2023-11-29 00:00:06,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:06,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228506497] [2023-11-29 00:00:06,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:06,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:06,023 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-11-29 00:00:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:00:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:06,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:00:06,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228506497] [2023-11-29 00:00:06,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228506497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:00:06,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:00:06,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:00:06,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333843689] [2023-11-29 00:00:06,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:00:06,137 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 00:00:06,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:06,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 1 times [2023-11-29 00:00:06,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:06,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481858683] [2023-11-29 00:00:06,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:06,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:06,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:00:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:06,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:00:06,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:00:06,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:00:06,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:00:06,190 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:06,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:00:06,207 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2023-11-29 00:00:06,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2023-11-29 00:00:06,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 00:00:06,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2023-11-29 00:00:06,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-11-29 00:00:06,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-11-29 00:00:06,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2023-11-29 00:00:06,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:00:06,209 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2023-11-29 00:00:06,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2023-11-29 00:00:06,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2023-11-29 00:00:06,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-11-29 00:00:06,211 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-11-29 00:00:06,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:00:06,213 INFO L428 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-11-29 00:00:06,213 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-29 00:00:06,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2023-11-29 00:00:06,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 00:00:06,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:00:06,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:00:06,214 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:00:06,214 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 00:00:06,214 INFO L748 eck$LassoCheckResult]: Stem: 219#$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); 220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet8#1;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 213#L29-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet10#1;call write~int#4(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$#1(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 214#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 215#L29-3 assume !(main_~j~0#1 < 10); 216#L29-4 havoc main_~j~0#1; 218#L35 assume main_~i~0#1 > 0 && main_~i~0#1 < 9;call write~int#4(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$#3(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (main_~i~0#1 - 1), main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$#1(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$#2(main_~#dummies~0#1.base, 4 + main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#2(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$#1(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$#3(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, 4 + main_#t~mem13#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int#4(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 211#L41 assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#1(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#3(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int#4(main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1; 212#L43-3 [2023-11-29 00:00:06,215 INFO L750 eck$LassoCheckResult]: Loop: 212#L43-3 call main_#t~mem18#1 := read~int#4(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 217#L43-1 assume !!(main_~i~0#1 < main_#t~mem18#1);havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1; 212#L43-3 [2023-11-29 00:00:06,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:06,215 INFO L85 PathProgramCache]: Analyzing trace with hash 265180976, now seen corresponding path program 1 times [2023-11-29 00:00:06,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:06,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306232815] [2023-11-29 00:00:06,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:06,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:00:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:06,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:00:06,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306232815] [2023-11-29 00:00:06,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306232815] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:00:06,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982392978] [2023-11-29 00:00:06,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:06,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:00:06,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:00:06,322 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:00:06,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 00:00:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:00:06,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:00:06,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:00:06,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:06,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:00:06,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:06,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982392978] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:00:06,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:00:06,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-29 00:00:06,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260047332] [2023-11-29 00:00:06,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:00:06,482 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 00:00:06,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:06,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 2 times [2023-11-29 00:00:06,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:06,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342273679] [2023-11-29 00:00:06,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:06,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:06,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:00:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:06,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:00:06,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:00:06,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:00:06,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:00:06,530 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:00:06,565 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2023-11-29 00:00:06,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2023-11-29 00:00:06,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 00:00:06,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2023-11-29 00:00:06,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-11-29 00:00:06,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-11-29 00:00:06,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2023-11-29 00:00:06,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:00:06,568 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-11-29 00:00:06,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2023-11-29 00:00:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-29 00:00:06,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2023-11-29 00:00:06,570 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-11-29 00:00:06,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:00:06,571 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-11-29 00:00:06,572 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-29 00:00:06,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 17 transitions. [2023-11-29 00:00:06,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 00:00:06,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:00:06,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:00:06,573 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1] [2023-11-29 00:00:06,573 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 00:00:06,574 INFO L748 eck$LassoCheckResult]: Stem: 298#$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); 299#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet8#1;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 291#L29-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet10#1;call write~int#4(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$#1(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 292#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 293#L29-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet10#1;call write~int#4(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$#1(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 294#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 300#L29-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet10#1;call write~int#4(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$#1(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 304#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 303#L29-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet10#1;call write~int#4(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$#1(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 302#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 301#L29-3 assume !(main_~j~0#1 < 10); 296#L29-4 havoc main_~j~0#1; 297#L35 assume main_~i~0#1 > 0 && main_~i~0#1 < 9;call write~int#4(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$#3(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (main_~i~0#1 - 1), main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$#1(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$#2(main_~#dummies~0#1.base, 4 + main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#2(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$#1(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$#3(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, 4 + main_#t~mem13#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int#4(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 289#L41 assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#1(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#3(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int#4(main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1; 290#L43-3 [2023-11-29 00:00:06,574 INFO L750 eck$LassoCheckResult]: Loop: 290#L43-3 call main_#t~mem18#1 := read~int#4(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 295#L43-1 assume !!(main_~i~0#1 < main_#t~mem18#1);havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1; 290#L43-3 [2023-11-29 00:00:06,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:06,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754442, now seen corresponding path program 2 times [2023-11-29 00:00:06,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:06,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307476660] [2023-11-29 00:00:06,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:06,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:00:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:06,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:00:06,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307476660] [2023-11-29 00:00:06,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307476660] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:00:06,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955313733] [2023-11-29 00:00:06,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:00:06,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:00:06,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:00:06,741 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:00:06,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e58453e-01f1-4d45-9a11-ab1d56360f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 00:00:06,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:00:06,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:00:06,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:00:06,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:00:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:07,006 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:00:07,076 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:07,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955313733] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:00:07,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:00:07,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-29 00:00:07,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149717840] [2023-11-29 00:00:07,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:00:07,077 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 00:00:07,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:07,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 3 times [2023-11-29 00:00:07,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:07,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122872573] [2023-11-29 00:00:07,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:07,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:07,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:00:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:07,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:00:07,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:00:07,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 00:00:07,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-29 00:00:07,127 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:00:07,201 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2023-11-29 00:00:07,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2023-11-29 00:00:07,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 00:00:07,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 29 transitions. [2023-11-29 00:00:07,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-11-29 00:00:07,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-11-29 00:00:07,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 29 transitions. [2023-11-29 00:00:07,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:00:07,205 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 29 transitions. [2023-11-29 00:00:07,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 29 transitions. [2023-11-29 00:00:07,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-29 00:00:07,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2023-11-29 00:00:07,208 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 29 transitions. [2023-11-29 00:00:07,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 00:00:07,209 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2023-11-29 00:00:07,210 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-29 00:00:07,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 29 transitions. [2023-11-29 00:00:07,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 00:00:07,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:00:07,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:00:07,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1] [2023-11-29 00:00:07,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 00:00:07,213 INFO L748 eck$LassoCheckResult]: Stem: 436#$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); 437#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet8#1;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 429#L29-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet10#1;call write~int#4(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$#1(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 430#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 431#L29-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet10#1;call write~int#4(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$#1(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 432#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 438#L29-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet10#1;call write~int#4(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$#1(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 454#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 453#L29-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet10#1;call write~int#4(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$#1(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 452#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 451#L29-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet10#1;call write~int#4(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$#1(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 450#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 449#L29-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet10#1;call write~int#4(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$#1(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 448#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 447#L29-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet10#1;call write~int#4(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$#1(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 446#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 445#L29-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet10#1;call write~int#4(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$#1(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 444#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 443#L29-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet10#1;call write~int#4(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$#1(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 442#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 441#L29-3 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet10#1;call write~int#4(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$#1(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 440#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 439#L29-3 assume !(main_~j~0#1 < 10); 433#L29-4 havoc main_~j~0#1; 434#L35 assume main_~i~0#1 > 0 && main_~i~0#1 < 9;call write~int#4(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$#3(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (main_~i~0#1 - 1), main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$#1(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$#2(main_~#dummies~0#1.base, 4 + main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#2(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$#1(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$#3(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, 4 + main_#t~mem13#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int#4(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 427#L41 assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#1(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#3(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int#4(main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1; 428#L43-3 [2023-11-29 00:00:07,213 INFO L750 eck$LassoCheckResult]: Loop: 428#L43-3 call main_#t~mem18#1 := read~int#4(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 435#L43-1 assume !!(main_~i~0#1 < main_#t~mem18#1);havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1; 428#L43-3 [2023-11-29 00:00:07,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:07,213 INFO L85 PathProgramCache]: Analyzing trace with hash -95702974, now seen corresponding path program 3 times [2023-11-29 00:00:07,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:07,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028546824] [2023-11-29 00:00:07,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:07,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:07,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:00:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:07,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:00:07,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:07,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 4 times [2023-11-29 00:00:07,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:07,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932341125] [2023-11-29 00:00:07,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:07,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:07,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:00:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:07,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:00:07,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:07,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1776243929, now seen corresponding path program 1 times [2023-11-29 00:00:07,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:07,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344052524] [2023-11-29 00:00:07,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:07,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:07,496 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:00:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:07,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace