./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/list-ext-properties/simple-ext.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext-properties/simple-ext.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 79d8454f49f42d774b494771accf13f0b47382db45ac5cfdb4c7afee633f8cd7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:12:56,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:12:56,242 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-31 22:12:56,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:12:56,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:12:56,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:12:56,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:12:56,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:12:56,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:12:56,300 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:12:56,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:12:56,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:12:56,302 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:12:56,303 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-31 22:12:56,303 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-31 22:12:56,303 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-31 22:12:56,304 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-31 22:12:56,304 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-31 22:12:56,307 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-31 22:12:56,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:12:56,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-31 22:12:56,309 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:12:56,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:12:56,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:12:56,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:12:56,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-31 22:12:56,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-31 22:12:56,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-31 22:12:56,311 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:12:56,312 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:12:56,312 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:12:56,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:12:56,313 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-31 22:12:56,313 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:12:56,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:12:56,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:12:56,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:12:56,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:12:56,316 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-31 22:12:56,316 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_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 79d8454f49f42d774b494771accf13f0b47382db45ac5cfdb4c7afee633f8cd7 [2024-10-31 22:12:56,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:12:56,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:12:56,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:12:56,654 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:12:56,654 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:12:56,656 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/list-ext-properties/simple-ext.i Unable to find full path for "g++" [2024-10-31 22:12:58,839 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:12:59,188 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:12:59,189 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/sv-benchmarks/c/list-ext-properties/simple-ext.i [2024-10-31 22:12:59,201 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/data/4a9083bc6/3da3367ba80341729bf118fc53d18cbd/FLAGf398489de [2024-10-31 22:12:59,444 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/data/4a9083bc6/3da3367ba80341729bf118fc53d18cbd [2024-10-31 22:12:59,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:12:59,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:12:59,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:12:59,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:12:59,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:12:59,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:12:59" (1/1) ... [2024-10-31 22:12:59,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bedee45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:59, skipping insertion in model container [2024-10-31 22:12:59,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:12:59" (1/1) ... [2024-10-31 22:12:59,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:12:59,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:12:59,909 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:12:59,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:12:59,988 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:12:59,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:59 WrapperNode [2024-10-31 22:12:59,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:12:59,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:12:59,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:12:59,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:13:00,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:59" (1/1) ... [2024-10-31 22:13:00,025 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:59" (1/1) ... [2024-10-31 22:13:00,051 INFO L138 Inliner]: procedures = 124, calls = 20, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 83 [2024-10-31 22:13:00,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:13:00,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:13:00,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:13:00,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:13:00,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:59" (1/1) ... [2024-10-31 22:13:00,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:59" (1/1) ... [2024-10-31 22:13:00,071 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:59" (1/1) ... [2024-10-31 22:13:00,093 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-10-31 22:13:00,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:59" (1/1) ... [2024-10-31 22:13:00,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:59" (1/1) ... [2024-10-31 22:13:00,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:59" (1/1) ... [2024-10-31 22:13:00,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:59" (1/1) ... [2024-10-31 22:13:00,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:59" (1/1) ... [2024-10-31 22:13:00,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:59" (1/1) ... [2024-10-31 22:13:00,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:13:00,120 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:13:00,120 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:13:00,120 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:13:00,121 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:59" (1/1) ... [2024-10-31 22:13:00,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:13:00,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:00,172 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:00,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-31 22:13:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:13:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:13:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:13:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:13:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 22:13:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:13:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-31 22:13:00,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-31 22:13:00,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-31 22:13:00,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-31 22:13:00,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 22:13:00,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:13:00,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:13:00,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:13:00,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:13:00,390 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:13:00,394 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:13:00,584 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-31 22:13:00,584 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:13:00,597 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:13:00,597 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-31 22:13:00,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:13:00 BoogieIcfgContainer [2024-10-31 22:13:00,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:13:00,599 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-31 22:13:00,599 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-31 22:13:00,605 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-31 22:13:00,606 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 22:13:00,606 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.10 10:12:59" (1/3) ... [2024-10-31 22:13:00,607 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49f6257f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.10 10:13:00, skipping insertion in model container [2024-10-31 22:13:00,608 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 22:13:00,608 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:59" (2/3) ... [2024-10-31 22:13:00,608 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49f6257f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.10 10:13:00, skipping insertion in model container [2024-10-31 22:13:00,608 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 22:13:00,608 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:13:00" (3/3) ... [2024-10-31 22:13:00,610 INFO L332 chiAutomizerObserver]: Analyzing ICFG simple-ext.i [2024-10-31 22:13:00,664 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-31 22:13:00,664 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-31 22:13:00,665 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-31 22:13:00,665 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-31 22:13:00,665 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-31 22:13:00,665 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-31 22:13:00,665 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-31 22:13:00,665 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-31 22:13:00,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 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) [2024-10-31 22:13:00,690 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2024-10-31 22:13:00,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:13:00,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:13:00,696 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-31 22:13:00,697 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-10-31 22:13:00,697 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-31 22:13:00,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 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) [2024-10-31 22:13:00,699 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2024-10-31 22:13:00,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:13:00,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:13:00,700 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-31 22:13:00,700 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-10-31 22:13:00,707 INFO L745 eck$LassoCheckResult]: Stem: 17#$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(13, 2); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 11#L533true assume main_~a~0#1.base == 0 && main_~a~0#1.offset == 0;assume { :begin_inline_myexit } true;myexit_#in~s#1 := 1;havoc myexit_~s#1;myexit_~s#1 := myexit_#in~s#1; 2#L525true [2024-10-31 22:13:00,708 INFO L747 eck$LassoCheckResult]: Loop: 2#L525true assume true; 2#L525true [2024-10-31 22:13:00,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:00,714 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-10-31 22:13:00,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:00,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670393285] [2024-10-31 22:13:00,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:00,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:00,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:00,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:00,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670393285] [2024-10-31 22:13:00,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670393285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:00,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:00,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:13:00,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544726544] [2024-10-31 22:13:00,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:00,973 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-31 22:13:00,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash 115, now seen corresponding path program 1 times [2024-10-31 22:13:00,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:00,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174567595] [2024-10-31 22:13:00,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:00,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:00,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:13:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:00,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:13:01,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:01,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:13:01,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:13:01,046 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 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, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-10-31 22:13:01,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:01,101 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-10-31 22:13:01,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2024-10-31 22:13:01,108 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2024-10-31 22:13:01,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 16 states and 20 transitions. [2024-10-31 22:13:01,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-10-31 22:13:01,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-10-31 22:13:01,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2024-10-31 22:13:01,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:13:01,119 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-31 22:13:01,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2024-10-31 22:13:01,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-31 22:13:01,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:01,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-10-31 22:13:01,164 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-31 22:13:01,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:13:01,171 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-31 22:13:01,171 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-31 22:13:01,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2024-10-31 22:13:01,173 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2024-10-31 22:13:01,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:13:01,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:13:01,174 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-31 22:13:01,174 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-31 22:13:01,175 INFO L745 eck$LassoCheckResult]: Stem: 67#$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(13, 2); 63#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 64#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 65#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 56#L537-5 [2024-10-31 22:13:01,175 INFO L747 eck$LassoCheckResult]: Loop: 56#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 58#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 59#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 61#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 55#L540-1 call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 56#L537-5 [2024-10-31 22:13:01,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:01,176 INFO L85 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2024-10-31 22:13:01,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:01,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231986899] [2024-10-31 22:13:01,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:01,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:01,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:13:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:01,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:13:01,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:01,212 INFO L85 PathProgramCache]: Analyzing trace with hash 43044216, now seen corresponding path program 1 times [2024-10-31 22:13:01,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:01,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786501488] [2024-10-31 22:13:01,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:01,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:01,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:13:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:01,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:13:01,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:01,281 INFO L85 PathProgramCache]: Analyzing trace with hash 2099908596, now seen corresponding path program 1 times [2024-10-31 22:13:01,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:01,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068930356] [2024-10-31 22:13:01,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:01,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:01,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:13:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:01,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:13:02,361 INFO L204 LassoAnalysis]: Preferences: [2024-10-31 22:13:02,362 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-31 22:13:02,363 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-31 22:13:02,363 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-31 22:13:02,363 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-31 22:13:02,363 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:13:02,363 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-31 22:13:02,364 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-31 22:13:02,364 INFO L132 ssoRankerPreferences]: Filename of dumped script: simple-ext.i_Iteration2_Lasso [2024-10-31 22:13:02,364 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-31 22:13:02,365 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-31 22:13:02,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:02,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:02,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:02,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:02,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:02,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:02,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:02,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:03,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:03,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:03,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:03,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:03,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:03,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:03,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:03,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:03,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:03,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:03,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:03,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:03,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:03,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:03,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:03,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:03,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:03,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:13:03,651 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-31 22:13:03,657 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-31 22:13:03,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:13:03,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:03,662 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:03,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-31 22:13:03,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-31 22:13:03,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:13:03,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 22:13:03,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:13:03,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:13:03,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:13:03,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 22:13:03,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 22:13:03,693 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:13:03,713 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-31 22:13:03,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:13:03,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:03,716 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:03,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-31 22:13:03,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-31 22:13:03,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:13:03,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 22:13:03,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:13:03,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:13:03,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:13:03,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 22:13:03,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 22:13:03,746 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:13:03,764 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-31 22:13:03,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:13:03,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:03,767 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:03,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-31 22:13:03,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-31 22:13:03,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:13:03,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 22:13:03,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:13:03,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:13:03,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:13:03,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 22:13:03,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 22:13:03,789 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:13:03,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-31 22:13:03,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:13:03,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:03,812 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:03,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-31 22:13:03,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-31 22:13:03,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:13:03,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 22:13:03,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:13:03,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:13:03,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:13:03,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 22:13:03,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 22:13:03,835 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:13:03,853 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-31 22:13:03,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:13:03,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:03,855 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:03,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-31 22:13:03,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-31 22:13:03,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:13:03,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 22:13:03,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:13:03,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:13:03,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:13:03,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 22:13:03,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 22:13:03,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:13:03,898 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-31 22:13:03,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:13:03,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:03,901 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:03,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-31 22:13:03,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-31 22:13:03,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:13:03,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:13:03,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:13:03,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:13:03,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 22:13:03,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 22:13:03,928 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:13:03,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-31 22:13:03,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:13:03,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:03,948 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:03,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-31 22:13:03,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-31 22:13:03,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:13:03,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 22:13:03,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:13:03,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:13:03,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:13:03,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 22:13:03,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 22:13:03,965 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:13:03,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-31 22:13:03,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:13:03,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:03,982 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:03,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-31 22:13:03,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-31 22:13:03,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:13:03,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 22:13:03,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:13:03,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:13:03,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:13:03,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 22:13:03,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 22:13:04,000 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:13:04,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-31 22:13:04,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:13:04,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:04,016 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:04,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-31 22:13:04,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-31 22:13:04,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:13:04,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 22:13:04,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:13:04,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:13:04,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:13:04,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 22:13:04,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 22:13:04,032 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:13:04,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-31 22:13:04,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:13:04,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:04,054 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:04,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-31 22:13:04,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-31 22:13:04,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:13:04,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 22:13:04,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:13:04,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:13:04,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:13:04,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 22:13:04,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 22:13:04,074 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:13:04,094 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-31 22:13:04,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:13:04,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:04,096 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:04,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-31 22:13:04,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-31 22:13:04,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:13:04,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:13:04,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:13:04,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:13:04,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 22:13:04,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 22:13:04,132 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:13:04,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-31 22:13:04,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:13:04,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:04,155 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:04,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-31 22:13:04,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-31 22:13:04,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:13:04,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 22:13:04,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:13:04,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:13:04,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:13:04,173 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 22:13:04,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 22:13:04,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:13:04,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-31 22:13:04,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:13:04,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:04,195 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:04,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-31 22:13:04,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-31 22:13:04,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:13:04,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:13:04,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:13:04,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:13:04,211 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 22:13:04,211 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 22:13:04,216 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:13:04,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-31 22:13:04,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:13:04,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:04,241 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:04,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-31 22:13:04,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-31 22:13:04,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:13:04,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:13:04,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:13:04,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:13:04,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 22:13:04,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 22:13:04,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:13:04,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-31 22:13:04,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:13:04,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:04,293 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:04,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-31 22:13:04,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-31 22:13:04,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:13:04,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-31 22:13:04,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:13:04,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:13:04,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:13:04,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-31 22:13:04,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-31 22:13:04,316 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:13:04,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-31 22:13:04,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:13:04,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:04,337 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:04,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-31 22:13:04,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-31 22:13:04,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:13:04,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:13:04,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:13:04,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:13:04,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 22:13:04,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 22:13:04,359 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:13:04,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-31 22:13:04,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:13:04,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:04,381 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:04,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-31 22:13:04,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-31 22:13:04,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:13:04,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:13:04,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:13:04,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:13:04,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 22:13:04,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 22:13:04,405 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-31 22:13:04,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-31 22:13:04,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:13:04,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:04,426 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:04,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-31 22:13:04,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-31 22:13:04,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-31 22:13:04,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-31 22:13:04,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-31 22:13:04,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-31 22:13:04,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-31 22:13:04,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-31 22:13:04,453 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-31 22:13:04,466 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-10-31 22:13:04,466 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-10-31 22:13:04,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:13:04,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:04,483 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:04,495 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-31 22:13:04,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-31 22:13:04,515 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-31 22:13:04,515 INFO L474 LassoAnalysis]: Proved termination. [2024-10-31 22:13:04,516 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 59 Supporting invariants [] [2024-10-31 22:13:04,535 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-31 22:13:04,556 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-10-31 22:13:04,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:04,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 22:13:04,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:04,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-31 22:13:04,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:04,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-31 22:13:04,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:04,765 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-31 22:13:04,766 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:04,867 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 35 transitions. Complement of second has 9 states. [2024-10-31 22:13:04,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-31 22:13:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2024-10-31 22:13:04,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 4 letters. Loop has 5 letters. [2024-10-31 22:13:04,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-31 22:13:04,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 9 letters. Loop has 5 letters. [2024-10-31 22:13:04,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-31 22:13:04,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 4 letters. Loop has 10 letters. [2024-10-31 22:13:04,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-31 22:13:04,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2024-10-31 22:13:04,877 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2024-10-31 22:13:04,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 30 transitions. [2024-10-31 22:13:04,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-10-31 22:13:04,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-31 22:13:04,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2024-10-31 22:13:04,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-31 22:13:04,882 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-10-31 22:13:04,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2024-10-31 22:13:04,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2024-10-31 22:13:04,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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) [2024-10-31 22:13:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-10-31 22:13:04,885 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-10-31 22:13:04,885 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-10-31 22:13:04,885 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-31 22:13:04,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2024-10-31 22:13:04,886 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2024-10-31 22:13:04,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:13:04,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:13:04,887 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:04,887 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-31 22:13:04,887 INFO L745 eck$LassoCheckResult]: Stem: 188#$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(13, 2); 183#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 184#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 185#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 186#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 176#L537-1 assume !main_#t~short5#1; 177#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 180#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 189#L549-2 [2024-10-31 22:13:04,888 INFO L747 eck$LassoCheckResult]: Loop: 189#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 190#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 191#L550-2 call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 189#L549-2 [2024-10-31 22:13:04,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:04,888 INFO L85 PathProgramCache]: Analyzing trace with hash 206288184, now seen corresponding path program 1 times [2024-10-31 22:13:04,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:04,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279131363] [2024-10-31 22:13:04,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:04,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:05,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:05,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279131363] [2024-10-31 22:13:05,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279131363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:05,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:05,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:13:05,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542041457] [2024-10-31 22:13:05,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:05,019 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-31 22:13:05,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:05,020 INFO L85 PathProgramCache]: Analyzing trace with hash 76912, now seen corresponding path program 1 times [2024-10-31 22:13:05,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:05,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125244788] [2024-10-31 22:13:05,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:05,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:05,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:13:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:05,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:13:05,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:05,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:13:05,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:13:05,157 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2024-10-31 22:13:05,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:05,210 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-10-31 22:13:05,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2024-10-31 22:13:05,211 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 7 [2024-10-31 22:13:05,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 42 transitions. [2024-10-31 22:13:05,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-10-31 22:13:05,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-31 22:13:05,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2024-10-31 22:13:05,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-31 22:13:05,213 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-10-31 22:13:05,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2024-10-31 22:13:05,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 22. [2024-10-31 22:13:05,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-10-31 22:13:05,215 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-31 22:13:05,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:13:05,216 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-31 22:13:05,216 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-31 22:13:05,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2024-10-31 22:13:05,217 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2024-10-31 22:13:05,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:13:05,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:13:05,218 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:05,218 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-31 22:13:05,218 INFO L745 eck$LassoCheckResult]: Stem: 253#$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(13, 2); 246#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 247#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 248#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 249#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 238#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 239#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 242#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 254#L549-2 [2024-10-31 22:13:05,218 INFO L747 eck$LassoCheckResult]: Loop: 254#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 255#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 256#L550-2 call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 254#L549-2 [2024-10-31 22:13:05,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:05,218 INFO L85 PathProgramCache]: Analyzing trace with hash 206286262, now seen corresponding path program 1 times [2024-10-31 22:13:05,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:05,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659071861] [2024-10-31 22:13:05,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:05,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:05,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:13:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:05,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:13:05,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:05,247 INFO L85 PathProgramCache]: Analyzing trace with hash 76912, now seen corresponding path program 2 times [2024-10-31 22:13:05,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:05,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636586815] [2024-10-31 22:13:05,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:05,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:05,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:13:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:05,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:13:05,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:05,261 INFO L85 PathProgramCache]: Analyzing trace with hash -624122213, now seen corresponding path program 1 times [2024-10-31 22:13:05,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:05,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984734480] [2024-10-31 22:13:05,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:05,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:05,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:05,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984734480] [2024-10-31 22:13:05,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984734480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:05,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:05,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:13:05,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820620762] [2024-10-31 22:13:05,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:05,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:05,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:13:05,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:13:05,667 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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) [2024-10-31 22:13:05,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:05,768 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-10-31 22:13:05,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2024-10-31 22:13:05,769 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 6 [2024-10-31 22:13:05,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 41 transitions. [2024-10-31 22:13:05,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-31 22:13:05,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-31 22:13:05,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2024-10-31 22:13:05,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-31 22:13:05,770 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-10-31 22:13:05,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2024-10-31 22:13:05,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2024-10-31 22:13:05,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:05,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-10-31 22:13:05,777 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-10-31 22:13:05,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:13:05,779 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-10-31 22:13:05,779 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-31 22:13:05,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2024-10-31 22:13:05,780 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2024-10-31 22:13:05,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:13:05,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:13:05,780 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:05,780 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-10-31 22:13:05,780 INFO L745 eck$LassoCheckResult]: Stem: 323#$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(13, 2); 316#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 317#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 318#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 319#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 320#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 329#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 313#L540 assume main_~t~0#1.base == 0 && main_~t~0#1.offset == 0;assume { :begin_inline_myexit } true;myexit_#in~s#1 := 1;havoc myexit_~s#1;myexit_~s#1 := myexit_#in~s#1; 322#L525-1 [2024-10-31 22:13:05,780 INFO L747 eck$LassoCheckResult]: Loop: 322#L525-1 assume true; 322#L525-1 [2024-10-31 22:13:05,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:05,781 INFO L85 PathProgramCache]: Analyzing trace with hash 206286315, now seen corresponding path program 1 times [2024-10-31 22:13:05,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:05,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975866962] [2024-10-31 22:13:05,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:05,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:05,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:05,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975866962] [2024-10-31 22:13:05,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975866962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:05,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:05,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:13:05,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711046921] [2024-10-31 22:13:05,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:05,816 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-31 22:13:05,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:05,816 INFO L85 PathProgramCache]: Analyzing trace with hash 116, now seen corresponding path program 1 times [2024-10-31 22:13:05,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:05,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768180865] [2024-10-31 22:13:05,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:05,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:05,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:13:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:05,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:13:05,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:05,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:13:05,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:13:05,825 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 11 Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-10-31 22:13:05,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:05,835 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2024-10-31 22:13:05,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2024-10-31 22:13:05,836 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-31 22:13:05,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 28 transitions. [2024-10-31 22:13:05,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-31 22:13:05,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-31 22:13:05,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2024-10-31 22:13:05,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-31 22:13:05,837 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-10-31 22:13:05,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2024-10-31 22:13:05,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-31 22:13:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-10-31 22:13:05,839 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-10-31 22:13:05,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:13:05,840 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-10-31 22:13:05,840 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-31 22:13:05,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2024-10-31 22:13:05,841 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-31 22:13:05,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:13:05,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:13:05,841 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:05,841 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-10-31 22:13:05,841 INFO L745 eck$LassoCheckResult]: Stem: 377#$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(13, 2); 370#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 371#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 372#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 373#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 363#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 364#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 367#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 376#L549-2 assume !(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0); 369#L549-3 main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; 362#L557-2 [2024-10-31 22:13:05,842 INFO L747 eck$LassoCheckResult]: Loop: 362#L557-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;call ULTIMATE.dealloc(main_~p~0#1.base, main_~p~0#1.offset);main_~p~0#1.base, main_~p~0#1.offset := main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset; 362#L557-2 [2024-10-31 22:13:05,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:05,842 INFO L85 PathProgramCache]: Analyzing trace with hash 672603628, now seen corresponding path program 1 times [2024-10-31 22:13:05,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:05,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007260594] [2024-10-31 22:13:05,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:05,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:05,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:05,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:05,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007260594] [2024-10-31 22:13:05,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007260594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:05,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:05,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:13:05,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800282605] [2024-10-31 22:13:05,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:05,886 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-31 22:13:05,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:05,886 INFO L85 PathProgramCache]: Analyzing trace with hash 107, now seen corresponding path program 1 times [2024-10-31 22:13:05,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:05,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416759516] [2024-10-31 22:13:05,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:05,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:05,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:13:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:05,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:13:05,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:05,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:13:05,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:13:05,966 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2024-10-31 22:13:06,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:06,006 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-10-31 22:13:06,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2024-10-31 22:13:06,007 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-31 22:13:06,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 26 states and 30 transitions. [2024-10-31 22:13:06,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-31 22:13:06,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-31 22:13:06,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2024-10-31 22:13:06,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-31 22:13:06,008 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-10-31 22:13:06,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2024-10-31 22:13:06,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2024-10-31 22:13:06,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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) [2024-10-31 22:13:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-31 22:13:06,010 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-31 22:13:06,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:13:06,011 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-31 22:13:06,011 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-31 22:13:06,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2024-10-31 22:13:06,012 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-31 22:13:06,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:13:06,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:13:06,013 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:06,013 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-31 22:13:06,013 INFO L745 eck$LassoCheckResult]: Stem: 437#$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(13, 2); 432#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 433#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 434#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 435#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 427#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 428#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 430#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 422#L540-1 call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 423#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 425#L537-1 assume !main_#t~short5#1; 426#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 429#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 438#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 439#L550 [2024-10-31 22:13:06,013 INFO L747 eck$LassoCheckResult]: Loop: 439#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 440#L550-2 call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 441#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 439#L550 [2024-10-31 22:13:06,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:06,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1728225128, now seen corresponding path program 1 times [2024-10-31 22:13:06,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:06,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384744094] [2024-10-31 22:13:06,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:06,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:06,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:06,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384744094] [2024-10-31 22:13:06,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384744094] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:13:06,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976413749] [2024-10-31 22:13:06,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:06,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:13:06,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:06,170 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:13:06,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-31 22:13:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:06,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-31 22:13:06,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:06,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:06,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:13:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:06,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976413749] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:13:06,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:13:06,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-31 22:13:06,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956370109] [2024-10-31 22:13:06,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:13:06,346 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-31 22:13:06,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:06,346 INFO L85 PathProgramCache]: Analyzing trace with hash 90412, now seen corresponding path program 3 times [2024-10-31 22:13:06,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:06,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161451370] [2024-10-31 22:13:06,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:06,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:06,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:13:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:06,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:13:06,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:06,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:13:06,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:13:06,496 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. cyclomatic complexity: 7 Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) [2024-10-31 22:13:06,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:06,614 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2024-10-31 22:13:06,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 74 transitions. [2024-10-31 22:13:06,615 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 7 [2024-10-31 22:13:06,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 74 transitions. [2024-10-31 22:13:06,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-10-31 22:13:06,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2024-10-31 22:13:06,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 74 transitions. [2024-10-31 22:13:06,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-31 22:13:06,618 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 74 transitions. [2024-10-31 22:13:06,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 74 transitions. [2024-10-31 22:13:06,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 36. [2024-10-31 22:13:06,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 35 states have internal predecessors, (43), 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) [2024-10-31 22:13:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-10-31 22:13:06,623 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-10-31 22:13:06,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:13:06,624 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-10-31 22:13:06,624 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-31 22:13:06,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2024-10-31 22:13:06,625 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-31 22:13:06,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:13:06,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:13:06,626 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:06,626 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-31 22:13:06,626 INFO L745 eck$LassoCheckResult]: Stem: 621#$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(13, 2); 613#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 614#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 615#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 616#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 617#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 638#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 619#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 620#L540-1 call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 618#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 606#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 607#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 610#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 622#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 623#L550 [2024-10-31 22:13:06,626 INFO L747 eck$LassoCheckResult]: Loop: 623#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 624#L550-2 call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 625#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 623#L550 [2024-10-31 22:13:06,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:06,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1728165546, now seen corresponding path program 1 times [2024-10-31 22:13:06,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:06,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236439894] [2024-10-31 22:13:06,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:06,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:06,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:13:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:06,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:13:06,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:06,665 INFO L85 PathProgramCache]: Analyzing trace with hash 90412, now seen corresponding path program 4 times [2024-10-31 22:13:06,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:06,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128496057] [2024-10-31 22:13:06,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:06,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:06,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:13:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:06,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:13:06,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:06,680 INFO L85 PathProgramCache]: Analyzing trace with hash 6864355, now seen corresponding path program 1 times [2024-10-31 22:13:06,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:06,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931328127] [2024-10-31 22:13:06,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:06,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:07,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:07,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:07,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931328127] [2024-10-31 22:13:07,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931328127] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:13:07,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000971354] [2024-10-31 22:13:07,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:07,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:13:07,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:07,050 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:13:07,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-31 22:13:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:07,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-31 22:13:07,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:07,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-31 22:13:07,307 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-31 22:13:07,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-31 22:13:07,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-31 22:13:07,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-31 22:13:07,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-31 22:13:07,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:07,474 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:13:07,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:13:07,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2024-10-31 22:13:07,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:13:07,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2024-10-31 22:13:07,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-10-31 22:13:07,812 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-31 22:13:07,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-10-31 22:13:08,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:08,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000971354] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:13:08,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:13:08,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2024-10-31 22:13:08,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050429746] [2024-10-31 22:13:08,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:13:08,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:08,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-31 22:13:08,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=250, Unknown=5, NotChecked=0, Total=306 [2024-10-31 22:13:08,150 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 10 Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:08,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:08,428 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-10-31 22:13:08,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 49 transitions. [2024-10-31 22:13:08,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-31 22:13:08,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 38 states and 44 transitions. [2024-10-31 22:13:08,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-31 22:13:08,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-31 22:13:08,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 44 transitions. [2024-10-31 22:13:08,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-31 22:13:08,433 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-10-31 22:13:08,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 44 transitions. [2024-10-31 22:13:08,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-10-31 22:13:08,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 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) [2024-10-31 22:13:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-10-31 22:13:08,436 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-10-31 22:13:08,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:13:08,440 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-10-31 22:13:08,440 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-31 22:13:08,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2024-10-31 22:13:08,441 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-31 22:13:08,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:13:08,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:13:08,442 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:08,442 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-31 22:13:08,442 INFO L745 eck$LassoCheckResult]: Stem: 829#$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(13, 2); 821#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 822#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 823#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 824#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 825#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 842#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 840#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 838#L540-1 call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 826#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 816#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 817#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 819#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 811#L540-1 call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 812#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 814#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 815#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 818#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 827#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 828#L550 [2024-10-31 22:13:08,442 INFO L747 eck$LassoCheckResult]: Loop: 828#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 830#L550-2 call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 831#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 828#L550 [2024-10-31 22:13:08,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:08,443 INFO L85 PathProgramCache]: Analyzing trace with hash 46254041, now seen corresponding path program 2 times [2024-10-31 22:13:08,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:08,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630474185] [2024-10-31 22:13:08,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:08,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:08,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:13:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:08,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:13:08,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:08,499 INFO L85 PathProgramCache]: Analyzing trace with hash 90412, now seen corresponding path program 5 times [2024-10-31 22:13:08,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:08,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306463698] [2024-10-31 22:13:08,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:08,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:08,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:13:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:08,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:13:08,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:08,511 INFO L85 PathProgramCache]: Analyzing trace with hash -730305964, now seen corresponding path program 2 times [2024-10-31 22:13:08,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:08,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205103080] [2024-10-31 22:13:08,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:08,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:09,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:09,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205103080] [2024-10-31 22:13:09,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205103080] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:13:09,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498118897] [2024-10-31 22:13:09,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-31 22:13:09,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:13:09,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:09,047 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:13:09,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-31 22:13:09,198 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-31 22:13:09,198 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 22:13:09,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-31 22:13:09,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:09,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-31 22:13:09,305 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-31 22:13:09,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-31 22:13:09,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-31 22:13:09,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-31 22:13:09,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-31 22:13:09,460 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-31 22:13:09,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-31 22:13:09,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-31 22:13:09,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-31 22:13:09,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-31 22:13:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:09,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:13:09,975 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-31 22:13:09,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-10-31 22:13:10,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:13:10,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-10-31 22:13:10,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:13:10,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 130 [2024-10-31 22:13:10,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2024-10-31 22:13:10,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2024-10-31 22:13:10,196 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-31 22:13:10,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-10-31 22:13:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:10,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498118897] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:13:10,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:13:10,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2024-10-31 22:13:10,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683432157] [2024-10-31 22:13:10,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:13:10,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:10,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-31 22:13:10,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=463, Unknown=6, NotChecked=0, Total=552 [2024-10-31 22:13:10,533 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 9 Second operand has 24 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 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) [2024-10-31 22:13:10,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:10,820 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-10-31 22:13:10,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2024-10-31 22:13:10,821 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-31 22:13:10,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2024-10-31 22:13:10,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-31 22:13:10,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-31 22:13:10,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-31 22:13:10,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:13:10,822 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-31 22:13:10,822 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-31 22:13:10,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:13:10,822 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-31 22:13:10,823 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-31 22:13:10,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-31 22:13:10,823 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-31 22:13:10,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-31 22:13:10,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 31.10 10:13:10 BoogieIcfgContainer [2024-10-31 22:13:10,830 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-31 22:13:10,831 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:13:10,831 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:13:10,831 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:13:10,832 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:13:00" (3/4) ... [2024-10-31 22:13:10,834 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:13:10,836 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:13:10,836 INFO L158 Benchmark]: Toolchain (without parser) took 11388.95ms. Allocated memory was 146.8MB in the beginning and 226.5MB in the end (delta: 79.7MB). Free memory was 112.1MB in the beginning and 146.7MB in the end (delta: -34.6MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2024-10-31 22:13:10,837 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 146.8MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:13:10,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.23ms. Allocated memory is still 146.8MB. Free memory was 111.5MB in the beginning and 92.7MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-31 22:13:10,837 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.42ms. Allocated memory is still 146.8MB. Free memory was 92.7MB in the beginning and 90.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:13:10,837 INFO L158 Benchmark]: Boogie Preprocessor took 66.80ms. Allocated memory is still 146.8MB. Free memory was 90.8MB in the beginning and 88.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:13:10,838 INFO L158 Benchmark]: RCFGBuilder took 478.03ms. Allocated memory is still 146.8MB. Free memory was 88.2MB in the beginning and 74.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-31 22:13:10,838 INFO L158 Benchmark]: BuchiAutomizer took 10231.83ms. Allocated memory was 146.8MB in the beginning and 226.5MB in the end (delta: 79.7MB). Free memory was 74.0MB in the beginning and 147.7MB in the end (delta: -73.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-10-31 22:13:10,838 INFO L158 Benchmark]: Witness Printer took 4.60ms. Allocated memory is still 226.5MB. Free memory was 147.7MB in the beginning and 146.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:13:10,840 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 146.8MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 541.23ms. Allocated memory is still 146.8MB. Free memory was 111.5MB in the beginning and 92.7MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.42ms. Allocated memory is still 146.8MB. Free memory was 92.7MB in the beginning and 90.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.80ms. Allocated memory is still 146.8MB. Free memory was 90.8MB in the beginning and 88.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 478.03ms. Allocated memory is still 146.8MB. Free memory was 88.2MB in the beginning and 74.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 10231.83ms. Allocated memory was 146.8MB in the beginning and 226.5MB in the end (delta: 79.7MB). Free memory was 74.0MB in the beginning and 147.7MB in the end (delta: -73.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Witness Printer took 4.60ms. Allocated memory is still 226.5MB. Free memory was 147.7MB in the beginning and 146.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (8 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i) + 59) and consists of 5 locations. 8 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.1s and 10 iterations. TraceHistogramMax:3. Analysis of lassos took 8.6s. Construction of modules took 0.5s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 59 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 221 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 220 mSDsluCounter, 388 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 276 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 445 IncrementalHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 112 mSDtfsCounter, 445 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN2 SILU3 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital247 mio100 ax107 hnf100 lsp86 ukn42 mio100 lsp26 div100 bol100 ite100 ukn100 eq146 hnf97 smp100 dnf151 smp85 tf100 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-31 22:13:10,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-10-31 22:13:11,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-10-31 22:13:11,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-10-31 22:13:11,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa02c08-2f4c-4464-a69a-018e8d61eb0c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE