./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme --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 64bit --witnessprinter.graph.data.programhash a94e514ac338898e2e1e54a42b19ae4490ac5c412319209fc14736a6de9b7386 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:50:46,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:50:46,168 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-11-26 11:50:46,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:50:46,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:50:46,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:50:46,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:50:46,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:50:46,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:50:46,203 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:50:46,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:50:46,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:50:46,205 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:50:46,206 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-26 11:50:46,206 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-26 11:50:46,207 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-26 11:50:46,208 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-26 11:50:46,208 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-26 11:50:46,209 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-26 11:50:46,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:50:46,210 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-26 11:50:46,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:50:46,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:50:46,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-26 11:50:46,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-26 11:50:46,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-26 11:50:46,214 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:50:46,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:50:46,215 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-26 11:50:46,215 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:50:46,216 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:50:46,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:50:46,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:50:46,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:50:46,218 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-26 11:50:46,218 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_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/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_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a94e514ac338898e2e1e54a42b19ae4490ac5c412319209fc14736a6de9b7386 [2023-11-26 11:50:46,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:50:46,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:50:46,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:50:46,567 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:50:46,567 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:50:46,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i [2023-11-26 11:50:49,697 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:50:49,961 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:50:49,966 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i [2023-11-26 11:50:49,987 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/data/a6cb9217c/bfdc18036a184c959ca46affe5228b81/FLAGddb50a84c [2023-11-26 11:50:50,005 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/data/a6cb9217c/bfdc18036a184c959ca46affe5228b81 [2023-11-26 11:50:50,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:50:50,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:50:50,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:50:50,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:50:50,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:50:50,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:50:50" (1/1) ... [2023-11-26 11:50:50,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ba2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:50, skipping insertion in model container [2023-11-26 11:50:50,027 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:50:50" (1/1) ... [2023-11-26 11:50:50,083 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:50:50,391 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:50:50,405 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:50:50,447 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:50:50,478 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:50:50,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:50 WrapperNode [2023-11-26 11:50:50,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:50:50,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:50:50,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:50:50,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:50:50,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:50" (1/1) ... [2023-11-26 11:50:50,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:50" (1/1) ... [2023-11-26 11:50:50,521 INFO L138 Inliner]: procedures = 115, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2023-11-26 11:50:50,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:50:50,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:50:50,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:50:50,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:50:50,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:50" (1/1) ... [2023-11-26 11:50:50,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:50" (1/1) ... [2023-11-26 11:50:50,537 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:50" (1/1) ... [2023-11-26 11:50:50,555 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2023-11-26 11:50:50,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:50" (1/1) ... [2023-11-26 11:50:50,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:50" (1/1) ... [2023-11-26 11:50:50,562 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:50" (1/1) ... [2023-11-26 11:50:50,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:50" (1/1) ... [2023-11-26 11:50:50,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:50" (1/1) ... [2023-11-26 11:50:50,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:50" (1/1) ... [2023-11-26 11:50:50,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:50:50,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:50:50,577 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:50:50,578 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:50:50,578 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:50" (1/1) ... [2023-11-26 11:50:50,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:50:50,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:50,622 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:50:50,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-26 11:50:50,660 INFO L130 BoogieDeclarations]: Found specification of procedure new_ll [2023-11-26 11:50:50,660 INFO L138 BoogieDeclarations]: Found implementation of procedure new_ll [2023-11-26 11:50:50,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:50:50,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 11:50:50,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-26 11:50:50,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-26 11:50:50,661 INFO L130 BoogieDeclarations]: Found specification of procedure length [2023-11-26 11:50:50,662 INFO L138 BoogieDeclarations]: Found implementation of procedure length [2023-11-26 11:50:50,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:50:50,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:50:50,762 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:50:50,765 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:50:50,959 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:50:50,968 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:50:50,969 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:50:50,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:50:50 BoogieIcfgContainer [2023-11-26 11:50:50,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:50:50,972 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-26 11:50:50,972 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-26 11:50:50,977 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-26 11:50:50,978 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 11:50:50,978 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.11 11:50:50" (1/3) ... [2023-11-26 11:50:50,979 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@147baba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 11:50:50, skipping insertion in model container [2023-11-26 11:50:50,979 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 11:50:50,979 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:50" (2/3) ... [2023-11-26 11:50:50,980 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@147baba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 11:50:50, skipping insertion in model container [2023-11-26 11:50:50,980 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 11:50:50,980 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:50:50" (3/3) ... [2023-11-26 11:50:50,982 INFO L332 chiAutomizerObserver]: Analyzing ICFG ll_append-alloca-2.i [2023-11-26 11:50:51,042 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-26 11:50:51,042 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-26 11:50:51,042 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-26 11:50:51,042 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-26 11:50:51,042 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-26 11:50:51,043 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-26 11:50:51,043 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-26 11:50:51,043 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-26 11:50:51,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-26 11:50:51,078 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2023-11-26 11:50:51,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:50:51,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:50:51,085 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-26 11:50:51,086 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-26 11:50:51,086 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-26 11:50:51,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-26 11:50:51,094 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2023-11-26 11:50:51,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:50:51,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:50:51,095 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-26 11:50:51,095 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-26 11:50:51,104 INFO L748 eck$LassoCheckResult]: Stem: 22#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 12#L574true assume !(main_~n~0#1 < 1); 26#L577true call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 9#$Ultimate##0true [2023-11-26 11:50:51,105 INFO L750 eck$LassoCheckResult]: Loop: 9#$Ultimate##0true ~n := #in~n; 18#L548true assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int#0(~n, ~head~0.base, ~head~0.offset, 4); 13#L552true call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 9#$Ultimate##0true [2023-11-26 11:50:51,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:51,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1418244, now seen corresponding path program 1 times [2023-11-26 11:50:51,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:51,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118867146] [2023-11-26 11:50:51,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:51,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:51,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:50:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:51,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:50:51,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:51,327 INFO L85 PathProgramCache]: Analyzing trace with hash 29967, now seen corresponding path program 1 times [2023-11-26 11:50:51,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:51,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259822134] [2023-11-26 11:50:51,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:51,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:51,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:50:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:51,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:50:51,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:51,378 INFO L85 PathProgramCache]: Analyzing trace with hash -698765780, now seen corresponding path program 1 times [2023-11-26 11:50:51,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:51,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537638172] [2023-11-26 11:50:51,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:51,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:51,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:50:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:51,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:50:52,473 INFO L210 LassoAnalysis]: Preferences: [2023-11-26 11:50:52,474 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-26 11:50:52,474 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-26 11:50:52,474 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-26 11:50:52,475 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-26 11:50:52,475 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:50:52,475 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-26 11:50:52,475 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-26 11:50:52,475 INFO L133 ssoRankerPreferences]: Filename of dumped script: ll_append-alloca-2.i_Iteration1_Lasso [2023-11-26 11:50:52,475 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-26 11:50:52,476 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-26 11:50:52,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:50:52,964 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-26 11:50:52,968 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-26 11:50:52,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:50:52,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:52,974 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:50:52,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 11:50:52,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-26 11:50:53,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:50:53,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 11:50:53,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:50:53,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:50:53,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:50:53,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 11:50:53,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 11:50:53,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:50:53,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:53,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:50:53,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:53,057 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:50:53,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-26 11:50:53,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 11:50:53,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:50:53,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 11:50:53,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:50:53,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:50:53,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:50:53,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 11:50:53,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 11:50:53,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:50:53,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:53,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:50:53,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:53,109 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:50:53,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 11:50:53,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-26 11:50:53,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:50:53,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 11:50:53,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:50:53,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:50:53,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:50:53,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 11:50:53,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 11:50:53,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:50:53,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:53,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:50:53,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:53,169 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:50:53,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 11:50:53,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:50:53,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 11:50:53,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:50:53,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:50:53,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:50:53,193 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 11:50:53,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 11:50:53,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-26 11:50:53,204 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:50:53,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:53,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:50:53,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:53,216 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:50:53,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-26 11:50:53,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 11:50:53,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:50:53,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 11:50:53,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:50:53,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:50:53,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:50:53,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 11:50:53,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 11:50:53,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:50:53,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:53,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:50:53,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:53,278 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:50:53,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-26 11:50:53,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 11:50:53,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:50:53,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 11:50:53,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:50:53,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:50:53,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:50:53,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 11:50:53,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 11:50:53,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:50:53,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:53,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:50:53,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:53,319 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:50:53,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 11:50:53,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-26 11:50:53,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:50:53,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 11:50:53,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:50:53,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:50:53,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:50:53,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 11:50:53,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 11:50:53,362 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:50:53,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:53,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:50:53,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:53,378 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:50:53,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 11:50:53,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:50:53,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 11:50:53,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:50:53,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:50:53,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:50:53,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 11:50:53,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 11:50:53,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-26 11:50:53,424 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:50:53,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:53,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:50:53,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:53,436 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:50:53,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-26 11:50:53,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 11:50:53,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:50:53,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 11:50:53,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:50:53,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:50:53,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:50:53,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 11:50:53,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 11:50:53,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:50:53,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:53,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:50:53,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:53,483 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:50:53,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 11:50:53,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-26 11:50:53,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:50:53,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 11:50:53,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:50:53,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:50:53,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:50:53,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 11:50:53,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 11:50:53,530 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:50:53,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:53,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:50:53,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:53,537 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:50:53,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 11:50:53,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-26 11:50:53,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:50:53,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 11:50:53,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:50:53,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:50:53,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:50:53,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 11:50:53,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 11:50:53,571 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:50:53,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:53,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:50:53,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:53,588 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:50:53,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-26 11:50:53,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 11:50:53,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:50:53,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 11:50:53,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:50:53,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:50:53,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:50:53,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 11:50:53,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 11:50:53,626 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:50:53,630 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:53,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:50:53,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:53,632 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:50:53,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-26 11:50:53,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 11:50:53,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:50:53,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:50:53,657 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-26 11:50:53,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:50:53,676 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-11-26 11:50:53,677 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-11-26 11:50:53,700 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-26 11:50:53,731 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-11-26 11:50:53,731 INFO L444 ModelExtractionUtils]: 1 out of 11 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-11-26 11:50:53,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:50:53,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:53,759 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:50:53,765 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-26 11:50:53,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-26 11:50:53,798 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2023-11-26 11:50:53,798 INFO L513 LassoAnalysis]: Proved termination. [2023-11-26 11:50:53,799 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(new_ll_#in~n) = 1*new_ll_#in~n Supporting invariants [1*new_ll_#in~n >= 0] [2023-11-26 11:50:53,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:53,818 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2023-11-26 11:50:53,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:53,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-26 11:50:53,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:50:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:53,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-26 11:50:53,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:50:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:54,009 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2023-11-26 11:50:54,012 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:54,155 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4). Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 45 states and 54 transitions. Complement of second has 13 states. [2023-11-26 11:50:54,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-26 11:50:54,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:54,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2023-11-26 11:50:54,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2023-11-26 11:50:54,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 11:50:54,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2023-11-26 11:50:54,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 11:50:54,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2023-11-26 11:50:54,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 11:50:54,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2023-11-26 11:50:54,174 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-26 11:50:54,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 37 transitions. [2023-11-26 11:50:54,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2023-11-26 11:50:54,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2023-11-26 11:50:54,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2023-11-26 11:50:54,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-26 11:50:54,184 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-11-26 11:50:54,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2023-11-26 11:50:54,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-11-26 11:50:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-26 11:50:54,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-11-26 11:50:54,216 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-11-26 11:50:54,216 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-11-26 11:50:54,216 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-26 11:50:54,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2023-11-26 11:50:54,218 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-26 11:50:54,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:50:54,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:50:54,219 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:54,219 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 11:50:54,220 INFO L748 eck$LassoCheckResult]: Stem: 161#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 151#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 152#L574 assume !(main_~n~0#1 < 1); 140#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 155#$Ultimate##0 ~n := #in~n; 156#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 164#new_llFINAL assume true; 160#new_llEXIT >#57#return; 158#L577-1 main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; 159#L563 assume !(append_~x#1.base == 0 && append_~x#1.offset == 0);append_~s~0#1.base, append_~s~0#1.offset := append_~x#1.base, append_~x#1.offset; 162#L566-3 [2023-11-26 11:50:54,220 INFO L750 eck$LassoCheckResult]: Loop: 162#L566-3 call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#0(append_~x#1.base, 4 + append_~x#1.offset, 8); 163#L566-1 assume !!(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$#0(append_~x#1.base, 4 + append_~x#1.offset, 8);append_~x#1.base, append_~x#1.offset := append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset; 162#L566-3 [2023-11-26 11:50:54,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:54,221 INFO L85 PathProgramCache]: Analyzing trace with hash 772923198, now seen corresponding path program 1 times [2023-11-26 11:50:54,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:54,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845651743] [2023-11-26 11:50:54,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:54,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:54,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-26 11:50:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:54,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:54,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845651743] [2023-11-26 11:50:54,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845651743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:54,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:54,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:50:54,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636589703] [2023-11-26 11:50:54,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:54,498 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-26 11:50:54,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:54,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 1 times [2023-11-26 11:50:54,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:54,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261315577] [2023-11-26 11:50:54,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:54,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:54,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:50:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:54,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:50:54,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:54,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:50:54,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:50:54,584 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 11:50:54,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:50:54,675 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2023-11-26 11:50:54,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2023-11-26 11:50:54,677 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-26 11:50:54,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 35 transitions. [2023-11-26 11:50:54,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2023-11-26 11:50:54,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2023-11-26 11:50:54,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 35 transitions. [2023-11-26 11:50:54,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-26 11:50:54,680 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2023-11-26 11:50:54,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 35 transitions. [2023-11-26 11:50:54,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2023-11-26 11:50:54,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-26 11:50:54,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-26 11:50:54,684 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-26 11:50:54,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:50:54,686 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-26 11:50:54,686 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-26 11:50:54,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. [2023-11-26 11:50:54,687 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-26 11:50:54,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:50:54,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:50:54,688 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:54,688 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-26 11:50:54,689 INFO L748 eck$LassoCheckResult]: Stem: 236#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 223#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 224#L574 assume !(main_~n~0#1 < 1); 212#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 228#$Ultimate##0 ~n := #in~n; 220#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 221#new_llFINAL assume true; 233#new_llEXIT >#57#return; 231#L577-1 main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; 232#L563 assume append_~x#1.base == 0 && append_~x#1.offset == 0;append_#res#1.base, append_#res#1.offset := append_~y#1.base, append_~y#1.offset; 216#append_returnLabel#1 main_#t~ret10#1.base, main_#t~ret10#1.offset := append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;havoc append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset;assume { :end_inline_append } true;main_~y~0#1.base, main_~y~0#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset; 219#L579 call main_#t~ret11#1 := length(main_~y~0#1.base, main_~y~0#1.offset);< 227#$Ultimate##0 [2023-11-26 11:50:54,689 INFO L750 eck$LassoCheckResult]: Loop: 227#$Ultimate##0 ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 217#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$#0(~xs.base, 4 + ~xs.offset, 8); 218#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 227#$Ultimate##0 [2023-11-26 11:50:54,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:54,690 INFO L85 PathProgramCache]: Analyzing trace with hash -250149368, now seen corresponding path program 1 times [2023-11-26 11:50:54,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:54,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348695960] [2023-11-26 11:50:54,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:54,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:54,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-26 11:50:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:54,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:54,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348695960] [2023-11-26 11:50:54,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348695960] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:54,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:54,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:50:54,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701683566] [2023-11-26 11:50:54,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:54,812 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-26 11:50:54,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:54,813 INFO L85 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 1 times [2023-11-26 11:50:54,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:54,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817483396] [2023-11-26 11:50:54,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:54,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:54,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:50:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:54,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:50:54,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:54,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:50:54,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:50:54,984 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. cyclomatic complexity: 8 Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 11:50:55,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:50:55,092 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2023-11-26 11:50:55,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2023-11-26 11:50:55,096 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-26 11:50:55,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2023-11-26 11:50:55,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2023-11-26 11:50:55,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2023-11-26 11:50:55,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2023-11-26 11:50:55,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-26 11:50:55,100 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-11-26 11:50:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2023-11-26 11:50:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-26 11:50:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-26 11:50:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-11-26 11:50:55,109 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-11-26 11:50:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:50:55,111 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-11-26 11:50:55,111 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-26 11:50:55,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2023-11-26 11:50:55,113 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-26 11:50:55,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:50:55,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:50:55,114 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:55,114 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 11:50:55,115 INFO L748 eck$LassoCheckResult]: Stem: 306#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 296#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 297#L574 assume !(main_~n~0#1 < 1); 285#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 300#$Ultimate##0 ~n := #in~n; 295#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int#0(~n, ~head~0.base, ~head~0.offset, 4); 286#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 301#$Ultimate##0 ~n := #in~n; 293#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 294#new_llFINAL assume true; 298#new_llEXIT >#53#return; 284#L552-1 call write~$Pointer$#0(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 287#new_llFINAL assume true; 307#new_llEXIT >#57#return; 302#L577-1 main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; 303#L563 assume !(append_~x#1.base == 0 && append_~x#1.offset == 0);append_~s~0#1.base, append_~s~0#1.offset := append_~x#1.base, append_~x#1.offset; 304#L566-3 [2023-11-26 11:50:55,115 INFO L750 eck$LassoCheckResult]: Loop: 304#L566-3 call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#0(append_~x#1.base, 4 + append_~x#1.offset, 8); 305#L566-1 assume !!(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$#0(append_~x#1.base, 4 + append_~x#1.offset, 8);append_~x#1.base, append_~x#1.offset := append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset; 304#L566-3 [2023-11-26 11:50:55,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:55,115 INFO L85 PathProgramCache]: Analyzing trace with hash 704779872, now seen corresponding path program 1 times [2023-11-26 11:50:55,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:55,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895967751] [2023-11-26 11:50:55,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:55,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:55,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:55,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:50:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:55,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:50:55,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:55,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 2 times [2023-11-26 11:50:55,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:55,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062226871] [2023-11-26 11:50:55,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:55,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:55,195 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:50:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:55,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:50:55,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:55,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1311374651, now seen corresponding path program 1 times [2023-11-26 11:50:55,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:55,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718538692] [2023-11-26 11:50:55,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:55,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:55,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-26 11:50:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:55,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:50:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 11:50:55,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:55,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718538692] [2023-11-26 11:50:55,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718538692] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:50:55,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185881038] [2023-11-26 11:50:55,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:55,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:50:55,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:55,890 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:50:55,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-26 11:50:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:55,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-26 11:50:56,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:50:56,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2023-11-26 11:50:56,187 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 [2023-11-26 11:50:56,196 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 [2023-11-26 11:50:56,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:56,352 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:50:56,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-26 11:50:56,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185881038] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:50:56,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:50:56,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 21 [2023-11-26 11:50:56,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459414784] [2023-11-26 11:50:56,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:50:56,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:56,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-26 11:50:56,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2023-11-26 11:50:56,778 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 11:50:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:50:57,158 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2023-11-26 11:50:57,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2023-11-26 11:50:57,159 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-26 11:50:57,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 39 transitions. [2023-11-26 11:50:57,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2023-11-26 11:50:57,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2023-11-26 11:50:57,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2023-11-26 11:50:57,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-26 11:50:57,161 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-26 11:50:57,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2023-11-26 11:50:57,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-11-26 11:50:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 11:50:57,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-11-26 11:50:57,165 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-26 11:50:57,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-26 11:50:57,166 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-26 11:50:57,167 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-26 11:50:57,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2023-11-26 11:50:57,168 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-26 11:50:57,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:50:57,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:50:57,169 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:57,169 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-26 11:50:57,170 INFO L748 eck$LassoCheckResult]: Stem: 516#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 508#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 509#L574 assume !(main_~n~0#1 < 1); 498#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 512#$Ultimate##0 ~n := #in~n; 507#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int#0(~n, ~head~0.base, ~head~0.offset, 4); 497#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 513#$Ultimate##0 ~n := #in~n; 505#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 506#new_llFINAL assume true; 510#new_llEXIT >#53#return; 496#L552-1 call write~$Pointer$#0(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 499#new_llFINAL assume true; 526#new_llEXIT >#57#return; 514#L577-1 main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; 515#L563 assume append_~x#1.base == 0 && append_~x#1.offset == 0;append_#res#1.base, append_#res#1.offset := append_~y#1.base, append_~y#1.offset; 501#append_returnLabel#1 main_#t~ret10#1.base, main_#t~ret10#1.offset := append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;havoc append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset;assume { :end_inline_append } true;main_~y~0#1.base, main_~y~0#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset; 503#L579 call main_#t~ret11#1 := length(main_~y~0#1.base, main_~y~0#1.offset);< 511#$Ultimate##0 [2023-11-26 11:50:57,170 INFO L750 eck$LassoCheckResult]: Loop: 511#$Ultimate##0 ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 502#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$#0(~xs.base, 4 + ~xs.offset, 8); 504#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 511#$Ultimate##0 [2023-11-26 11:50:57,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:57,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1311376214, now seen corresponding path program 1 times [2023-11-26 11:50:57,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:57,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146441465] [2023-11-26 11:50:57,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:57,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:57,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-26 11:50:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:57,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:50:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:57,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-26 11:50:57,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:57,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146441465] [2023-11-26 11:50:57,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146441465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:57,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:57,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:50:57,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237162068] [2023-11-26 11:50:57,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:57,311 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-26 11:50:57,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:57,312 INFO L85 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 2 times [2023-11-26 11:50:57,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:57,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406967773] [2023-11-26 11:50:57,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:57,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:57,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:50:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:57,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:50:57,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:57,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:50:57,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:50:57,447 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 11:50:57,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:50:57,513 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2023-11-26 11:50:57,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 40 transitions. [2023-11-26 11:50:57,515 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-26 11:50:57,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 40 transitions. [2023-11-26 11:50:57,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2023-11-26 11:50:57,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2023-11-26 11:50:57,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2023-11-26 11:50:57,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-26 11:50:57,517 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-11-26 11:50:57,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2023-11-26 11:50:57,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2023-11-26 11:50:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 11:50:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-11-26 11:50:57,521 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-11-26 11:50:57,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:50:57,523 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-11-26 11:50:57,523 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-26 11:50:57,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2023-11-26 11:50:57,524 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-26 11:50:57,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:50:57,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:50:57,525 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:57,525 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-26 11:50:57,525 INFO L748 eck$LassoCheckResult]: Stem: 613#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 601#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 602#L574 assume !(main_~n~0#1 < 1); 591#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 605#$Ultimate##0 ~n := #in~n; 600#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int#0(~n, ~head~0.base, ~head~0.offset, 4); 590#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 606#$Ultimate##0 ~n := #in~n; 598#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 599#new_llFINAL assume true; 604#new_llEXIT >#53#return; 609#L552-1 call write~$Pointer$#0(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 619#new_llFINAL assume true; 615#new_llEXIT >#57#return; 607#L577-1 main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; 608#L563 assume !(append_~x#1.base == 0 && append_~x#1.offset == 0);append_~s~0#1.base, append_~s~0#1.offset := append_~x#1.base, append_~x#1.offset; 617#L566-3 call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#0(append_~x#1.base, 4 + append_~x#1.offset, 8); 612#L566-1 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset; 593#L566-4 call write~$Pointer$#0(append_~y#1.base, append_~y#1.offset, append_~x#1.base, 4 + append_~x#1.offset, 8);append_#res#1.base, append_#res#1.offset := append_~s~0#1.base, append_~s~0#1.offset; 594#append_returnLabel#1 main_#t~ret10#1.base, main_#t~ret10#1.offset := append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;havoc append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset;assume { :end_inline_append } true;main_~y~0#1.base, main_~y~0#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset; 597#L579 call main_#t~ret11#1 := length(main_~y~0#1.base, main_~y~0#1.offset);< 603#$Ultimate##0 [2023-11-26 11:50:57,526 INFO L750 eck$LassoCheckResult]: Loop: 603#$Ultimate##0 ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 595#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$#0(~xs.base, 4 + ~xs.offset, 8); 596#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 603#$Ultimate##0 [2023-11-26 11:50:57,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:57,526 INFO L85 PathProgramCache]: Analyzing trace with hash -139719339, now seen corresponding path program 1 times [2023-11-26 11:50:57,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:57,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720005098] [2023-11-26 11:50:57,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:57,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:57,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:50:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:57,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:50:57,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:57,564 INFO L85 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 3 times [2023-11-26 11:50:57,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:57,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126714176] [2023-11-26 11:50:57,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:57,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:57,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:50:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:57,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:50:57,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:57,573 INFO L85 PathProgramCache]: Analyzing trace with hash -555510211, now seen corresponding path program 1 times [2023-11-26 11:50:57,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:57,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173329795] [2023-11-26 11:50:57,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:57,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:57,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:50:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:57,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:50:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:59,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:50:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:59,969 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret3 [2023-11-26 11:50:59,970 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret9 [2023-11-26 11:50:59,983 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret3 [2023-11-26 11:50:59,983 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret9 [2023-11-26 11:50:59,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.11 11:50:59 BoogieIcfgContainer [2023-11-26 11:50:59,986 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-26 11:50:59,987 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:50:59,987 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:50:59,987 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:50:59,988 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:50:50" (3/4) ... [2023-11-26 11:50:59,990 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-26 11:50:59,994 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret3 [2023-11-26 11:50:59,995 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret9 [2023-11-26 11:51:00,047 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 11:51:00,047 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:51:00,048 INFO L158 Benchmark]: Toolchain (without parser) took 10034.81ms. Allocated memory was 138.4MB in the beginning and 182.5MB in the end (delta: 44.0MB). Free memory was 97.0MB in the beginning and 60.3MB in the end (delta: 36.7MB). Peak memory consumption was 82.6MB. Max. memory is 16.1GB. [2023-11-26 11:51:00,048 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 138.4MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:51:00,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.75ms. Allocated memory is still 138.4MB. Free memory was 96.8MB in the beginning and 80.2MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-26 11:51:00,049 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.20ms. Allocated memory is still 138.4MB. Free memory was 80.2MB in the beginning and 78.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:51:00,049 INFO L158 Benchmark]: Boogie Preprocessor took 49.10ms. Allocated memory is still 138.4MB. Free memory was 78.5MB in the beginning and 76.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:51:00,050 INFO L158 Benchmark]: RCFGBuilder took 399.02ms. Allocated memory is still 138.4MB. Free memory was 76.0MB in the beginning and 63.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 11:51:00,050 INFO L158 Benchmark]: BuchiAutomizer took 9014.27ms. Allocated memory was 138.4MB in the beginning and 182.5MB in the end (delta: 44.0MB). Free memory was 63.5MB in the beginning and 62.4MB in the end (delta: 1.0MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2023-11-26 11:51:00,051 INFO L158 Benchmark]: Witness Printer took 60.48ms. Allocated memory is still 182.5MB. Free memory was 62.4MB in the beginning and 60.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:51:00,053 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 138.4MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.75ms. Allocated memory is still 138.4MB. Free memory was 96.8MB in the beginning and 80.2MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.20ms. Allocated memory is still 138.4MB. Free memory was 80.2MB in the beginning and 78.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.10ms. Allocated memory is still 138.4MB. Free memory was 78.5MB in the beginning and 76.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 399.02ms. Allocated memory is still 138.4MB. Free memory was 76.0MB in the beginning and 63.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 9014.27ms. Allocated memory was 138.4MB in the beginning and 182.5MB in the end (delta: 44.0MB). Free memory was 63.5MB in the beginning and 62.4MB in the end (delta: 1.0MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. * Witness Printer took 60.48ms. Allocated memory is still 182.5MB. Free memory was 62.4MB in the beginning and 60.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret9 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret9 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret9 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(n) and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 22 locations. The remainder module has 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 7.7s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 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, 79 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 329 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 259 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 382 IncrementalHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 70 mSDtfsCounter, 382 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital138 mio100 ax100 hnf100 lsp100 ukn31 mio100 lsp39 div100 bol100 ite100 ukn100 eq217 hnf86 smp100 dnf112 smp100 tf100 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 167ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 555]: Nontermination argument in form of an infinite program execution. [2023-11-26 11:51:00,080 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret3 [2023-11-26 11:51:00,082 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret9 [2023-11-26 11:51:00,087 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret3 [2023-11-26 11:51:00,091 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret9 Nontermination argument in form of an infinite program execution. Stem: [L573] int n = __VERIFIER_nondet_int(); [L574] COND FALSE !(n < 1) VAL [n=1] [L577] CALL, EXPR new_ll(n) VAL [\old(n)=1] [L548] COND FALSE !(n == 0) [L550] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n VAL [\old(n)=1, head={-1:0}, n=1] [L552] CALL, EXPR new_ll(n-1) VAL [\old(n)=0] [L548] COND TRUE n == 0 [L549] return ((void *)0); VAL [\old(n)=0, \result={0:0}, n=0] [L552] RET, EXPR new_ll(n-1) VAL [\old(n)=1, head={-1:0}, n=1] [L552] head->next = new_ll(n-1) [L553] return head; VAL [\old(n)=1, \result={-1:0}, head={-1:0}, n=1] [L577] RET, EXPR new_ll(n) VAL [n=1] [L577] node_t* x = new_ll(n); [L578] CALL, EXPR append(x, x) [L563] COND FALSE !(x == ((void *)0)) [L565] node_t* s = x; VAL [s={-1:0}, x={-1:0}, x={-1:0}, y={-1:0}, y={-1:0}] [L566] EXPR x->next [L566] COND FALSE !(x->next != ((void *)0)) [L568] x->next = y [L569] return s; VAL [\result={-1:0}, s={-1:0}, x={-1:0}, x={-1:0}, y={-1:0}, y={-1:0}] [L578] RET, EXPR append(x, x) [L578] node_t* y = append(x, x); [L579] CALL length(y) VAL [xs={-1:0}] Loop: [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 555]: Nonterminating execution [2023-11-26 11:51:00,104 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret3 [2023-11-26 11:51:00,108 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret9 [2023-11-26 11:51:00,112 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret3 [2023-11-26 11:51:00,116 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret9 Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L573] int n = __VERIFIER_nondet_int(); [L574] COND FALSE !(n < 1) VAL [n=1] [L577] CALL, EXPR new_ll(n) VAL [\old(n)=1] [L548] COND FALSE !(n == 0) [L550] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n VAL [\old(n)=1, head={-1:0}, n=1] [L552] CALL, EXPR new_ll(n-1) VAL [\old(n)=0] [L548] COND TRUE n == 0 [L549] return ((void *)0); VAL [\old(n)=0, \result={0:0}, n=0] [L552] RET, EXPR new_ll(n-1) VAL [\old(n)=1, head={-1:0}, n=1] [L552] head->next = new_ll(n-1) [L553] return head; VAL [\old(n)=1, \result={-1:0}, head={-1:0}, n=1] [L577] RET, EXPR new_ll(n) VAL [n=1] [L577] node_t* x = new_ll(n); [L578] CALL, EXPR append(x, x) [L563] COND FALSE !(x == ((void *)0)) [L565] node_t* s = x; VAL [s={-1:0}, x={-1:0}, x={-1:0}, y={-1:0}, y={-1:0}] [L566] EXPR x->next [L566] COND FALSE !(x->next != ((void *)0)) [L568] x->next = y [L569] return s; VAL [\result={-1:0}, s={-1:0}, x={-1:0}, x={-1:0}, y={-1:0}, y={-1:0}] [L578] RET, EXPR append(x, x) [L578] node_t* y = append(x, x); [L579] CALL length(y) VAL [xs={-1:0}] Loop: [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-26 11:51:00,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-26 11:51:00,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1ca6b0b-0dbc-4d18-9ce7-467e8ffa0bf1/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)