./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:52:30,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:52:30,162 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 17:52:30,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:52:30,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:52:30,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:52:30,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:52:30,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:52:30,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:52:30,213 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:52:30,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:52:30,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:52:30,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:52:30,218 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:52:30,218 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:52:30,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:52:30,219 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:52:30,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:52:30,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:52:30,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:52:30,224 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 17:52:30,225 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 17:52:30,227 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 17:52:30,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:52:30,228 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:52:30,228 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:52:30,228 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 17:52:30,229 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:52:30,229 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:52:30,229 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:52:30,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:52:30,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:52:30,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:52:30,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:52:30,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:52:30,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:52:30,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:52:30,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:52:30,232 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:52:30,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:52:30,232 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:52:30,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:52:30,235 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/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_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX 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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 [2024-11-08 17:52:30,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:52:30,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:52:30,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:52:30,565 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:52:30,565 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:52:30,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i Unable to find full path for "g++" [2024-11-08 17:52:32,495 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:52:32,808 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:52:32,809 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2024-11-08 17:52:32,832 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/data/453554e27/08dacd937e5948268d786eca58cdd5d6/FLAGda60fe862 [2024-11-08 17:52:32,847 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/data/453554e27/08dacd937e5948268d786eca58cdd5d6 [2024-11-08 17:52:32,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:52:32,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:52:32,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:52:32,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:52:32,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:52:32,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:52:32" (1/1) ... [2024-11-08 17:52:32,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43d3c1ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:52:32, skipping insertion in model container [2024-11-08 17:52:32,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:52:32" (1/1) ... [2024-11-08 17:52:32,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:52:33,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:52:33,360 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:52:33,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:52:33,473 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:52:33,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:52:33 WrapperNode [2024-11-08 17:52:33,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:52:33,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:52:33,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:52:33,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:52:33,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:52:33" (1/1) ... [2024-11-08 17:52:33,497 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:52:33" (1/1) ... [2024-11-08 17:52:33,528 INFO L138 Inliner]: procedures = 129, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-11-08 17:52:33,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:52:33,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:52:33,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:52:33,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:52:33,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:52:33" (1/1) ... [2024-11-08 17:52:33,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:52:33" (1/1) ... [2024-11-08 17:52:33,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:52:33" (1/1) ... [2024-11-08 17:52:33,579 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 5, 13]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 6 writes are split as follows [0, 1, 5]. [2024-11-08 17:52:33,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:52:33" (1/1) ... [2024-11-08 17:52:33,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:52:33" (1/1) ... [2024-11-08 17:52:33,589 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:52:33" (1/1) ... [2024-11-08 17:52:33,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:52:33" (1/1) ... [2024-11-08 17:52:33,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:52:33" (1/1) ... [2024-11-08 17:52:33,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:52:33" (1/1) ... [2024-11-08 17:52:33,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:52:33,601 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:52:33,602 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:52:33,602 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:52:33,603 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:52:33" (1/1) ... [2024-11-08 17:52:33,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:52:33,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:52:33,638 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:52:33,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:52:33,678 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-08 17:52:33,679 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-08 17:52:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 17:52:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:52:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 17:52:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 17:52:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 17:52:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 17:52:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 17:52:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 17:52:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 17:52:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 17:52:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 17:52:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 17:52:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 17:52:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:52:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 17:52:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 17:52:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:52:33,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:52:33,848 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:52:33,850 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:52:33,877 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-08 17:52:34,346 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-11-08 17:52:34,346 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:52:34,361 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:52:34,361 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 17:52:34,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:52:34 BoogieIcfgContainer [2024-11-08 17:52:34,362 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:52:34,364 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:52:34,364 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:52:34,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:52:34,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:52:32" (1/3) ... [2024-11-08 17:52:34,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589ed970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:52:34, skipping insertion in model container [2024-11-08 17:52:34,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:52:33" (2/3) ... [2024-11-08 17:52:34,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589ed970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:52:34, skipping insertion in model container [2024-11-08 17:52:34,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:52:34" (3/3) ... [2024-11-08 17:52:34,371 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-1.i [2024-11-08 17:52:34,389 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:52:34,389 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2024-11-08 17:52:34,436 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:52:34,442 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@dbc6d1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:52:34,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2024-11-08 17:52:34,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 82 states have (on average 1.8414634146341464) internal successors, (151), 125 states have internal predecessors, (151), 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) [2024-11-08 17:52:34,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 17:52:34,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:34,454 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 17:52:34,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:34,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:34,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1083014, now seen corresponding path program 1 times [2024-11-08 17:52:34,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:34,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827755253] [2024-11-08 17:52:34,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:34,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:34,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:52:34,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:34,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827755253] [2024-11-08 17:52:34,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827755253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:52:34,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:52:34,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:52:34,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457987769] [2024-11-08 17:52:34,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:52:34,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:52:34,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:34,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:52:34,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:52:34,738 INFO L87 Difference]: Start difference. First operand has 127 states, 82 states have (on average 1.8414634146341464) internal successors, (151), 125 states have internal predecessors, (151), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:34,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:34,888 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2024-11-08 17:52:34,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:52:34,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-08 17:52:34,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:34,898 INFO L225 Difference]: With dead ends: 153 [2024-11-08 17:52:34,899 INFO L226 Difference]: Without dead ends: 147 [2024-11-08 17:52:34,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:52:34,906 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 129 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:34,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 130 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:52:34,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-08 17:52:34,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 118. [2024-11-08 17:52:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 78 states have (on average 1.7692307692307692) internal successors, (138), 117 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2024-11-08 17:52:34,945 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 4 [2024-11-08 17:52:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:34,945 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2024-11-08 17:52:34,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:34,946 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2024-11-08 17:52:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 17:52:34,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:34,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 17:52:34,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:52:34,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:34,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:34,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1083015, now seen corresponding path program 1 times [2024-11-08 17:52:34,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:34,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676845550] [2024-11-08 17:52:34,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:34,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:35,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:52:35,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:35,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676845550] [2024-11-08 17:52:35,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676845550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:52:35,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:52:35,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:52:35,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950891581] [2024-11-08 17:52:35,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:52:35,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:52:35,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:35,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:52:35,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:52:35,014 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:35,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:35,060 INFO L93 Difference]: Finished difference Result 167 states and 193 transitions. [2024-11-08 17:52:35,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:52:35,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-08 17:52:35,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:35,062 INFO L225 Difference]: With dead ends: 167 [2024-11-08 17:52:35,063 INFO L226 Difference]: Without dead ends: 167 [2024-11-08 17:52:35,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:52:35,065 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 54 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:35,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 255 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:52:35,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-08 17:52:35,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 120. [2024-11-08 17:52:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 80 states have (on average 1.75) internal successors, (140), 119 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2024-11-08 17:52:35,077 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 4 [2024-11-08 17:52:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:35,077 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2024-11-08 17:52:35,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:35,078 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2024-11-08 17:52:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 17:52:35,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:35,079 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:35,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:52:35,079 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:35,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:35,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1354207463, now seen corresponding path program 1 times [2024-11-08 17:52:35,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:35,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213258039] [2024-11-08 17:52:35,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:35,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:35,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:52:35,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:35,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213258039] [2024-11-08 17:52:35,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213258039] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:52:35,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480847268] [2024-11-08 17:52:35,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:35,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:52:35,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:52:35,205 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:52:35,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:52:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:35,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:52:35,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:52:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:52:35,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:52:35,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:52:35,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480847268] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:52:35,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:52:35,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-08 17:52:35,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180386682] [2024-11-08 17:52:35,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:52:35,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:52:35,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:35,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:52:35,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:52:35,453 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:35,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:35,557 INFO L93 Difference]: Finished difference Result 256 states and 292 transitions. [2024-11-08 17:52:35,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:52:35,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-08 17:52:35,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:35,560 INFO L225 Difference]: With dead ends: 256 [2024-11-08 17:52:35,560 INFO L226 Difference]: Without dead ends: 256 [2024-11-08 17:52:35,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:52:35,562 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 273 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:35,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 751 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:52:35,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-08 17:52:35,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 185. [2024-11-08 17:52:35,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 145 states have (on average 1.7517241379310344) internal successors, (254), 184 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 254 transitions. [2024-11-08 17:52:35,574 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 254 transitions. Word has length 10 [2024-11-08 17:52:35,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:35,575 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 254 transitions. [2024-11-08 17:52:35,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:35,575 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 254 transitions. [2024-11-08 17:52:35,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 17:52:35,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:35,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:35,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:52:35,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:52:35,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:35,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:35,778 INFO L85 PathProgramCache]: Analyzing trace with hash -24822914, now seen corresponding path program 1 times [2024-11-08 17:52:35,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:35,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286845454] [2024-11-08 17:52:35,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:35,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:52:35,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:35,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286845454] [2024-11-08 17:52:35,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286845454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:52:35,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:52:35,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:52:35,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350586601] [2024-11-08 17:52:35,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:52:35,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:52:35,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:35,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:52:35,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:52:35,902 INFO L87 Difference]: Start difference. First operand 185 states and 254 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:35,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:35,991 INFO L93 Difference]: Finished difference Result 184 states and 251 transitions. [2024-11-08 17:52:35,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:52:35,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-08 17:52:35,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:35,993 INFO L225 Difference]: With dead ends: 184 [2024-11-08 17:52:35,993 INFO L226 Difference]: Without dead ends: 184 [2024-11-08 17:52:35,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:52:35,995 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:35,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 222 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:52:35,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-08 17:52:36,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-11-08 17:52:36,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 145 states have (on average 1.7310344827586206) internal successors, (251), 183 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:36,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 251 transitions. [2024-11-08 17:52:36,007 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 251 transitions. Word has length 13 [2024-11-08 17:52:36,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:36,008 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 251 transitions. [2024-11-08 17:52:36,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:36,008 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 251 transitions. [2024-11-08 17:52:36,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 17:52:36,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:36,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:36,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:52:36,009 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:36,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:36,010 INFO L85 PathProgramCache]: Analyzing trace with hash -24822913, now seen corresponding path program 1 times [2024-11-08 17:52:36,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:36,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362772585] [2024-11-08 17:52:36,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:36,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:52:36,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:36,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362772585] [2024-11-08 17:52:36,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362772585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:52:36,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:52:36,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:52:36,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297509436] [2024-11-08 17:52:36,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:52:36,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:52:36,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:36,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:52:36,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:52:36,124 INFO L87 Difference]: Start difference. First operand 184 states and 251 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:36,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:36,210 INFO L93 Difference]: Finished difference Result 183 states and 248 transitions. [2024-11-08 17:52:36,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:52:36,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-08 17:52:36,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:36,212 INFO L225 Difference]: With dead ends: 183 [2024-11-08 17:52:36,212 INFO L226 Difference]: Without dead ends: 183 [2024-11-08 17:52:36,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:52:36,213 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:36,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 226 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:52:36,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-08 17:52:36,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-11-08 17:52:36,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 145 states have (on average 1.710344827586207) internal successors, (248), 182 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:36,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 248 transitions. [2024-11-08 17:52:36,229 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 248 transitions. Word has length 13 [2024-11-08 17:52:36,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:36,229 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 248 transitions. [2024-11-08 17:52:36,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:36,230 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 248 transitions. [2024-11-08 17:52:36,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 17:52:36,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:36,234 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:36,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:52:36,235 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:36,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:36,235 INFO L85 PathProgramCache]: Analyzing trace with hash -24271910, now seen corresponding path program 1 times [2024-11-08 17:52:36,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:36,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650167031] [2024-11-08 17:52:36,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:36,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:36,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:52:36,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:36,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650167031] [2024-11-08 17:52:36,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650167031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:52:36,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:52:36,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:52:36,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404968994] [2024-11-08 17:52:36,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:52:36,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:52:36,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:36,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:52:36,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:52:36,323 INFO L87 Difference]: Start difference. First operand 183 states and 248 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:36,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:36,402 INFO L93 Difference]: Finished difference Result 181 states and 242 transitions. [2024-11-08 17:52:36,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:52:36,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-08 17:52:36,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:36,403 INFO L225 Difference]: With dead ends: 181 [2024-11-08 17:52:36,404 INFO L226 Difference]: Without dead ends: 181 [2024-11-08 17:52:36,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:52:36,405 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 8 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:36,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 205 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:52:36,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-08 17:52:36,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-11-08 17:52:36,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 145 states have (on average 1.6689655172413793) internal successors, (242), 180 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 242 transitions. [2024-11-08 17:52:36,420 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 242 transitions. Word has length 13 [2024-11-08 17:52:36,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:36,420 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 242 transitions. [2024-11-08 17:52:36,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 242 transitions. [2024-11-08 17:52:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 17:52:36,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:36,425 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:36,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:52:36,425 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:36,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:36,426 INFO L85 PathProgramCache]: Analyzing trace with hash -24271909, now seen corresponding path program 1 times [2024-11-08 17:52:36,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:36,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705348454] [2024-11-08 17:52:36,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:36,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:52:36,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:36,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705348454] [2024-11-08 17:52:36,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705348454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:52:36,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:52:36,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:52:36,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40465216] [2024-11-08 17:52:36,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:52:36,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:52:36,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:36,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:52:36,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:52:36,558 INFO L87 Difference]: Start difference. First operand 181 states and 242 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:36,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:36,667 INFO L93 Difference]: Finished difference Result 260 states and 336 transitions. [2024-11-08 17:52:36,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:52:36,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-08 17:52:36,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:36,669 INFO L225 Difference]: With dead ends: 260 [2024-11-08 17:52:36,670 INFO L226 Difference]: Without dead ends: 260 [2024-11-08 17:52:36,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:52:36,672 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 124 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:36,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 629 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:52:36,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-08 17:52:36,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 187. [2024-11-08 17:52:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 151 states have (on average 1.6423841059602649) internal successors, (248), 186 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 248 transitions. [2024-11-08 17:52:36,688 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 248 transitions. Word has length 13 [2024-11-08 17:52:36,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:36,689 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 248 transitions. [2024-11-08 17:52:36,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:36,689 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 248 transitions. [2024-11-08 17:52:36,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 17:52:36,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:36,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:36,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:52:36,694 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:36,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:36,695 INFO L85 PathProgramCache]: Analyzing trace with hash -751729501, now seen corresponding path program 1 times [2024-11-08 17:52:36,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:36,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880456981] [2024-11-08 17:52:36,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:36,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:52:36,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:36,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880456981] [2024-11-08 17:52:36,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880456981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:52:36,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680806172] [2024-11-08 17:52:36,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:36,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:52:36,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:52:36,874 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:52:36,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 17:52:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:36,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 17:52:36,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:52:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:52:37,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:52:37,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:52:37,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680806172] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:52:37,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:52:37,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-08 17:52:37,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270082549] [2024-11-08 17:52:37,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:52:37,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:52:37,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:37,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:52:37,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:52:37,132 INFO L87 Difference]: Start difference. First operand 187 states and 248 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:37,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:37,275 INFO L93 Difference]: Finished difference Result 278 states and 351 transitions. [2024-11-08 17:52:37,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:52:37,276 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-08 17:52:37,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:37,277 INFO L225 Difference]: With dead ends: 278 [2024-11-08 17:52:37,277 INFO L226 Difference]: Without dead ends: 278 [2024-11-08 17:52:37,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:52:37,278 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 129 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:37,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1067 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:52:37,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-08 17:52:37,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 214. [2024-11-08 17:52:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 178 states have (on average 1.5280898876404494) internal successors, (272), 213 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:37,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 272 transitions. [2024-11-08 17:52:37,287 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 272 transitions. Word has length 18 [2024-11-08 17:52:37,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:37,288 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 272 transitions. [2024-11-08 17:52:37,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 272 transitions. [2024-11-08 17:52:37,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 17:52:37,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:37,289 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2024-11-08 17:52:37,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 17:52:37,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:52:37,490 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:37,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:37,490 INFO L85 PathProgramCache]: Analyzing trace with hash 978308519, now seen corresponding path program 2 times [2024-11-08 17:52:37,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:37,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851389682] [2024-11-08 17:52:37,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:37,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 17:52:37,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:37,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851389682] [2024-11-08 17:52:37,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851389682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:52:37,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:52:37,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:52:37,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040268713] [2024-11-08 17:52:37,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:52:37,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:52:37,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:37,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:52:37,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:52:37,582 INFO L87 Difference]: Start difference. First operand 214 states and 272 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:37,670 INFO L93 Difference]: Finished difference Result 268 states and 344 transitions. [2024-11-08 17:52:37,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:52:37,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-08 17:52:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:37,672 INFO L225 Difference]: With dead ends: 268 [2024-11-08 17:52:37,672 INFO L226 Difference]: Without dead ends: 268 [2024-11-08 17:52:37,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:52:37,674 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 42 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:37,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 217 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:52:37,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-08 17:52:37,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 258. [2024-11-08 17:52:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 222 states have (on average 1.5360360360360361) internal successors, (341), 257 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:37,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 341 transitions. [2024-11-08 17:52:37,681 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 341 transitions. Word has length 22 [2024-11-08 17:52:37,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:37,682 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 341 transitions. [2024-11-08 17:52:37,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:37,682 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 341 transitions. [2024-11-08 17:52:37,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 17:52:37,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:37,683 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:37,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:52:37,683 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:37,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:37,684 INFO L85 PathProgramCache]: Analyzing trace with hash 322594723, now seen corresponding path program 2 times [2024-11-08 17:52:37,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:37,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266586894] [2024-11-08 17:52:37,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:37,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 17:52:38,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:38,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266586894] [2024-11-08 17:52:38,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266586894] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:52:38,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52558348] [2024-11-08 17:52:38,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 17:52:38,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:52:38,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:52:38,168 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:52:38,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 17:52:38,292 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 17:52:38,292 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:52:38,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 17:52:38,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:52:38,332 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 6 treesize of output 5 [2024-11-08 17:52:38,343 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 [2024-11-08 17:52:38,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:52:38,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-08 17:52:38,417 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-08 17:52:38,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-08 17:52:38,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:52:38,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-08 17:52:38,508 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 17:52:38,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 17:52:38,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:52:38,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-08 17:52:38,700 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-08 17:52:38,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-08 17:52:38,745 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 17:52:38,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:52:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 17:52:39,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52558348] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:52:39,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:52:39,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-11-08 17:52:39,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667386581] [2024-11-08 17:52:39,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:52:39,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:52:39,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:39,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:52:39,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:52:39,708 INFO L87 Difference]: Start difference. First operand 258 states and 341 transitions. Second operand has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:39,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:39,946 INFO L93 Difference]: Finished difference Result 256 states and 335 transitions. [2024-11-08 17:52:39,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:52:39,946 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-08 17:52:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:39,948 INFO L225 Difference]: With dead ends: 256 [2024-11-08 17:52:39,948 INFO L226 Difference]: Without dead ends: 256 [2024-11-08 17:52:39,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:52:39,949 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 10 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:39,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 280 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:52:39,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-08 17:52:39,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2024-11-08 17:52:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 222 states have (on average 1.509009009009009) internal successors, (335), 255 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:39,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 335 transitions. [2024-11-08 17:52:39,955 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 335 transitions. Word has length 28 [2024-11-08 17:52:39,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:39,955 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 335 transitions. [2024-11-08 17:52:39,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:39,955 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 335 transitions. [2024-11-08 17:52:39,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 17:52:39,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:39,956 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:39,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 17:52:40,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 17:52:40,161 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:40,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:40,162 INFO L85 PathProgramCache]: Analyzing trace with hash 627466290, now seen corresponding path program 1 times [2024-11-08 17:52:40,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:40,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436967674] [2024-11-08 17:52:40,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:40,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:40,252 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 17:52:40,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:40,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436967674] [2024-11-08 17:52:40,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436967674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:52:40,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:52:40,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:52:40,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146546893] [2024-11-08 17:52:40,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:52:40,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:52:40,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:40,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:52:40,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:52:40,253 INFO L87 Difference]: Start difference. First operand 256 states and 335 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:40,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:40,347 INFO L93 Difference]: Finished difference Result 376 states and 479 transitions. [2024-11-08 17:52:40,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:52:40,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-08 17:52:40,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:40,349 INFO L225 Difference]: With dead ends: 376 [2024-11-08 17:52:40,349 INFO L226 Difference]: Without dead ends: 376 [2024-11-08 17:52:40,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:52:40,350 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 45 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:40,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 477 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:52:40,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-08 17:52:40,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 359. [2024-11-08 17:52:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 325 states have (on average 1.436923076923077) internal successors, (467), 358 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 467 transitions. [2024-11-08 17:52:40,358 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 467 transitions. Word has length 29 [2024-11-08 17:52:40,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:40,358 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 467 transitions. [2024-11-08 17:52:40,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:40,358 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 467 transitions. [2024-11-08 17:52:40,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 17:52:40,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:40,359 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:40,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:52:40,360 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:40,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:40,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1629175051, now seen corresponding path program 1 times [2024-11-08 17:52:40,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:40,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660625262] [2024-11-08 17:52:40,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:40,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 17:52:40,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:40,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660625262] [2024-11-08 17:52:40,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660625262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:52:40,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:52:40,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:52:40,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505108947] [2024-11-08 17:52:40,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:52:40,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:52:40,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:40,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:52:40,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:52:40,447 INFO L87 Difference]: Start difference. First operand 359 states and 467 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:40,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:40,551 INFO L93 Difference]: Finished difference Result 390 states and 501 transitions. [2024-11-08 17:52:40,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:52:40,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-08 17:52:40,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:40,553 INFO L225 Difference]: With dead ends: 390 [2024-11-08 17:52:40,554 INFO L226 Difference]: Without dead ends: 388 [2024-11-08 17:52:40,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:52:40,554 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 30 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:40,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 296 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:52:40,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-08 17:52:40,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 362. [2024-11-08 17:52:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 328 states have (on average 1.4329268292682926) internal successors, (470), 361 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 470 transitions. [2024-11-08 17:52:40,563 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 470 transitions. Word has length 29 [2024-11-08 17:52:40,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:40,563 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 470 transitions. [2024-11-08 17:52:40,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:40,563 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 470 transitions. [2024-11-08 17:52:40,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 17:52:40,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:40,564 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:40,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:52:40,564 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:40,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:40,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1629217665, now seen corresponding path program 1 times [2024-11-08 17:52:40,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:40,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730199645] [2024-11-08 17:52:40,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:40,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:40,682 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 17:52:40,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:40,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730199645] [2024-11-08 17:52:40,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730199645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:52:40,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:52:40,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:52:40,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863283517] [2024-11-08 17:52:40,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:52:40,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:52:40,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:40,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:52:40,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:52:40,684 INFO L87 Difference]: Start difference. First operand 362 states and 470 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:40,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:40,754 INFO L93 Difference]: Finished difference Result 380 states and 482 transitions. [2024-11-08 17:52:40,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:52:40,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-08 17:52:40,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:40,756 INFO L225 Difference]: With dead ends: 380 [2024-11-08 17:52:40,756 INFO L226 Difference]: Without dead ends: 374 [2024-11-08 17:52:40,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:52:40,757 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 41 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:40,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 476 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:52:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-08 17:52:40,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 357. [2024-11-08 17:52:40,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 323 states have (on average 1.4396284829721362) internal successors, (465), 356 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:40,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 465 transitions. [2024-11-08 17:52:40,764 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 465 transitions. Word has length 29 [2024-11-08 17:52:40,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:40,764 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 465 transitions. [2024-11-08 17:52:40,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:40,765 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 465 transitions. [2024-11-08 17:52:40,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 17:52:40,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:40,766 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:40,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 17:52:40,766 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:40,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:40,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1160284119, now seen corresponding path program 1 times [2024-11-08 17:52:40,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:40,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557648423] [2024-11-08 17:52:40,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:40,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:40,884 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 17:52:40,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:40,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557648423] [2024-11-08 17:52:40,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557648423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:52:40,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:52:40,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:52:40,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570458588] [2024-11-08 17:52:40,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:52:40,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:52:40,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:40,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:52:40,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:52:40,887 INFO L87 Difference]: Start difference. First operand 357 states and 465 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:41,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:41,005 INFO L93 Difference]: Finished difference Result 356 states and 459 transitions. [2024-11-08 17:52:41,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:52:41,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-08 17:52:41,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:41,007 INFO L225 Difference]: With dead ends: 356 [2024-11-08 17:52:41,007 INFO L226 Difference]: Without dead ends: 356 [2024-11-08 17:52:41,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:52:41,008 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 29 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:41,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 351 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:52:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-08 17:52:41,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2024-11-08 17:52:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 323 states have (on average 1.4210526315789473) internal successors, (459), 355 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:41,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 459 transitions. [2024-11-08 17:52:41,016 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 459 transitions. Word has length 33 [2024-11-08 17:52:41,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:41,016 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 459 transitions. [2024-11-08 17:52:41,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:41,016 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 459 transitions. [2024-11-08 17:52:41,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 17:52:41,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:41,017 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:41,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 17:52:41,017 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:41,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:41,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1160284118, now seen corresponding path program 1 times [2024-11-08 17:52:41,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:41,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742543037] [2024-11-08 17:52:41,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:41,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:41,192 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 17:52:41,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:41,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742543037] [2024-11-08 17:52:41,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742543037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:52:41,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:52:41,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:52:41,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455530042] [2024-11-08 17:52:41,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:52:41,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:52:41,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:41,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:52:41,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:52:41,195 INFO L87 Difference]: Start difference. First operand 356 states and 459 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:41,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:41,311 INFO L93 Difference]: Finished difference Result 355 states and 453 transitions. [2024-11-08 17:52:41,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:52:41,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-08 17:52:41,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:41,313 INFO L225 Difference]: With dead ends: 355 [2024-11-08 17:52:41,313 INFO L226 Difference]: Without dead ends: 355 [2024-11-08 17:52:41,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:52:41,314 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 29 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:41,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 464 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:52:41,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-08 17:52:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2024-11-08 17:52:41,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 323 states have (on average 1.4024767801857585) internal successors, (453), 354 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:41,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 453 transitions. [2024-11-08 17:52:41,321 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 453 transitions. Word has length 33 [2024-11-08 17:52:41,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:41,322 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 453 transitions. [2024-11-08 17:52:41,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:41,322 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 453 transitions. [2024-11-08 17:52:41,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 17:52:41,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:41,323 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:41,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 17:52:41,323 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:41,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:41,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1609069272, now seen corresponding path program 1 times [2024-11-08 17:52:41,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:41,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313529971] [2024-11-08 17:52:41,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:41,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:41,666 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 17:52:41,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:41,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313529971] [2024-11-08 17:52:41,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313529971] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:52:41,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940533977] [2024-11-08 17:52:41,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:41,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:52:41,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:52:41,669 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:52:41,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 17:52:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:41,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 17:52:41,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:52:41,828 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 6 treesize of output 5 [2024-11-08 17:52:41,868 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 17:52:41,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-08 17:52:41,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:52:41,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-08 17:52:41,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:52:41,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-08 17:52:42,008 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-08 17:52:42,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2024-11-08 17:52:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 17:52:42,184 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:52:42,653 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 17:52:42,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940533977] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:52:42,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:52:42,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2024-11-08 17:52:42,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366405553] [2024-11-08 17:52:42,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:52:42,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:52:42,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:42,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:52:42,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:52:42,656 INFO L87 Difference]: Start difference. First operand 355 states and 453 transitions. Second operand has 16 states, 15 states have (on average 5.4) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:42,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:42,980 INFO L93 Difference]: Finished difference Result 385 states and 480 transitions. [2024-11-08 17:52:42,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:52:42,980 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.4) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-08 17:52:42,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:42,982 INFO L225 Difference]: With dead ends: 385 [2024-11-08 17:52:42,982 INFO L226 Difference]: Without dead ends: 385 [2024-11-08 17:52:42,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-08 17:52:42,983 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 343 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:42,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 470 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:52:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-08 17:52:42,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 353. [2024-11-08 17:52:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 323 states have (on average 1.3746130030959753) internal successors, (444), 352 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:42,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 444 transitions. [2024-11-08 17:52:42,990 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 444 transitions. Word has length 34 [2024-11-08 17:52:42,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:42,991 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 444 transitions. [2024-11-08 17:52:42,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.4) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:42,991 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 444 transitions. [2024-11-08 17:52:42,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 17:52:42,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:42,992 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:43,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 17:52:43,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 17:52:43,193 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:43,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:43,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1609069271, now seen corresponding path program 1 times [2024-11-08 17:52:43,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:43,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123122255] [2024-11-08 17:52:43,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:43,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 17:52:43,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:43,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123122255] [2024-11-08 17:52:43,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123122255] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:52:43,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907724728] [2024-11-08 17:52:43,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:43,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:52:43,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:52:43,752 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:52:43,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 17:52:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:43,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 17:52:43,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:52:43,904 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 [2024-11-08 17:52:43,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:52:43,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-08 17:52:44,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:52:44,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-08 17:52:44,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:52:44,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-08 17:52:44,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:52:44,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-08 17:52:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 17:52:44,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:52:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 17:52:44,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907724728] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:52:44,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:52:44,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2024-11-08 17:52:44,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032187291] [2024-11-08 17:52:44,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:52:44,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 17:52:44,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:44,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 17:52:44,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:52:44,865 INFO L87 Difference]: Start difference. First operand 353 states and 444 transitions. Second operand has 13 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:45,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:45,094 INFO L93 Difference]: Finished difference Result 352 states and 434 transitions. [2024-11-08 17:52:45,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:52:45,094 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-08 17:52:45,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:45,096 INFO L225 Difference]: With dead ends: 352 [2024-11-08 17:52:45,096 INFO L226 Difference]: Without dead ends: 352 [2024-11-08 17:52:45,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:52:45,097 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 300 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:45,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 394 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:52:45,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-08 17:52:45,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 349. [2024-11-08 17:52:45,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 323 states have (on average 1.3343653250773995) internal successors, (431), 348 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:45,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 431 transitions. [2024-11-08 17:52:45,104 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 431 transitions. Word has length 34 [2024-11-08 17:52:45,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:45,104 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 431 transitions. [2024-11-08 17:52:45,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 431 transitions. [2024-11-08 17:52:45,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 17:52:45,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:45,105 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:45,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 17:52:45,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-08 17:52:45,306 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:45,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:45,306 INFO L85 PathProgramCache]: Analyzing trace with hash 347360240, now seen corresponding path program 1 times [2024-11-08 17:52:45,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:45,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107689290] [2024-11-08 17:52:45,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:45,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:45,517 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 17:52:45,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:45,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107689290] [2024-11-08 17:52:45,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107689290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:52:45,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:52:45,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:52:45,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082318989] [2024-11-08 17:52:45,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:52:45,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:52:45,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:45,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:52:45,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:52:45,519 INFO L87 Difference]: Start difference. First operand 349 states and 431 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:45,615 INFO L93 Difference]: Finished difference Result 311 states and 362 transitions. [2024-11-08 17:52:45,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:52:45,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-08 17:52:45,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:45,617 INFO L225 Difference]: With dead ends: 311 [2024-11-08 17:52:45,617 INFO L226 Difference]: Without dead ends: 311 [2024-11-08 17:52:45,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:52:45,617 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 26 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:45,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 568 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:52:45,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-08 17:52:45,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 308. [2024-11-08 17:52:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 282 states have (on average 1.2730496453900708) internal successors, (359), 307 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 359 transitions. [2024-11-08 17:52:45,624 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 359 transitions. Word has length 37 [2024-11-08 17:52:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:45,624 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 359 transitions. [2024-11-08 17:52:45,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:45,624 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 359 transitions. [2024-11-08 17:52:45,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 17:52:45,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:45,625 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:45,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 17:52:45,626 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:45,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:45,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1426298165, now seen corresponding path program 1 times [2024-11-08 17:52:45,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:45,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509790587] [2024-11-08 17:52:45,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:45,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-08 17:52:45,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:45,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509790587] [2024-11-08 17:52:45,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509790587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:52:45,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:52:45,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:52:45,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314007067] [2024-11-08 17:52:45,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:52:45,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:52:45,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:45,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:52:45,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:52:45,733 INFO L87 Difference]: Start difference. First operand 308 states and 359 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:45,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:45,782 INFO L93 Difference]: Finished difference Result 374 states and 431 transitions. [2024-11-08 17:52:45,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:52:45,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-08 17:52:45,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:45,784 INFO L225 Difference]: With dead ends: 374 [2024-11-08 17:52:45,784 INFO L226 Difference]: Without dead ends: 374 [2024-11-08 17:52:45,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:52:45,785 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 135 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:45,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 281 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:52:45,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-08 17:52:45,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 308. [2024-11-08 17:52:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 282 states have (on average 1.2730496453900708) internal successors, (359), 307 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 359 transitions. [2024-11-08 17:52:45,791 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 359 transitions. Word has length 63 [2024-11-08 17:52:45,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:45,792 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 359 transitions. [2024-11-08 17:52:45,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 359 transitions. [2024-11-08 17:52:45,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 17:52:45,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:45,793 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:45,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 17:52:45,793 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:45,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:45,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1426247525, now seen corresponding path program 1 times [2024-11-08 17:52:45,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:45,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645258144] [2024-11-08 17:52:45,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:45,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:46,113 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 17:52:46,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:46,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645258144] [2024-11-08 17:52:46,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645258144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:52:46,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:52:46,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:52:46,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192549747] [2024-11-08 17:52:46,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:52:46,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:52:46,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:46,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:52:46,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:52:46,116 INFO L87 Difference]: Start difference. First operand 308 states and 359 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:46,463 INFO L93 Difference]: Finished difference Result 318 states and 372 transitions. [2024-11-08 17:52:46,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:52:46,464 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-08 17:52:46,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:46,465 INFO L225 Difference]: With dead ends: 318 [2024-11-08 17:52:46,465 INFO L226 Difference]: Without dead ends: 318 [2024-11-08 17:52:46,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:52:46,466 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 129 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:46,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 614 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:52:46,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-08 17:52:46,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 310. [2024-11-08 17:52:46,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 285 states have (on average 1.2771929824561403) internal successors, (364), 309 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:46,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 364 transitions. [2024-11-08 17:52:46,473 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 364 transitions. Word has length 63 [2024-11-08 17:52:46,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:46,473 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 364 transitions. [2024-11-08 17:52:46,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:46,473 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 364 transitions. [2024-11-08 17:52:46,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 17:52:46,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:46,474 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:46,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 17:52:46,474 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:46,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:46,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1426247526, now seen corresponding path program 1 times [2024-11-08 17:52:46,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:46,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735038207] [2024-11-08 17:52:46,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:46,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:46,712 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:52:46,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:46,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735038207] [2024-11-08 17:52:46,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735038207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:52:46,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882556683] [2024-11-08 17:52:46,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:46,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:52:46,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:52:46,716 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:52:46,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 17:52:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:46,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 17:52:46,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:52:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:52:46,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:52:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:52:47,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882556683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:52:47,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:52:47,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2024-11-08 17:52:47,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739006041] [2024-11-08 17:52:47,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:52:47,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 17:52:47,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:47,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 17:52:47,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:52:47,064 INFO L87 Difference]: Start difference. First operand 310 states and 364 transitions. Second operand has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:47,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:47,379 INFO L93 Difference]: Finished difference Result 416 states and 472 transitions. [2024-11-08 17:52:47,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:52:47,380 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-08 17:52:47,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:47,382 INFO L225 Difference]: With dead ends: 416 [2024-11-08 17:52:47,382 INFO L226 Difference]: Without dead ends: 416 [2024-11-08 17:52:47,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 118 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2024-11-08 17:52:47,383 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 319 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:47,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1598 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:52:47,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-08 17:52:47,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 363. [2024-11-08 17:52:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 338 states have (on average 1.2810650887573964) internal successors, (433), 362 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 433 transitions. [2024-11-08 17:52:47,390 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 433 transitions. Word has length 63 [2024-11-08 17:52:47,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:47,391 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 433 transitions. [2024-11-08 17:52:47,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 433 transitions. [2024-11-08 17:52:47,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 17:52:47,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:47,392 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:47,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 17:52:47,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-08 17:52:47,596 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:47,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:47,596 INFO L85 PathProgramCache]: Analyzing trace with hash 951530214, now seen corresponding path program 2 times [2024-11-08 17:52:47,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:47,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443839677] [2024-11-08 17:52:47,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:47,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 17:52:48,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:48,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443839677] [2024-11-08 17:52:48,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443839677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:52:48,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:52:48,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:52:48,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72752202] [2024-11-08 17:52:48,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:52:48,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:52:48,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:48,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:52:48,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:52:48,170 INFO L87 Difference]: Start difference. First operand 363 states and 433 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:48,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:48,509 INFO L93 Difference]: Finished difference Result 414 states and 505 transitions. [2024-11-08 17:52:48,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:52:48,510 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-08 17:52:48,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:48,511 INFO L225 Difference]: With dead ends: 414 [2024-11-08 17:52:48,511 INFO L226 Difference]: Without dead ends: 414 [2024-11-08 17:52:48,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:52:48,512 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 151 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:48,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 602 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:52:48,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-08 17:52:48,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 403. [2024-11-08 17:52:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 378 states have (on average 1.3148148148148149) internal successors, (497), 402 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 497 transitions. [2024-11-08 17:52:48,520 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 497 transitions. Word has length 63 [2024-11-08 17:52:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:48,520 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 497 transitions. [2024-11-08 17:52:48,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 497 transitions. [2024-11-08 17:52:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 17:52:48,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:48,521 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:48,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 17:52:48,522 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:48,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:48,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1305060488, now seen corresponding path program 1 times [2024-11-08 17:52:48,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:48,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327056161] [2024-11-08 17:52:48,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:48,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 17:52:48,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:48,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327056161] [2024-11-08 17:52:48,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327056161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:52:48,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:52:48,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:52:48,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377830700] [2024-11-08 17:52:48,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:52:48,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:52:48,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:48,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:52:48,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:52:48,790 INFO L87 Difference]: Start difference. First operand 403 states and 497 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:48,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:48,994 INFO L93 Difference]: Finished difference Result 412 states and 493 transitions. [2024-11-08 17:52:48,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:52:48,995 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-08 17:52:48,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:48,996 INFO L225 Difference]: With dead ends: 412 [2024-11-08 17:52:48,996 INFO L226 Difference]: Without dead ends: 412 [2024-11-08 17:52:48,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:52:49,000 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 143 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:49,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 728 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:52:49,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-08 17:52:49,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 403. [2024-11-08 17:52:49,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 378 states have (on average 1.2883597883597884) internal successors, (487), 402 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 487 transitions. [2024-11-08 17:52:49,009 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 487 transitions. Word has length 63 [2024-11-08 17:52:49,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:49,009 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 487 transitions. [2024-11-08 17:52:49,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:49,009 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 487 transitions. [2024-11-08 17:52:49,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 17:52:49,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:49,014 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:49,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 17:52:49,015 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:49,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:49,015 INFO L85 PathProgramCache]: Analyzing trace with hash -761127222, now seen corresponding path program 1 times [2024-11-08 17:52:49,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:49,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953510074] [2024-11-08 17:52:49,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:49,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:50,026 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 17:52:50,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:50,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953510074] [2024-11-08 17:52:50,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953510074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:52:50,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:52:50,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 17:52:50,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413804935] [2024-11-08 17:52:50,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:52:50,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 17:52:50,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:50,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 17:52:50,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-11-08 17:52:50,028 INFO L87 Difference]: Start difference. First operand 403 states and 487 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:50,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:50,719 INFO L93 Difference]: Finished difference Result 557 states and 695 transitions. [2024-11-08 17:52:50,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 17:52:50,720 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-08 17:52:50,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:50,722 INFO L225 Difference]: With dead ends: 557 [2024-11-08 17:52:50,722 INFO L226 Difference]: Without dead ends: 557 [2024-11-08 17:52:50,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2024-11-08 17:52:50,723 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 139 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:50,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1015 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:52:50,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-08 17:52:50,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 469. [2024-11-08 17:52:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 444 states have (on average 1.3063063063063063) internal successors, (580), 468 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 580 transitions. [2024-11-08 17:52:50,732 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 580 transitions. Word has length 67 [2024-11-08 17:52:50,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:50,733 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 580 transitions. [2024-11-08 17:52:50,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 580 transitions. [2024-11-08 17:52:50,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 17:52:50,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:50,734 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:50,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 17:52:50,734 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:50,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:50,735 INFO L85 PathProgramCache]: Analyzing trace with hash -761127221, now seen corresponding path program 1 times [2024-11-08 17:52:50,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:50,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510362653] [2024-11-08 17:52:50,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:50,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 17:52:52,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:52,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510362653] [2024-11-08 17:52:52,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510362653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:52:52,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:52:52,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 17:52:52,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907493428] [2024-11-08 17:52:52,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:52:52,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 17:52:52,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:52:52,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 17:52:52,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-11-08 17:52:52,596 INFO L87 Difference]: Start difference. First operand 469 states and 580 transitions. Second operand has 17 states, 16 states have (on average 3.1875) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:53,969 INFO L93 Difference]: Finished difference Result 665 states and 822 transitions. [2024-11-08 17:52:53,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-08 17:52:53,970 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-08 17:52:53,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:53,976 INFO L225 Difference]: With dead ends: 665 [2024-11-08 17:52:53,976 INFO L226 Difference]: Without dead ends: 665 [2024-11-08 17:52:53,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2024-11-08 17:52:53,977 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 158 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:53,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1280 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 17:52:53,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-08 17:52:53,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 469. [2024-11-08 17:52:53,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 444 states have (on average 1.3018018018018018) internal successors, (578), 468 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:53,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 578 transitions. [2024-11-08 17:52:53,991 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 578 transitions. Word has length 67 [2024-11-08 17:52:53,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:53,991 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 578 transitions. [2024-11-08 17:52:53,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:52:53,991 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 578 transitions. [2024-11-08 17:52:53,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 17:52:53,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:53,992 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:52:53,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 17:52:53,993 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-08 17:52:53,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:53,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1673558274, now seen corresponding path program 1 times [2024-11-08 17:52:53,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:52:53,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462450174] [2024-11-08 17:52:53,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:53,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:52:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 17:52:56,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:52:56,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462450174] [2024-11-08 17:52:56,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462450174] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:52:56,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093953014] [2024-11-08 17:52:56,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:56,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:52:56,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:52:56,594 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:52:56,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f04e608d-f165-4b48-96ee-040d13ad243b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 17:52:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:56,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-08 17:52:56,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:52:56,977 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 6 treesize of output 5 [2024-11-08 17:52:57,152 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 17:52:57,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-08 17:52:57,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 17:52:57,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 17:52:57,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-08 17:52:57,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2024-11-08 17:52:57,854 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-08 17:52:57,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 45 [2024-11-08 17:52:57,886 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2024-11-08 17:52:57,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2024-11-08 17:52:58,269 INFO L349 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2024-11-08 17:52:58,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 35 [2024-11-08 17:52:58,293 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 17:52:58,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 47 [2024-11-08 17:52:58,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 17:52:58,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 17:53:00,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:53:00,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 235 treesize of output 215 [2024-11-08 17:53:00,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:53:00,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 203 [2024-11-08 17:53:03,571 INFO L349 Elim1Store]: treesize reduction 16, result has 89.0 percent of original size [2024-11-08 17:53:03,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 162 treesize of output 236 [2024-11-08 17:53:03,774 INFO L349 Elim1Store]: treesize reduction 16, result has 89.0 percent of original size [2024-11-08 17:53:03,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 33 case distinctions, treesize of input 106 treesize of output 198 [2024-11-08 17:53:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 17:53:19,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:53:20,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 474 treesize of output 442 [2024-11-08 17:53:20,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 662 treesize of output 598 [2024-11-08 17:54:08,052 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~#head~1#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse1 (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#head~1#1.offset|))) (or (and (<= (+ |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset| 1) 0) .cse0 .cse1) (let ((.cse2 (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4))) (let ((.cse4 (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse53 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse59 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) (.cse56 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse53 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse57 (select .cse56 v_arrayElimCell_58)) (.cse58 (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse59 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58)) (.cse60 (+ 4 v_arrayElimCell_59))) (let ((.cse55 (select .cse58 .cse60)) (.cse54 (select .cse57 .cse60))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse53) .cse54) .cse55)) 1) (= (select |c_#valid| (select (select .cse56 (select .cse57 .cse2)) (select .cse58 .cse2))) 1) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse59) v_arrayElimCell_58) .cse2) 0) (= (select (select .cse56 .cse54) .cse55) 0) (< .cse55 0) (not (= (select |c_#valid| .cse54) 1)))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse61 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse64 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse61 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse65 (+ 4 v_arrayElimCell_59))) (let ((.cse63 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse65)) (.cse62 (select (select .cse64 v_arrayElimCell_58) .cse65))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse61) .cse62) .cse63)) 1) (= (select (select .cse64 .cse62) .cse63) 0) (< .cse63 0) (not (= (select |c_#valid| .cse62) 1))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse69 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|)) (.cse66 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse70 (+ 4 v_arrayElimCell_59))) (let ((.cse68 (select (select .cse66 v_arrayElimCell_58) .cse70)) (.cse67 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse69 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse70))) (or (= (select (select .cse66 .cse67) .cse68) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse69) .cse67) .cse68)) 1) (< .cse68 0) (not (= (select |c_#valid| .cse67) 1)))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse75 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|))) (let ((.cse74 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|)) (.cse71 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse75 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse76 (+ 4 v_arrayElimCell_59))) (let ((.cse73 (select (select .cse71 v_arrayElimCell_58) .cse76)) (.cse72 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse74 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse76))) (or (= (select (select .cse71 .cse72) .cse73) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse74) .cse72) .cse73)) 1) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse75) v_arrayElimCell_58) .cse2) 0) (< .cse73 0) (not (= (select |c_#valid| .cse72) 1))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse80 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|)) (.cse84 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|))) (let ((.cse77 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse84 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse81 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse80 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse82 (select .cse81 v_arrayElimCell_58)) (.cse83 (select .cse77 v_arrayElimCell_58)) (.cse85 (+ 4 v_arrayElimCell_59))) (let ((.cse79 (select .cse83 .cse85)) (.cse78 (select .cse82 .cse85))) (or (= (select (select .cse77 .cse78) .cse79) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse80) .cse78) .cse79)) 1) (= (select |c_#valid| (select (select .cse81 (select .cse82 .cse2)) (select .cse83 .cse2))) 1) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse84) v_arrayElimCell_58) .cse2) 0) (< .cse79 0) (not (= (select |c_#valid| .cse78) 1)))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse86 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse90 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse86 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse89 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) (.cse91 (+ 4 v_arrayElimCell_59))) (let ((.cse88 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse89 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse91)) (.cse87 (select (select .cse90 v_arrayElimCell_58) .cse91))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse86) .cse87) .cse88)) 1) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse89) v_arrayElimCell_58) .cse2) 0) (= (select (select .cse90 .cse87) .cse88) 0) (< .cse88 0) (not (= (select |c_#valid| .cse87) 1)))))))))) (and (or (not .cse1) (not (= (select |c_#valid| |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) 1)) (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|)) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) 1) (= (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) 0))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse3 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (or (= (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse3 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse3) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) 1))))) (not .cse0)) (or .cse0 .cse4) (or .cse1 .cse4) (or (let ((.cse5 (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse46 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse41 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse46))) (or (= (select |c_#valid| (select (select .cse41 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) 1) (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse44 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse46 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse45 (+ 4 v_arrayElimCell_59))) (let ((.cse43 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse45)) (.cse42 (select (select .cse44 v_arrayElimCell_58) .cse45))) (or (= (select |c_#valid| (select (select .cse41 .cse42) .cse43)) 1) (= (select (select .cse44 .cse42) .cse43) 0) (< .cse43 0) (not (= (select |c_#valid| .cse42) 1)))))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse51 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse50 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse51))) (or (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse47 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse52 (+ 4 v_arrayElimCell_59))) (let ((.cse49 (select (select .cse47 v_arrayElimCell_58) .cse52)) (.cse48 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse51 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse52))) (or (= (select (select .cse47 .cse48) .cse49) 0) (= (select |c_#valid| (select (select .cse50 .cse48) .cse49)) 1) (< .cse49 0) (not (= (select |c_#valid| .cse48) 1)))))) (= (select |c_#valid| (select (select .cse50 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) 1))))))) (.cse6 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse38 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|))) (let ((.cse34 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse38 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse40 (+ 4 v_arrayElimCell_59)) (.cse39 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse37 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse39)) (.cse36 (select (select .cse34 v_arrayElimCell_58) .cse40)) (.cse35 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse39 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse40))) (or (= (select (select .cse34 .cse35) .cse36) 0) (= (select |c_#valid| (select (select .cse37 .cse35) .cse36)) 1) (= (select |c_#valid| (select (select .cse37 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) 1) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse38) v_arrayElimCell_58) .cse2) 0) (< .cse36 0) (not (= (select |c_#valid| .cse35) 1)))))))) (.cse26 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse33 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse31 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse33 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse30 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) (.cse32 (+ 4 v_arrayElimCell_59))) (let ((.cse27 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse33)) (.cse29 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse30 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse32)) (.cse28 (select (select .cse31 v_arrayElimCell_58) .cse32))) (or (= (select |c_#valid| (select (select .cse27 .cse28) .cse29)) 1) (= (select |c_#valid| (select (select .cse27 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) 1) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse30) v_arrayElimCell_58) .cse2) 0) (= (select (select .cse31 .cse28) .cse29) 0) (< .cse29 0) (not (= (select |c_#valid| .cse28) 1))))))))) (and (or .cse1 .cse5) (or .cse6 .cse0) (or .cse0 .cse5) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse15 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse15))) (or (= (select |c_#valid| (select (select .cse7 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) 1) (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse13 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) (.cse10 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse15 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse11 (select .cse10 v_arrayElimCell_58)) (.cse12 (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse13 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58)) (.cse14 (+ 4 v_arrayElimCell_59))) (let ((.cse9 (select .cse12 .cse14)) (.cse8 (select .cse11 .cse14))) (or (= (select |c_#valid| (select (select .cse7 .cse8) .cse9)) 1) (= (select |c_#valid| (select (select .cse10 (select .cse11 .cse2)) (select .cse12 .cse2))) 1) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse13) v_arrayElimCell_58) .cse2) 0) (= (select (select .cse10 .cse8) .cse9) 0) (< .cse9 0) (not (= (select |c_#valid| .cse8) 1))))))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse25 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse25))) (or (= (select |c_#valid| (select (select .cse16 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) 1) (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse23 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|))) (let ((.cse17 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse23 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse20 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse25 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse21 (select .cse20 v_arrayElimCell_58)) (.cse22 (select .cse17 v_arrayElimCell_58)) (.cse24 (+ 4 v_arrayElimCell_59))) (let ((.cse19 (select .cse22 .cse24)) (.cse18 (select .cse21 .cse24))) (or (= (select (select .cse17 .cse18) .cse19) 0) (= (select |c_#valid| (select (select .cse16 .cse18) .cse19)) 1) (= (select |c_#valid| (select (select .cse20 (select .cse21 .cse2)) (select .cse22 .cse2))) 1) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse23) v_arrayElimCell_58) .cse2) 0) (< .cse19 0) (not (= (select |c_#valid| .cse18) 1)))))))))))) (or .cse1 .cse26) (or .cse6 .cse1) (or .cse0 .cse26))) (and .cse0 .cse1))))) (< |c_ULTIMATE.start_sll_append_~head#1.offset| 0))) is different from true [2024-11-08 17:54:13,166 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~#head~1#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse1 (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#head~1#1.offset|))) (or (let ((.cse8 (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4))) (let ((.cse51 (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse57 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.offset|))) (let ((.cse53 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse56 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse57 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse58 (+ 4 v_arrayElimCell_59))) (let ((.cse55 (select (select .cse56 v_arrayElimCell_58) .cse58)) (.cse54 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse53 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse58))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse53) .cse54) .cse55)) 1) (= (select (select .cse56 .cse54) .cse55) 0) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse57) v_arrayElimCell_58) .cse8) 0) (< .cse55 0) (not (= (select |c_#valid| .cse54) 1))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse59 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse63 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.offset|))) (let ((.cse62 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse63 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse64 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse59 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse65 (select .cse64 v_arrayElimCell_58)) (.cse66 (select .cse62 v_arrayElimCell_58)) (.cse67 (+ 4 v_arrayElimCell_59))) (let ((.cse61 (select .cse66 .cse67)) (.cse60 (select .cse65 .cse67))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse59) .cse60) .cse61)) 1) (= (select (select .cse62 .cse60) .cse61) 0) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse63) v_arrayElimCell_58) .cse8) 0) (< .cse61 0) (not (= (select |c_#valid| .cse60) 1)) (= (select |c_#valid| (select (select .cse64 (select .cse65 .cse8)) (select .cse66 .cse8))) 1))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse68 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.base|))) (let ((.cse71 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.offset|)) (.cse72 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse68 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse73 (select .cse72 v_arrayElimCell_58)) (.cse74 (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse71 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58)) (.cse75 (+ 4 v_arrayElimCell_59))) (let ((.cse70 (select .cse74 .cse75)) (.cse69 (select .cse73 .cse75))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse68) .cse69) .cse70)) 1) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse71) v_arrayElimCell_58) .cse8) 0) (< .cse70 0) (= (select (select .cse72 .cse69) .cse70) 0) (not (= (select |c_#valid| .cse69) 1)) (= (select |c_#valid| (select (select .cse72 (select .cse73 .cse8)) (select .cse74 .cse8))) 1))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse76 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse79 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse80 (+ 4 v_arrayElimCell_59))) (let ((.cse78 (select (select .cse79 v_arrayElimCell_58) .cse80)) (.cse77 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse76 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse80))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse76) .cse77) .cse78)) 1) (= (select (select .cse79 .cse77) .cse78) 0) (< .cse78 0) (not (= (select |c_#valid| .cse77) 1)))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse81 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.base|))) (let ((.cse84 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse81 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse85 (+ 4 v_arrayElimCell_59))) (let ((.cse83 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse85)) (.cse82 (select (select .cse84 v_arrayElimCell_58) .cse85))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse81) .cse82) .cse83)) 1) (< .cse83 0) (= (select (select .cse84 .cse82) .cse83) 0) (not (= (select |c_#valid| .cse82) 1))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse86 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.base|))) (let ((.cse90 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse86 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse89 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.offset|)) (.cse91 (+ 4 v_arrayElimCell_59))) (let ((.cse88 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse89 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse91)) (.cse87 (select (select .cse90 v_arrayElimCell_58) .cse91))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse86) .cse87) .cse88)) 1) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse89) v_arrayElimCell_58) .cse8) 0) (< .cse88 0) (= (select (select .cse90 .cse87) .cse88) 0) (not (= (select |c_#valid| .cse87) 1)))))))))) (and (or (and .cse0 .cse1) (let ((.cse14 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse48 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.offset|))) (let ((.cse47 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse48 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse50 (+ 4 v_arrayElimCell_59)) (.cse49 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.base|))) (let ((.cse44 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse49)) (.cse46 (select (select .cse47 v_arrayElimCell_58) .cse50)) (.cse45 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse49 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse50))) (or (= (select |c_#valid| (select (select .cse44 .cse45) .cse46)) 1) (= (select (select .cse47 .cse45) .cse46) 0) (= (select |c_#valid| (select (select .cse44 |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|)) 1) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse48) v_arrayElimCell_58) .cse8) 0) (< .cse46 0) (not (= (select |c_#valid| .cse45) 1)))))))) (.cse15 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse43 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.base|))) (let ((.cse41 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse43 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse40 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.offset|)) (.cse42 (+ 4 v_arrayElimCell_59))) (let ((.cse37 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse43)) (.cse39 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse40 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse42)) (.cse38 (select (select .cse41 v_arrayElimCell_58) .cse42))) (or (= (select |c_#valid| (select (select .cse37 .cse38) .cse39)) 1) (= (select |c_#valid| (select (select .cse37 |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|)) 1) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse40) v_arrayElimCell_58) .cse8) 0) (< .cse39 0) (= (select (select .cse41 .cse38) .cse39) 0) (not (= (select |c_#valid| .cse38) 1)))))))) (.cse2 (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse30 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.base|))) (let ((.cse25 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse30))) (or (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse28 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse30 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse29 (+ 4 v_arrayElimCell_59))) (let ((.cse27 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse29)) (.cse26 (select (select .cse28 v_arrayElimCell_58) .cse29))) (or (= (select |c_#valid| (select (select .cse25 .cse26) .cse27)) 1) (< .cse27 0) (= (select (select .cse28 .cse26) .cse27) 0) (not (= (select |c_#valid| .cse26) 1)))))) (= (select |c_#valid| (select (select .cse25 |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|)) 1))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse35 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.base|))) (let ((.cse31 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse35))) (or (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse34 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse36 (+ 4 v_arrayElimCell_59))) (let ((.cse33 (select (select .cse34 v_arrayElimCell_58) .cse36)) (.cse32 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse35 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse36))) (or (= (select |c_#valid| (select (select .cse31 .cse32) .cse33)) 1) (= (select (select .cse34 .cse32) .cse33) 0) (< .cse33 0) (not (= (select |c_#valid| .cse32) 1)))))) (= (select |c_#valid| (select (select .cse31 |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|)) 1)))))))) (and (or .cse2 .cse0) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse13 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.base|))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse13))) (or (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse7 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.offset|))) (let ((.cse6 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse7 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse9 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse13 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse10 (select .cse9 v_arrayElimCell_58)) (.cse11 (select .cse6 v_arrayElimCell_58)) (.cse12 (+ 4 v_arrayElimCell_59))) (let ((.cse5 (select .cse11 .cse12)) (.cse4 (select .cse10 .cse12))) (or (= (select |c_#valid| (select (select .cse3 .cse4) .cse5)) 1) (= (select (select .cse6 .cse4) .cse5) 0) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse7) v_arrayElimCell_58) .cse8) 0) (< .cse5 0) (not (= (select |c_#valid| .cse4) 1)) (= (select |c_#valid| (select (select .cse9 (select .cse10 .cse8)) (select .cse11 .cse8))) 1))))))) (= (select |c_#valid| (select (select .cse3 |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|)) 1))))) (or .cse14 .cse1) (or .cse15 .cse0) (or .cse14 .cse0) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse24 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.base|))) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse24))) (or (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse19 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.offset|)) (.cse20 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse24 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse21 (select .cse20 v_arrayElimCell_58)) (.cse22 (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse19 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58)) (.cse23 (+ 4 v_arrayElimCell_59))) (let ((.cse18 (select .cse22 .cse23)) (.cse17 (select .cse21 .cse23))) (or (= (select |c_#valid| (select (select .cse16 .cse17) .cse18)) 1) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse19) v_arrayElimCell_58) .cse8) 0) (< .cse18 0) (= (select (select .cse20 .cse17) .cse18) 0) (not (= (select |c_#valid| .cse17) 1)) (= (select |c_#valid| (select (select .cse20 (select .cse21 .cse8)) (select .cse22 .cse8))) 1)))))) (= (select |c_#valid| (select (select .cse16 |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|)) 1))))) (or .cse15 .cse1) (or .cse2 .cse1)))) (or .cse1 .cse51) (or .cse0 .cse51) (or (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse52 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.base|))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse52) |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|)) 1) (= 0 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse52 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.base|)) |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|)) 1)))) (not .cse1) (not (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1)) (not .cse0))))) (and (<= (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 1) 0) .cse0 .cse1) (< |c_ULTIMATE.start_sll_append_~head#1.offset| 0))) is different from true [2024-11-08 17:54:18,262 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~#head~1#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse1 (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#head~1#1.offset|))) (or (and .cse0 .cse1 (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 1) 0)) (let ((.cse3 (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4))) (let ((.cse4 (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse56 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse60 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse53 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse60 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse57 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse56 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse58 (select .cse57 v_arrayElimCell_58)) (.cse59 (select .cse53 v_arrayElimCell_58)) (.cse61 (+ 4 v_arrayElimCell_59))) (let ((.cse55 (select .cse59 .cse61)) (.cse54 (select .cse58 .cse61))) (or (= (select (select .cse53 .cse54) .cse55) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse56) .cse54) .cse55)) 1) (= (select |c_#valid| (select (select .cse57 (select .cse58 .cse3)) (select .cse59 .cse3))) 1) (< .cse55 0) (not (= (select |c_#valid| .cse54) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse60) v_arrayElimCell_58) .cse3) 0))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse62 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse65 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse62 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse66 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse67 (+ 4 v_arrayElimCell_59))) (let ((.cse64 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse66 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse67)) (.cse63 (select (select .cse65 v_arrayElimCell_58) .cse67))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse62) .cse63) .cse64)) 1) (< .cse64 0) (= (select (select .cse65 .cse63) .cse64) 0) (not (= (select |c_#valid| .cse63) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse66) v_arrayElimCell_58) .cse3) 0)))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse68 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse74 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse71 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse68 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse72 (select .cse71 v_arrayElimCell_58)) (.cse73 (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse74 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58)) (.cse75 (+ 4 v_arrayElimCell_59))) (let ((.cse70 (select .cse73 .cse75)) (.cse69 (select .cse72 .cse75))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse68) .cse69) .cse70)) 1) (= (select |c_#valid| (select (select .cse71 (select .cse72 .cse3)) (select .cse73 .cse3))) 1) (< .cse70 0) (= (select (select .cse71 .cse69) .cse70) 0) (not (= (select |c_#valid| .cse69) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse74) v_arrayElimCell_58) .cse3) 0))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse80 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse79 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse76 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse80 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse81 (+ 4 v_arrayElimCell_59))) (let ((.cse78 (select (select .cse76 v_arrayElimCell_58) .cse81)) (.cse77 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse79 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse81))) (or (= (select (select .cse76 .cse77) .cse78) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse79) .cse77) .cse78)) 1) (< .cse78 0) (not (= (select |c_#valid| .cse77) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse80) v_arrayElimCell_58) .cse3) 0)))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse85 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse82 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse86 (+ 4 v_arrayElimCell_59))) (let ((.cse84 (select (select .cse82 v_arrayElimCell_58) .cse86)) (.cse83 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse85 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse86))) (or (= (select (select .cse82 .cse83) .cse84) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse85) .cse83) .cse84)) 1) (< .cse84 0) (not (= (select |c_#valid| .cse83) 1)))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse87 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse90 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse87 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse91 (+ 4 v_arrayElimCell_59))) (let ((.cse89 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse91)) (.cse88 (select (select .cse90 v_arrayElimCell_58) .cse91))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse87) .cse88) .cse89)) 1) (< .cse89 0) (= (select (select .cse90 .cse88) .cse89) 0) (not (= (select |c_#valid| .cse88) 1)))))))))) (and (or (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse2 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= 0 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse2 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse2) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) 1)))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) 1) (= (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0)))) (not .cse1) (not (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (not .cse0)) (or .cse4 .cse0) (or .cse4 .cse1) (or (let ((.cse5 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse50 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse46 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse50 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse52 (+ 4 v_arrayElimCell_59)) (.cse51 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse49 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse51)) (.cse48 (select (select .cse46 v_arrayElimCell_58) .cse52)) (.cse47 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse51 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse52))) (or (= (select (select .cse46 .cse47) .cse48) 0) (= (select |c_#valid| (select (select .cse49 .cse47) .cse48)) 1) (= (select |c_#valid| (select (select .cse49 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) 1) (< .cse48 0) (not (= (select |c_#valid| .cse47) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse50) v_arrayElimCell_58) .cse3) 0))))))) (.cse15 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse45 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse42 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse45 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse43 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse44 (+ 4 v_arrayElimCell_59))) (let ((.cse39 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse45)) (.cse41 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse43 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse44)) (.cse40 (select (select .cse42 v_arrayElimCell_58) .cse44))) (or (= (select |c_#valid| (select (select .cse39 .cse40) .cse41)) 1) (= (select |c_#valid| (select (select .cse39 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) 1) (< .cse41 0) (= (select (select .cse42 .cse40) .cse41) 0) (not (= (select |c_#valid| .cse40) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse43) v_arrayElimCell_58) .cse3) 0))))))) (.cse26 (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse31 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse27 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse31))) (or (= (select |c_#valid| (select (select .cse27 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) 1) (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse28 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse32 (+ 4 v_arrayElimCell_59))) (let ((.cse30 (select (select .cse28 v_arrayElimCell_58) .cse32)) (.cse29 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse31 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse32))) (or (= (select (select .cse28 .cse29) .cse30) 0) (= (select |c_#valid| (select (select .cse27 .cse29) .cse30)) 1) (< .cse30 0) (not (= (select |c_#valid| .cse29) 1)))))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse38 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse33 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse38))) (or (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse36 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse38 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse37 (+ 4 v_arrayElimCell_59))) (let ((.cse35 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse37)) (.cse34 (select (select .cse36 v_arrayElimCell_58) .cse37))) (or (= (select |c_#valid| (select (select .cse33 .cse34) .cse35)) 1) (< .cse35 0) (= (select (select .cse36 .cse34) .cse35) 0) (not (= (select |c_#valid| .cse34) 1)))))) (= (select |c_#valid| (select (select .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) 1)))))))) (and (or .cse0 .cse5) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse14 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse14))) (or (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse12 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse9 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse14 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse10 (select .cse9 v_arrayElimCell_58)) (.cse11 (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse12 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58)) (.cse13 (+ 4 v_arrayElimCell_59))) (let ((.cse8 (select .cse11 .cse13)) (.cse7 (select .cse10 .cse13))) (or (= (select |c_#valid| (select (select .cse6 .cse7) .cse8)) 1) (= (select |c_#valid| (select (select .cse9 (select .cse10 .cse3)) (select .cse11 .cse3))) 1) (< .cse8 0) (= (select (select .cse9 .cse7) .cse8) 0) (not (= (select |c_#valid| .cse7) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse12) v_arrayElimCell_58) .cse3) 0)))))) (= (select |c_#valid| (select (select .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) 1))))) (or .cse1 .cse5) (or .cse15 .cse1) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse25 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse19 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse25))) (or (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse23 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse16 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse23 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse20 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse25 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse21 (select .cse20 v_arrayElimCell_58)) (.cse22 (select .cse16 v_arrayElimCell_58)) (.cse24 (+ 4 v_arrayElimCell_59))) (let ((.cse18 (select .cse22 .cse24)) (.cse17 (select .cse21 .cse24))) (or (= (select (select .cse16 .cse17) .cse18) 0) (= (select |c_#valid| (select (select .cse19 .cse17) .cse18)) 1) (= (select |c_#valid| (select (select .cse20 (select .cse21 .cse3)) (select .cse22 .cse3))) 1) (< .cse18 0) (not (= (select |c_#valid| .cse17) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse23) v_arrayElimCell_58) .cse3) 0))))))) (= (select |c_#valid| (select (select .cse19 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) 1))))) (or .cse15 .cse0) (or .cse0 .cse26) (or .cse1 .cse26))) (and .cse0 .cse1))))) (< |c_ULTIMATE.start_sll_append_~head#1.offset| 0))) is different from true [2024-11-08 17:54:24,395 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~#head~1#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse2 (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#head~1#1.offset|))) (or (let ((.cse4 (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4))) (let ((.cse0 (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse57 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse54 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse57 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse56 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse58 (+ 4 v_arrayElimCell_59))) (let ((.cse53 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse56 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse58)) (.cse55 (select (select .cse54 v_arrayElimCell_58) .cse58))) (or (not (= (select |c_#valid| .cse53) 1)) (= (select (select .cse54 .cse53) .cse55) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse56) .cse53) .cse55)) 1) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse57) v_arrayElimCell_58) .cse4) 0) (< .cse55 0)))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse66 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (.cse65 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (let ((.cse59 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse65 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse63 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse66 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse61 (select .cse63 v_arrayElimCell_58)) (.cse60 (select .cse59 v_arrayElimCell_58)) (.cse67 (+ 4 v_arrayElimCell_59))) (let ((.cse62 (select .cse60 .cse67)) (.cse64 (select .cse61 .cse67))) (or (= (select |c_#valid| (select (select .cse59 (select .cse60 .cse4)) (select .cse61 .cse4))) 1) (not (= (select |c_#valid| .cse62) 1)) (= (select (select .cse63 .cse62) .cse64) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse65) .cse62) .cse64)) 1) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse66) v_arrayElimCell_58) .cse4) 0) (< .cse64 0))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse69 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse71 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse72 (+ 4 v_arrayElimCell_59))) (let ((.cse68 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse71 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse72)) (.cse70 (select (select .cse69 v_arrayElimCell_58) .cse72))) (or (not (= (select |c_#valid| .cse68) 1)) (= (select (select .cse69 .cse68) .cse70) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse71) .cse68) .cse70)) 1) (< .cse70 0))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse76 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (let ((.cse73 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse76 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse77 (+ 4 v_arrayElimCell_59))) (let ((.cse74 (select (select .cse73 v_arrayElimCell_58) .cse77)) (.cse75 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse77))) (or (= (select (select .cse73 .cse74) .cse75) 0) (not (= (select |c_#valid| .cse74) 1)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse76) .cse74) .cse75)) 1) (< .cse75 0)))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse83 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (let ((.cse78 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse83 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse84 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse82 (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse84 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58)) (.cse81 (select .cse78 v_arrayElimCell_58)) (.cse85 (+ 4 v_arrayElimCell_59))) (let ((.cse79 (select .cse81 .cse85)) (.cse80 (select .cse82 .cse85))) (or (= (select (select .cse78 .cse79) .cse80) 0) (= (select |c_#valid| (select (select .cse78 (select .cse81 .cse4)) (select .cse82 .cse4))) 1) (not (= (select |c_#valid| .cse79) 1)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse83) .cse79) .cse80)) 1) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse84) v_arrayElimCell_58) .cse4) 0) (< .cse80 0))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse89 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (let ((.cse90 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (.cse86 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse89 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse91 (+ 4 v_arrayElimCell_59))) (let ((.cse87 (select (select .cse86 v_arrayElimCell_58) .cse91)) (.cse88 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse90 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse91))) (or (= (select (select .cse86 .cse87) .cse88) 0) (not (= (select |c_#valid| .cse87) 1)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse89) .cse87) .cse88)) 1) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse90) v_arrayElimCell_58) .cse4) 0) (< .cse88 0))))))))) (and (or .cse0 .cse1) (or (not .cse2) (not (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)) (not .cse1) (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse3 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse3) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 1) (= (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse3 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 1) (= (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|) 0))))) (or (let ((.cse7 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse50 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse47 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse50 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse51 (+ 4 v_arrayElimCell_59)) (.cse52 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (let ((.cse49 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse52)) (.cse46 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse52 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse51)) (.cse48 (select (select .cse47 v_arrayElimCell_58) .cse51))) (or (not (= (select |c_#valid| .cse46) 1)) (= (select (select .cse47 .cse46) .cse48) 0) (= (select |c_#valid| (select (select .cse49 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 1) (= (select |c_#valid| (select (select .cse49 .cse46) .cse48)) 1) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse50) v_arrayElimCell_58) .cse4) 0) (< .cse48 0))))))) (.cse5 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse45 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (let ((.cse43 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (.cse39 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse45 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse44 (+ 4 v_arrayElimCell_59))) (let ((.cse42 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse45)) (.cse40 (select (select .cse39 v_arrayElimCell_58) .cse44)) (.cse41 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse43 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse44))) (or (= (select (select .cse39 .cse40) .cse41) 0) (not (= (select |c_#valid| .cse40) 1)) (= (select |c_#valid| (select (select .cse42 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 1) (= (select |c_#valid| (select (select .cse42 .cse40) .cse41)) 1) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse43) v_arrayElimCell_58) .cse4) 0) (< .cse41 0))))))) (.cse6 (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse32 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (let ((.cse27 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse32))) (or (= (select |c_#valid| (select (select .cse27 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 1) (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse29 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse31 (+ 4 v_arrayElimCell_59))) (let ((.cse28 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse32 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse31)) (.cse30 (select (select .cse29 v_arrayElimCell_58) .cse31))) (or (not (= (select |c_#valid| .cse28) 1)) (= (select (select .cse29 .cse28) .cse30) 0) (= (select |c_#valid| (select (select .cse27 .cse28) .cse30)) 1) (< .cse30 0))))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse38 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (let ((.cse33 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse38))) (or (= (select |c_#valid| (select (select .cse33 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 1) (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse34 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse38 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse37 (+ 4 v_arrayElimCell_59))) (let ((.cse35 (select (select .cse34 v_arrayElimCell_58) .cse37)) (.cse36 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58) .cse37))) (or (= (select (select .cse34 .cse35) .cse36) 0) (not (= (select |c_#valid| .cse35) 1)) (= (select |c_#valid| (select (select .cse33 .cse35) .cse36)) 1) (< .cse36 0)))))))))))) (and (or .cse5 .cse1) (or .cse6 .cse1) (or .cse7 .cse2) (or .cse7 .cse1) (or .cse5 .cse2) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse17 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse17))) (or (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse15 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse17 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse12 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse15 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse10 (select .cse12 v_arrayElimCell_58)) (.cse9 (select .cse8 v_arrayElimCell_58)) (.cse16 (+ 4 v_arrayElimCell_59))) (let ((.cse11 (select .cse9 .cse16)) (.cse13 (select .cse10 .cse16))) (or (= (select |c_#valid| (select (select .cse8 (select .cse9 .cse4)) (select .cse10 .cse4))) 1) (not (= (select |c_#valid| .cse11) 1)) (= (select (select .cse12 .cse11) .cse13) 0) (= (select |c_#valid| (select (select .cse14 .cse11) .cse13)) 1) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse15) v_arrayElimCell_58) .cse4) 0) (< .cse13 0))))))) (= (select |c_#valid| (select (select .cse14 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 1))))) (or .cse6 .cse2) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse26 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (let ((.cse18 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse26))) (or (= (select |c_#valid| (select (select .cse18 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 1) (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse19 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse26 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse24 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse23 (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse24 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_58)) (.cse22 (select .cse19 v_arrayElimCell_58)) (.cse25 (+ 4 v_arrayElimCell_59))) (let ((.cse20 (select .cse22 .cse25)) (.cse21 (select .cse23 .cse25))) (or (= (select (select .cse19 .cse20) .cse21) 0) (= (select |c_#valid| (select (select .cse19 (select .cse22 .cse4)) (select .cse23 .cse4))) 1) (not (= (select |c_#valid| .cse20) 1)) (= (select |c_#valid| (select (select .cse18 .cse20) .cse21)) 1) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse24) v_arrayElimCell_58) .cse4) 0) (< .cse21 0)))))))))))) (and .cse1 .cse2)) (or .cse0 .cse2)))) (and (<= (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 1) 0) .cse1 .cse2) (< |c_ULTIMATE.start_sll_append_~head#1.offset| 0))) is different from true