./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 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/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_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd --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.3.0-dev-826ab2b [2024-11-13 14:20:45,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:20:46,018 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 14:20:46,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:20:46,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:20:46,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:20:46,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:20:46,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:20:46,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:20:46,072 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:20:46,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:20:46,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:20:46,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:20:46,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:20:46,075 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:20:46,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:20:46,076 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:20:46,076 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:20:46,076 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:20:46,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:20:46,076 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 14:20:46,077 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 14:20:46,077 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 14:20:46,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:20:46,077 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:20:46,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:20:46,077 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 14:20:46,078 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:20:46,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:20:46,078 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:20:46,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:20:46,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:20:46,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:20:46,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:20:46,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:20:46,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:20:46,081 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:20:46,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:20:46,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:20:46,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:20:46,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:20:46,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:20:46,081 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd 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-13 14:20:46,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:20:46,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:20:46,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:20:46,475 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:20:46,476 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:20:46,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i Unable to find full path for "g++" [2024-11-13 14:20:48,771 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:20:49,129 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:20:49,131 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2024-11-13 14:20:49,147 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/data/7997120eb/daa5bbc1125a4d8186b99a1d51d08b11/FLAGeae279e30 [2024-11-13 14:20:49,164 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/data/7997120eb/daa5bbc1125a4d8186b99a1d51d08b11 [2024-11-13 14:20:49,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:20:49,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:20:49,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:20:49,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:20:49,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:20:49,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:20:49" (1/1) ... [2024-11-13 14:20:49,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dfe2769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:49, skipping insertion in model container [2024-11-13 14:20:49,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:20:49" (1/1) ... [2024-11-13 14:20:49,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:20:49,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:20:49,607 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:20:49,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:20:49,746 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:20:49,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:49 WrapperNode [2024-11-13 14:20:49,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:20:49,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:20:49,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:20:49,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:20:49,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:49" (1/1) ... [2024-11-13 14:20:49,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:49" (1/1) ... [2024-11-13 14:20:49,823 INFO L138 Inliner]: procedures = 129, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-11-13 14:20:49,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:20:49,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:20:49,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:20:49,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:20:49,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:49" (1/1) ... [2024-11-13 14:20:49,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:49" (1/1) ... [2024-11-13 14:20:49,854 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:49" (1/1) ... [2024-11-13 14:20:49,882 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-13 14:20:49,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:49" (1/1) ... [2024-11-13 14:20:49,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:49" (1/1) ... [2024-11-13 14:20:49,896 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:49" (1/1) ... [2024-11-13 14:20:49,901 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:49" (1/1) ... [2024-11-13 14:20:49,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:49" (1/1) ... [2024-11-13 14:20:49,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:49" (1/1) ... [2024-11-13 14:20:49,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:20:49,910 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:20:49,910 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:20:49,910 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:20:49,911 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:49" (1/1) ... [2024-11-13 14:20:49,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:20:49,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:20:49,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:20:49,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:20:50,005 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-13 14:20:50,005 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-13 14:20:50,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 14:20:50,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:20:50,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 14:20:50,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 14:20:50,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 14:20:50,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 14:20:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 14:20:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 14:20:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 14:20:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 14:20:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 14:20:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 14:20:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 14:20:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:20:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 14:20:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 14:20:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:20:50,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:20:50,267 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:20:50,269 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:20:50,307 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-13 14:20:50,962 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2024-11-13 14:20:50,962 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:20:50,985 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:20:50,985 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-13 14:20:50,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:20:50 BoogieIcfgContainer [2024-11-13 14:20:50,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:20:50,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:20:50,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:20:51,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:20:51,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:20:49" (1/3) ... [2024-11-13 14:20:51,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798b2405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:20:51, skipping insertion in model container [2024-11-13 14:20:51,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:20:49" (2/3) ... [2024-11-13 14:20:51,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798b2405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:20:51, skipping insertion in model container [2024-11-13 14:20:51,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:20:50" (3/3) ... [2024-11-13 14:20:51,004 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-1.i [2024-11-13 14:20:51,025 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:20:51,028 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_of_sll_nondet_append-1.i that has 2 procedures, 121 locations, 1 initial locations, 9 loop locations, and 42 error locations. [2024-11-13 14:20:51,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:20:51,118 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;@3b98fa8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:20:51,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2024-11-13 14:20:51,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 75 states have (on average 1.92) internal successors, (144), 118 states have internal predecessors, (144), 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-13 14:20:51,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 14:20:51,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:51,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 14:20:51,135 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-13 14:20:51,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:51,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1082950, now seen corresponding path program 1 times [2024-11-13 14:20:51,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:51,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489885966] [2024-11-13 14:20:51,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:51,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:51,349 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-13 14:20:51,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:51,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489885966] [2024-11-13 14:20:51,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489885966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:51,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:51,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:20:51,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858914391] [2024-11-13 14:20:51,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:51,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:20:51,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:51,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:20:51,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:20:51,400 INFO L87 Difference]: Start difference. First operand has 120 states, 75 states have (on average 1.92) internal successors, (144), 118 states have internal predecessors, (144), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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-13 14:20:51,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:51,428 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2024-11-13 14:20:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:20:51,430 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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-13 14:20:51,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:51,439 INFO L225 Difference]: With dead ends: 119 [2024-11-13 14:20:51,440 INFO L226 Difference]: Without dead ends: 113 [2024-11-13 14:20:51,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:20:51,447 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:51,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:20:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-13 14:20:51,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-13 14:20:51,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 71 states have (on average 1.7746478873239437) internal successors, (126), 112 states have internal predecessors, (126), 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-13 14:20:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2024-11-13 14:20:51,504 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 4 [2024-11-13 14:20:51,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:51,505 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2024-11-13 14:20:51,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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-13 14:20:51,506 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2024-11-13 14:20:51,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 14:20:51,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:51,507 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 14:20:51,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:20:51,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-13 14:20:51,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:51,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1079726, now seen corresponding path program 1 times [2024-11-13 14:20:51,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:51,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769132993] [2024-11-13 14:20:51,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:51,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:51,685 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-13 14:20:51,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:51,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769132993] [2024-11-13 14:20:51,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769132993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:51,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:51,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:20:51,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472309192] [2024-11-13 14:20:51,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:51,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:20:51,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:51,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:20:51,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:20:51,688 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. 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-13 14:20:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:51,906 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2024-11-13 14:20:51,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:20:51,907 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-13 14:20:51,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:51,908 INFO L225 Difference]: With dead ends: 138 [2024-11-13 14:20:51,908 INFO L226 Difference]: Without dead ends: 138 [2024-11-13 14:20:51,909 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-13 14:20:51,910 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 113 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:51,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 101 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:20:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-13 14:20:51,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 111. [2024-11-13 14:20:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 71 states have (on average 1.7464788732394365) internal successors, (124), 110 states have internal predecessors, (124), 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-13 14:20:51,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2024-11-13 14:20:51,921 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 4 [2024-11-13 14:20:51,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:51,921 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2024-11-13 14:20:51,921 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-13 14:20:51,922 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2024-11-13 14:20:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 14:20:51,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:51,922 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 14:20:51,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:20:51,923 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-13 14:20:51,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:51,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1079727, now seen corresponding path program 1 times [2024-11-13 14:20:51,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:51,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867779531] [2024-11-13 14:20:51,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:51,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:52,047 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-13 14:20:52,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:52,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867779531] [2024-11-13 14:20:52,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867779531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:52,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:52,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:20:52,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366192161] [2024-11-13 14:20:52,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:52,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:20:52,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:52,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:20:52,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:20:52,052 INFO L87 Difference]: Start difference. First operand 111 states and 124 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-13 14:20:52,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:52,124 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2024-11-13 14:20:52,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:20:52,127 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-13 14:20:52,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:52,129 INFO L225 Difference]: With dead ends: 158 [2024-11-13 14:20:52,129 INFO L226 Difference]: Without dead ends: 158 [2024-11-13 14:20:52,129 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-13 14:20:52,130 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 51 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:52,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 230 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:20:52,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-13 14:20:52,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2024-11-13 14:20:52,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.7361111111111112) internal successors, (125), 111 states have internal predecessors, (125), 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-13 14:20:52,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2024-11-13 14:20:52,148 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 4 [2024-11-13 14:20:52,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:52,148 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2024-11-13 14:20:52,149 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-13 14:20:52,149 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2024-11-13 14:20:52,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 14:20:52,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:52,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:52,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:20:52,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-13 14:20:52,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:52,150 INFO L85 PathProgramCache]: Analyzing trace with hash -336210926, now seen corresponding path program 1 times [2024-11-13 14:20:52,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:52,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138171005] [2024-11-13 14:20:52,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:52,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:52,294 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-13 14:20:52,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:52,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138171005] [2024-11-13 14:20:52,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138171005] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:20:52,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583360801] [2024-11-13 14:20:52,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:52,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:20:52,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:20:52,298 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:20:52,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:20:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:52,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:20:52,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:20:52,536 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-13 14:20:52,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:20:52,600 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-13 14:20:52,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583360801] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:20:52,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:20:52,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-13 14:20:52,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861175999] [2024-11-13 14:20:52,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:20:52,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:20:52,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:52,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:20:52,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:20:52,608 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-13 14:20:52,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:52,761 INFO L93 Difference]: Finished difference Result 242 states and 267 transitions. [2024-11-13 14:20:52,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:20:52,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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 9 [2024-11-13 14:20:52,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:52,765 INFO L225 Difference]: With dead ends: 242 [2024-11-13 14:20:52,765 INFO L226 Difference]: Without dead ends: 242 [2024-11-13 14:20:52,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:20:52,770 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 301 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:52,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 581 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:20:52,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-13 14:20:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 173. [2024-11-13 14:20:52,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 133 states have (on average 1.7518796992481203) internal successors, (233), 172 states have internal predecessors, (233), 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-13 14:20:52,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 233 transitions. [2024-11-13 14:20:52,795 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 233 transitions. Word has length 9 [2024-11-13 14:20:52,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:52,795 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 233 transitions. [2024-11-13 14:20:52,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-13 14:20:52,796 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 233 transitions. [2024-11-13 14:20:52,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 14:20:52,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:52,800 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:52,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:20:53,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:20:53,001 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-13 14:20:53,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:53,002 INFO L85 PathProgramCache]: Analyzing trace with hash -991178176, now seen corresponding path program 1 times [2024-11-13 14:20:53,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:53,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194024867] [2024-11-13 14:20:53,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:53,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:53,179 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-13 14:20:53,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:53,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194024867] [2024-11-13 14:20:53,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194024867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:53,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:53,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:20:53,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549934925] [2024-11-13 14:20:53,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:53,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:20:53,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:53,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:20:53,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:20:53,181 INFO L87 Difference]: Start difference. First operand 173 states and 233 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:53,302 INFO L93 Difference]: Finished difference Result 172 states and 230 transitions. [2024-11-13 14:20:53,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:20:53,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-13 14:20:53,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:53,304 INFO L225 Difference]: With dead ends: 172 [2024-11-13 14:20:53,304 INFO L226 Difference]: Without dead ends: 172 [2024-11-13 14:20:53,304 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-13 14:20:53,305 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 196 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-13 14:20:53,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 196 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:20:53,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-13 14:20:53,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2024-11-13 14:20:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 133 states have (on average 1.7293233082706767) internal successors, (230), 171 states have internal predecessors, (230), 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-13 14:20:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 230 transitions. [2024-11-13 14:20:53,321 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 230 transitions. Word has length 11 [2024-11-13 14:20:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:53,322 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 230 transitions. [2024-11-13 14:20:53,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:53,322 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 230 transitions. [2024-11-13 14:20:53,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 14:20:53,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:53,323 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:53,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:20:53,324 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-13 14:20:53,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:53,324 INFO L85 PathProgramCache]: Analyzing trace with hash -991178175, now seen corresponding path program 1 times [2024-11-13 14:20:53,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:53,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122771644] [2024-11-13 14:20:53,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:53,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:53,488 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-13 14:20:53,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:53,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122771644] [2024-11-13 14:20:53,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122771644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:53,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:53,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:20:53,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138410569] [2024-11-13 14:20:53,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:53,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:20:53,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:53,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:20:53,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:20:53,490 INFO L87 Difference]: Start difference. First operand 172 states and 230 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:53,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:53,585 INFO L93 Difference]: Finished difference Result 171 states and 227 transitions. [2024-11-13 14:20:53,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:20:53,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-13 14:20:53,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:53,587 INFO L225 Difference]: With dead ends: 171 [2024-11-13 14:20:53,587 INFO L226 Difference]: Without dead ends: 171 [2024-11-13 14:20:53,587 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-13 14:20:53,588 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 1 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 200 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-13 14:20:53,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 200 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:20:53,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-13 14:20:53,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-13 14:20:53,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.7067669172932332) internal successors, (227), 170 states have internal predecessors, (227), 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-13 14:20:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 227 transitions. [2024-11-13 14:20:53,603 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 227 transitions. Word has length 11 [2024-11-13 14:20:53,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:53,604 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 227 transitions. [2024-11-13 14:20:53,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:53,604 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2024-11-13 14:20:53,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 14:20:53,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:53,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:53,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:20:53,605 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-13 14:20:53,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:53,606 INFO L85 PathProgramCache]: Analyzing trace with hash -661803004, now seen corresponding path program 1 times [2024-11-13 14:20:53,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:53,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030643774] [2024-11-13 14:20:53,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:53,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:53,680 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-13 14:20:53,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:53,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030643774] [2024-11-13 14:20:53,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030643774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:53,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:53,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:20:53,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82246081] [2024-11-13 14:20:53,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:53,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:20:53,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:53,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:20:53,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:20:53,683 INFO L87 Difference]: Start difference. First operand 171 states and 227 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:53,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:53,794 INFO L93 Difference]: Finished difference Result 169 states and 221 transitions. [2024-11-13 14:20:53,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:20:53,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-13 14:20:53,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:53,796 INFO L225 Difference]: With dead ends: 169 [2024-11-13 14:20:53,796 INFO L226 Difference]: Without dead ends: 169 [2024-11-13 14:20:53,796 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-13 14:20:53,797 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 6 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 181 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-13 14:20:53,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 181 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:20:53,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-13 14:20:53,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-11-13 14:20:53,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 168 states have internal predecessors, (221), 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-13 14:20:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 221 transitions. [2024-11-13 14:20:53,803 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 221 transitions. Word has length 12 [2024-11-13 14:20:53,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:53,804 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 221 transitions. [2024-11-13 14:20:53,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:53,804 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 221 transitions. [2024-11-13 14:20:53,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 14:20:53,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:53,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:53,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:20:53,805 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-13 14:20:53,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:53,805 INFO L85 PathProgramCache]: Analyzing trace with hash -661803003, now seen corresponding path program 1 times [2024-11-13 14:20:53,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:53,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134109734] [2024-11-13 14:20:53,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:53,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:53,911 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-13 14:20:53,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:53,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134109734] [2024-11-13 14:20:53,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134109734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:53,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:53,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:20:53,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875533151] [2024-11-13 14:20:53,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:53,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:20:53,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:53,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:20:53,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:20:53,913 INFO L87 Difference]: Start difference. First operand 169 states and 221 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:54,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:54,034 INFO L93 Difference]: Finished difference Result 239 states and 300 transitions. [2024-11-13 14:20:54,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:20:54,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-13 14:20:54,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:54,037 INFO L225 Difference]: With dead ends: 239 [2024-11-13 14:20:54,038 INFO L226 Difference]: Without dead ends: 239 [2024-11-13 14:20:54,038 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-13 14:20:54,039 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 110 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:54,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 557 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:20:54,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-13 14:20:54,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 172. [2024-11-13 14:20:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.6470588235294117) internal successors, (224), 171 states have internal predecessors, (224), 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-13 14:20:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 224 transitions. [2024-11-13 14:20:54,047 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 224 transitions. Word has length 12 [2024-11-13 14:20:54,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:54,047 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 224 transitions. [2024-11-13 14:20:54,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:54,048 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 224 transitions. [2024-11-13 14:20:54,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 14:20:54,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:54,048 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:54,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:20:54,049 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-13 14:20:54,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:54,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1583408654, now seen corresponding path program 1 times [2024-11-13 14:20:54,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:54,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442254282] [2024-11-13 14:20:54,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:54,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:54,270 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-13 14:20:54,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:54,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442254282] [2024-11-13 14:20:54,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442254282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:20:54,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180450211] [2024-11-13 14:20:54,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:54,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:20:54,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:20:54,274 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:20:54,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:20:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:54,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 14:20:54,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:20:54,482 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-13 14:20:54,484 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:20:54,589 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-13 14:20:54,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180450211] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:20:54,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:20:54,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-13 14:20:54,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239829696] [2024-11-13 14:20:54,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:20:54,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:20:54,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:54,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:20:54,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:20:54,594 INFO L87 Difference]: Start difference. First operand 172 states and 224 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:54,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:54,784 INFO L93 Difference]: Finished difference Result 254 states and 315 transitions. [2024-11-13 14:20:54,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:20:54,785 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 14:20:54,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:54,786 INFO L225 Difference]: With dead ends: 254 [2024-11-13 14:20:54,787 INFO L226 Difference]: Without dead ends: 254 [2024-11-13 14:20:54,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 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-13 14:20:54,788 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 115 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:54,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 782 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:20:54,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-13 14:20:54,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 196. [2024-11-13 14:20:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 160 states have (on average 1.55) internal successors, (248), 195 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-13 14:20:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 248 transitions. [2024-11-13 14:20:54,796 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 248 transitions. Word has length 16 [2024-11-13 14:20:54,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:54,797 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 248 transitions. [2024-11-13 14:20:54,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:54,797 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 248 transitions. [2024-11-13 14:20:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 14:20:54,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:54,798 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1] [2024-11-13 14:20:54,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 14:20:55,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:20:55,002 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-13 14:20:55,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:55,003 INFO L85 PathProgramCache]: Analyzing trace with hash -248088014, now seen corresponding path program 2 times [2024-11-13 14:20:55,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:55,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831396494] [2024-11-13 14:20:55,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:55,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:55,195 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-13 14:20:55,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:55,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831396494] [2024-11-13 14:20:55,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831396494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:55,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:55,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:20:55,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294032123] [2024-11-13 14:20:55,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:55,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:20:55,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:55,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:20:55,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:20:55,199 INFO L87 Difference]: Start difference. First operand 196 states and 248 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:55,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:55,310 INFO L93 Difference]: Finished difference Result 194 states and 246 transitions. [2024-11-13 14:20:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:20:55,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-13 14:20:55,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:55,312 INFO L225 Difference]: With dead ends: 194 [2024-11-13 14:20:55,312 INFO L226 Difference]: Without dead ends: 194 [2024-11-13 14:20:55,312 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-13 14:20:55,313 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 76 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:55,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 115 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:20:55,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-13 14:20:55,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-11-13 14:20:55,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 160 states have (on average 1.5375) internal successors, (246), 193 states have internal predecessors, (246), 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-13 14:20:55,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 246 transitions. [2024-11-13 14:20:55,327 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 246 transitions. Word has length 19 [2024-11-13 14:20:55,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:55,327 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 246 transitions. [2024-11-13 14:20:55,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:55,328 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 246 transitions. [2024-11-13 14:20:55,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 14:20:55,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:55,329 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:55,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 14:20:55,329 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-13 14:20:55,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash -391988175, now seen corresponding path program 1 times [2024-11-13 14:20:55,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:55,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303558066] [2024-11-13 14:20:55,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:55,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:55,499 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-13 14:20:55,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:55,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303558066] [2024-11-13 14:20:55,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303558066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:55,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:55,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:20:55,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007472180] [2024-11-13 14:20:55,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:55,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:20:55,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:55,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:20:55,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:20:55,501 INFO L87 Difference]: Start difference. First operand 194 states and 246 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-13 14:20:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:55,628 INFO L93 Difference]: Finished difference Result 328 states and 424 transitions. [2024-11-13 14:20:55,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:20:55,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 24 [2024-11-13 14:20:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:55,631 INFO L225 Difference]: With dead ends: 328 [2024-11-13 14:20:55,631 INFO L226 Difference]: Without dead ends: 328 [2024-11-13 14:20:55,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:20:55,636 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 46 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:55,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 435 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:20:55,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-13 14:20:55,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 309. [2024-11-13 14:20:55,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 275 states have (on average 1.5018181818181817) internal successors, (413), 308 states have internal predecessors, (413), 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-13 14:20:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 413 transitions. [2024-11-13 14:20:55,653 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 413 transitions. Word has length 24 [2024-11-13 14:20:55,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:55,653 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 413 transitions. [2024-11-13 14:20:55,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-13 14:20:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 413 transitions. [2024-11-13 14:20:55,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 14:20:55,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:55,656 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:55,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 14:20:55,656 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-13 14:20:55,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:55,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1691159712, now seen corresponding path program 2 times [2024-11-13 14:20:55,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:55,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031008429] [2024-11-13 14:20:55,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:55,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:56,199 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 14:20:56,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:56,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031008429] [2024-11-13 14:20:56,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031008429] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:20:56,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723723366] [2024-11-13 14:20:56,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:20:56,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:20:56,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:20:56,204 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:20:56,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:20:56,376 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:20:56,376 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:20:56,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 14:20:56,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:20:56,429 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-13 14:20:56,446 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-13 14:20:56,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:20:56,521 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-13 14:20:56,574 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 14:20:56,574 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-13 14:20:56,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:20:56,676 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-13 14:20:56,698 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:20:56,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 14:20:56,801 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 14:20:56,802 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-13 14:20:56,908 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 14:20:56,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:20:57,849 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 14:20:57,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723723366] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:20:57,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:20:57,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 9 [2024-11-13 14:20:57,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084452784] [2024-11-13 14:20:57,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:20:57,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:20:57,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:57,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:20:57,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:20:57,851 INFO L87 Difference]: Start difference. First operand 309 states and 413 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 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-13 14:20:58,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:58,112 INFO L93 Difference]: Finished difference Result 307 states and 401 transitions. [2024-11-13 14:20:58,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:20:58,113 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 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 24 [2024-11-13 14:20:58,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:58,115 INFO L225 Difference]: With dead ends: 307 [2024-11-13 14:20:58,115 INFO L226 Difference]: Without dead ends: 307 [2024-11-13 14:20:58,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:20:58,116 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 12 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:58,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 312 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:20:58,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-13 14:20:58,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-11-13 14:20:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 275 states have (on average 1.4581818181818182) internal successors, (401), 306 states have internal predecessors, (401), 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-13 14:20:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 401 transitions. [2024-11-13 14:20:58,127 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 401 transitions. Word has length 24 [2024-11-13 14:20:58,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:58,127 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 401 transitions. [2024-11-13 14:20:58,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 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-13 14:20:58,128 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 401 transitions. [2024-11-13 14:20:58,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 14:20:58,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:58,129 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:58,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 14:20:58,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:20:58,330 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-13 14:20:58,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:58,330 INFO L85 PathProgramCache]: Analyzing trace with hash 733233052, now seen corresponding path program 1 times [2024-11-13 14:20:58,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:58,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986670611] [2024-11-13 14:20:58,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:58,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:58,538 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-13 14:20:58,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:58,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986670611] [2024-11-13 14:20:58,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986670611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:58,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:58,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:20:58,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899131918] [2024-11-13 14:20:58,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:58,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:20:58,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:58,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:20:58,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:20:58,540 INFO L87 Difference]: Start difference. First operand 307 states and 401 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:58,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:58,618 INFO L93 Difference]: Finished difference Result 326 states and 414 transitions. [2024-11-13 14:20:58,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:20:58,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-13 14:20:58,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:58,621 INFO L225 Difference]: With dead ends: 326 [2024-11-13 14:20:58,621 INFO L226 Difference]: Without dead ends: 326 [2024-11-13 14:20:58,622 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-13 14:20:58,622 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 40 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:58,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 421 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:20:58,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-13 14:20:58,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 311. [2024-11-13 14:20:58,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 279 states have (on average 1.4516129032258065) internal successors, (405), 310 states have internal predecessors, (405), 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-13 14:20:58,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 405 transitions. [2024-11-13 14:20:58,634 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 405 transitions. Word has length 25 [2024-11-13 14:20:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:58,634 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 405 transitions. [2024-11-13 14:20:58,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:20:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 405 transitions. [2024-11-13 14:20:58,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 14:20:58,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:58,636 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:58,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 14:20:58,636 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-13 14:20:58,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:58,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1255387583, now seen corresponding path program 1 times [2024-11-13 14:20:58,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:58,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925414212] [2024-11-13 14:20:58,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:58,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:58,768 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-13 14:20:58,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:58,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925414212] [2024-11-13 14:20:58,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925414212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:58,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:58,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:20:58,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916758048] [2024-11-13 14:20:58,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:58,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:20:58,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:58,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:20:58,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:20:58,771 INFO L87 Difference]: Start difference. First operand 311 states and 405 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-13 14:20:58,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:58,899 INFO L93 Difference]: Finished difference Result 334 states and 434 transitions. [2024-11-13 14:20:58,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:20:58,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 26 [2024-11-13 14:20:58,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:58,901 INFO L225 Difference]: With dead ends: 334 [2024-11-13 14:20:58,901 INFO L226 Difference]: Without dead ends: 326 [2024-11-13 14:20:58,902 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-13 14:20:58,903 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:58,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 266 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:20:58,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-13 14:20:58,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2024-11-13 14:20:58,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 292 states have (on average 1.452054794520548) internal successors, (424), 323 states have internal predecessors, (424), 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-13 14:20:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 424 transitions. [2024-11-13 14:20:58,914 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 424 transitions. Word has length 26 [2024-11-13 14:20:58,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:58,915 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 424 transitions. [2024-11-13 14:20:58,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-13 14:20:58,915 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 424 transitions. [2024-11-13 14:20:58,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 14:20:58,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:58,916 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:58,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 14:20:58,917 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-13 14:20:58,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:58,917 INFO L85 PathProgramCache]: Analyzing trace with hash 518539722, now seen corresponding path program 1 times [2024-11-13 14:20:58,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:58,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731262632] [2024-11-13 14:20:58,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:58,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:59,045 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 14:20:59,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:59,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731262632] [2024-11-13 14:20:59,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731262632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:59,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:59,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:20:59,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242142453] [2024-11-13 14:20:59,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:59,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:20:59,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:59,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:20:59,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:20:59,049 INFO L87 Difference]: Start difference. First operand 324 states and 424 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-13 14:20:59,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:59,205 INFO L93 Difference]: Finished difference Result 323 states and 418 transitions. [2024-11-13 14:20:59,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:20:59,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-13 14:20:59,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:59,207 INFO L225 Difference]: With dead ends: 323 [2024-11-13 14:20:59,207 INFO L226 Difference]: Without dead ends: 323 [2024-11-13 14:20:59,208 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-13 14:20:59,208 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 28 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 296 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-13 14:20:59,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 296 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:20:59,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-13 14:20:59,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2024-11-13 14:20:59,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 292 states have (on average 1.4315068493150684) internal successors, (418), 322 states have internal predecessors, (418), 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-13 14:20:59,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 418 transitions. [2024-11-13 14:20:59,226 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 418 transitions. Word has length 29 [2024-11-13 14:20:59,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:59,226 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 418 transitions. [2024-11-13 14:20:59,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-13 14:20:59,227 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 418 transitions. [2024-11-13 14:20:59,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 14:20:59,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:59,230 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:59,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 14:20:59,230 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-13 14:20:59,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:59,231 INFO L85 PathProgramCache]: Analyzing trace with hash 518539723, now seen corresponding path program 1 times [2024-11-13 14:20:59,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:59,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673751519] [2024-11-13 14:20:59,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:59,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:59,472 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 14:20:59,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:59,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673751519] [2024-11-13 14:20:59,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673751519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:59,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:59,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:20:59,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571095864] [2024-11-13 14:20:59,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:59,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:20:59,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:59,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:20:59,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:20:59,473 INFO L87 Difference]: Start difference. First operand 323 states and 418 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-13 14:20:59,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:59,634 INFO L93 Difference]: Finished difference Result 322 states and 412 transitions. [2024-11-13 14:20:59,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:20:59,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-13 14:20:59,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:59,637 INFO L225 Difference]: With dead ends: 322 [2024-11-13 14:20:59,638 INFO L226 Difference]: Without dead ends: 322 [2024-11-13 14:20:59,638 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-13 14:20:59,639 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 28 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:59,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 402 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:20:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-13 14:20:59,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2024-11-13 14:20:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 292 states have (on average 1.4109589041095891) internal successors, (412), 321 states have internal predecessors, (412), 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-13 14:20:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 412 transitions. [2024-11-13 14:20:59,652 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 412 transitions. Word has length 29 [2024-11-13 14:20:59,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:59,652 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 412 transitions. [2024-11-13 14:20:59,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-13 14:20:59,652 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 412 transitions. [2024-11-13 14:20:59,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 14:20:59,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:59,654 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:59,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 14:20:59,655 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-13 14:20:59,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:59,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1105137755, now seen corresponding path program 1 times [2024-11-13 14:20:59,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:59,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624381071] [2024-11-13 14:20:59,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:59,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 14:21:00,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:21:00,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624381071] [2024-11-13 14:21:00,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624381071] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:21:00,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9032735] [2024-11-13 14:21:00,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:00,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:21:00,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:21:00,223 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:21:00,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:21:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:00,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 14:21:00,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:21:00,444 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-13 14:21:00,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:21:00,490 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-13 14:21:00,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:21:00,543 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-13 14:21:00,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:21:00,615 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-13 14:21:00,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:21:00,654 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-13 14:21:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 14:21:00,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:21:01,730 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 14:21:01,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9032735] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:21:01,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:21:01,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-13 14:21:01,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000814139] [2024-11-13 14:21:01,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:21:01,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:21:01,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:21:01,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:21:01,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:21:01,734 INFO L87 Difference]: Start difference. First operand 322 states and 412 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 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-13 14:21:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:21:01,961 INFO L93 Difference]: Finished difference Result 350 states and 435 transitions. [2024-11-13 14:21:01,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:21:01,962 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 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 30 [2024-11-13 14:21:01,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:21:01,964 INFO L225 Difference]: With dead ends: 350 [2024-11-13 14:21:01,964 INFO L226 Difference]: Without dead ends: 350 [2024-11-13 14:21:01,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:21:01,965 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 176 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:21:01,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 202 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:21:01,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-13 14:21:01,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 320. [2024-11-13 14:21:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 292 states have (on average 1.38013698630137) internal successors, (403), 319 states have internal predecessors, (403), 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-13 14:21:01,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 403 transitions. [2024-11-13 14:21:01,976 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 403 transitions. Word has length 30 [2024-11-13 14:21:01,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:21:01,977 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 403 transitions. [2024-11-13 14:21:01,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 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-13 14:21:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 403 transitions. [2024-11-13 14:21:01,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 14:21:01,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:01,978 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:21:02,005 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 14:21:02,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 14:21:02,179 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-13 14:21:02,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:02,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1105137754, now seen corresponding path program 1 times [2024-11-13 14:21:02,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:21:02,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29542502] [2024-11-13 14:21:02,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:02,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:21:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:02,745 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 14:21:02,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:21:02,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29542502] [2024-11-13 14:21:02,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29542502] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:21:02,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036151029] [2024-11-13 14:21:02,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:02,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:21:02,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:21:02,750 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:21:02,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:21:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:02,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 14:21:02,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:21:02,971 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-13 14:21:03,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:21:03,039 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-13 14:21:03,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:21:03,103 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-13 14:21:03,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:21:03,149 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-13 14:21:03,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:21:03,198 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-13 14:21:03,289 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 14:21:03,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:21:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 14:21:04,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036151029] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:21:04,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:21:04,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-11-13 14:21:04,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167800427] [2024-11-13 14:21:04,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:21:04,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:21:04,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:21:04,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:21:04,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:21:04,188 INFO L87 Difference]: Start difference. First operand 320 states and 403 transitions. Second operand has 11 states, 10 states have (on average 7.6) internal successors, (76), 11 states have internal predecessors, (76), 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-13 14:21:04,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:21:04,488 INFO L93 Difference]: Finished difference Result 321 states and 397 transitions. [2024-11-13 14:21:04,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:21:04,489 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 11 states have internal predecessors, (76), 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 30 [2024-11-13 14:21:04,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:21:04,491 INFO L225 Difference]: With dead ends: 321 [2024-11-13 14:21:04,491 INFO L226 Difference]: Without dead ends: 321 [2024-11-13 14:21:04,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:21:04,492 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 96 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:21:04,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 355 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:21:04,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-13 14:21:04,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2024-11-13 14:21:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 292 states have (on average 1.3493150684931507) internal successors, (394), 317 states have internal predecessors, (394), 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-13 14:21:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 394 transitions. [2024-11-13 14:21:04,505 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 394 transitions. Word has length 30 [2024-11-13 14:21:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:21:04,506 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 394 transitions. [2024-11-13 14:21:04,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 11 states have internal predecessors, (76), 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-13 14:21:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 394 transitions. [2024-11-13 14:21:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 14:21:04,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:04,507 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 14:21:04,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 14:21:04,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:21:04,708 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-13 14:21:04,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:04,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2060481681, now seen corresponding path program 1 times [2024-11-13 14:21:04,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:21:04,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728101632] [2024-11-13 14:21:04,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:04,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:21:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,983 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 14:21:04,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:21:04,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728101632] [2024-11-13 14:21:04,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728101632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:21:04,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:21:04,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:21:04,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070051912] [2024-11-13 14:21:04,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:21:04,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:21:04,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:21:04,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:21:04,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:21:04,985 INFO L87 Difference]: Start difference. First operand 318 states and 394 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-13 14:21:05,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:21:05,114 INFO L93 Difference]: Finished difference Result 282 states and 327 transitions. [2024-11-13 14:21:05,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:21:05,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-13 14:21:05,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:21:05,116 INFO L225 Difference]: With dead ends: 282 [2024-11-13 14:21:05,116 INFO L226 Difference]: Without dead ends: 282 [2024-11-13 14:21:05,117 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-13 14:21:05,117 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 25 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 508 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-13 14:21:05,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 508 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:21:05,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-13 14:21:05,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 279. [2024-11-13 14:21:05,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 253 states have (on average 1.2806324110671936) internal successors, (324), 278 states have internal predecessors, (324), 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-13 14:21:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 324 transitions. [2024-11-13 14:21:05,127 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 324 transitions. Word has length 33 [2024-11-13 14:21:05,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:21:05,127 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 324 transitions. [2024-11-13 14:21:05,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-13 14:21:05,127 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 324 transitions. [2024-11-13 14:21:05,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-13 14:21:05,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:05,129 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-11-13 14:21:05,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 14:21:05,129 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-13 14:21:05,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:05,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1431774181, now seen corresponding path program 1 times [2024-11-13 14:21:05,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:21:05,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173649024] [2024-11-13 14:21:05,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:05,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:21:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 14:21:05,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:21:05,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173649024] [2024-11-13 14:21:05,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173649024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:21:05,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:21:05,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:21:05,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230935870] [2024-11-13 14:21:05,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:21:05,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:21:05,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:21:05,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:21:05,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:21:05,553 INFO L87 Difference]: Start difference. First operand 279 states and 324 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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-13 14:21:05,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:21:05,989 INFO L93 Difference]: Finished difference Result 288 states and 335 transitions. [2024-11-13 14:21:05,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:21:05,990 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 55 [2024-11-13 14:21:05,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:21:05,991 INFO L225 Difference]: With dead ends: 288 [2024-11-13 14:21:05,992 INFO L226 Difference]: Without dead ends: 288 [2024-11-13 14:21:05,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:21:05,992 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 127 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:21:05,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 491 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:21:05,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-13 14:21:06,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 280. [2024-11-13 14:21:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 255 states have (on average 1.2823529411764707) internal successors, (327), 279 states have internal predecessors, (327), 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-13 14:21:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 327 transitions. [2024-11-13 14:21:06,011 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 327 transitions. Word has length 55 [2024-11-13 14:21:06,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:21:06,011 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 327 transitions. [2024-11-13 14:21:06,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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-13 14:21:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 327 transitions. [2024-11-13 14:21:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-13 14:21:06,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:06,014 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-11-13 14:21:06,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 14:21:06,014 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-13 14:21:06,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:06,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1431774180, now seen corresponding path program 1 times [2024-11-13 14:21:06,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:21:06,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110836676] [2024-11-13 14:21:06,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:06,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:21:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:21:06,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:21:06,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110836676] [2024-11-13 14:21:06,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110836676] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:21:06,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324477283] [2024-11-13 14:21:06,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:06,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:21:06,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:21:06,401 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:21:06,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 14:21:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:06,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 14:21:06,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:21:06,741 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:21:06,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:21:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:21:06,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324477283] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:21:06,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:21:06,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 15 [2024-11-13 14:21:06,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585662490] [2024-11-13 14:21:06,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:21:06,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 14:21:06,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:21:06,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 14:21:06,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:21:06,893 INFO L87 Difference]: Start difference. First operand 280 states and 327 transitions. Second operand has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 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-13 14:21:07,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:21:07,260 INFO L93 Difference]: Finished difference Result 376 states and 421 transitions. [2024-11-13 14:21:07,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 14:21:07,261 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 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 55 [2024-11-13 14:21:07,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:21:07,263 INFO L225 Difference]: With dead ends: 376 [2024-11-13 14:21:07,263 INFO L226 Difference]: Without dead ends: 376 [2024-11-13 14:21:07,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 100 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2024-11-13 14:21:07,264 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 189 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:21:07,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1378 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:21:07,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-13 14:21:07,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 325. [2024-11-13 14:21:07,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 300 states have (on average 1.2866666666666666) internal successors, (386), 324 states have internal predecessors, (386), 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-13 14:21:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 386 transitions. [2024-11-13 14:21:07,276 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 386 transitions. Word has length 55 [2024-11-13 14:21:07,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:21:07,276 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 386 transitions. [2024-11-13 14:21:07,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 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-13 14:21:07,276 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 386 transitions. [2024-11-13 14:21:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-13 14:21:07,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:07,277 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-11-13 14:21:07,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-13 14:21:07,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:21:07,479 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-13 14:21:07,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:07,480 INFO L85 PathProgramCache]: Analyzing trace with hash 123791196, now seen corresponding path program 2 times [2024-11-13 14:21:07,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:21:07,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759724122] [2024-11-13 14:21:07,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:07,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:21:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 14:21:08,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:21:08,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759724122] [2024-11-13 14:21:08,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759724122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:21:08,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:21:08,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:21:08,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354470759] [2024-11-13 14:21:08,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:21:08,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:21:08,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:21:08,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:21:08,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:21:08,166 INFO L87 Difference]: Start difference. First operand 325 states and 386 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 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-13 14:21:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:21:08,672 INFO L93 Difference]: Finished difference Result 369 states and 444 transitions. [2024-11-13 14:21:08,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:21:08,672 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 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 55 [2024-11-13 14:21:08,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:21:08,674 INFO L225 Difference]: With dead ends: 369 [2024-11-13 14:21:08,678 INFO L226 Difference]: Without dead ends: 369 [2024-11-13 14:21:08,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:21:08,680 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 134 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:21:08,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 608 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 14:21:08,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-13 14:21:08,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 358. [2024-11-13 14:21:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 333 states have (on average 1.3093093093093093) internal successors, (436), 357 states have internal predecessors, (436), 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-13 14:21:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 436 transitions. [2024-11-13 14:21:08,694 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 436 transitions. Word has length 55 [2024-11-13 14:21:08,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:21:08,695 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 436 transitions. [2024-11-13 14:21:08,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 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-13 14:21:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 436 transitions. [2024-11-13 14:21:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-13 14:21:08,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:08,696 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-11-13 14:21:08,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 14:21:08,696 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-13 14:21:08,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:08,697 INFO L85 PathProgramCache]: Analyzing trace with hash -457475662, now seen corresponding path program 1 times [2024-11-13 14:21:08,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:21:08,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388147717] [2024-11-13 14:21:08,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:08,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:21:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-13 14:21:08,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:21:08,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388147717] [2024-11-13 14:21:08,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388147717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:21:08,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:21:08,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:21:08,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725245505] [2024-11-13 14:21:08,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:21:08,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:21:08,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:21:08,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:21:08,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:21:08,971 INFO L87 Difference]: Start difference. First operand 358 states and 436 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-13 14:21:09,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:21:09,131 INFO L93 Difference]: Finished difference Result 372 states and 447 transitions. [2024-11-13 14:21:09,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:21:09,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 56 [2024-11-13 14:21:09,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:21:09,133 INFO L225 Difference]: With dead ends: 372 [2024-11-13 14:21:09,134 INFO L226 Difference]: Without dead ends: 372 [2024-11-13 14:21:09,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:21:09,134 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 52 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:21:09,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 549 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:21:09,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-13 14:21:09,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 363. [2024-11-13 14:21:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 338 states have (on average 1.3047337278106508) internal successors, (441), 362 states have internal predecessors, (441), 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-13 14:21:09,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 441 transitions. [2024-11-13 14:21:09,147 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 441 transitions. Word has length 56 [2024-11-13 14:21:09,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:21:09,148 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 441 transitions. [2024-11-13 14:21:09,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-13 14:21:09,148 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 441 transitions. [2024-11-13 14:21:09,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-13 14:21:09,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:09,149 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-11-13 14:21:09,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 14:21:09,149 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-13 14:21:09,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:09,150 INFO L85 PathProgramCache]: Analyzing trace with hash -457397312, now seen corresponding path program 1 times [2024-11-13 14:21:09,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:21:09,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381365253] [2024-11-13 14:21:09,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:09,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:21:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-13 14:21:09,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:21:09,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381365253] [2024-11-13 14:21:09,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381365253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:21:09,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:21:09,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:21:09,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612563945] [2024-11-13 14:21:09,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:21:09,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:21:09,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:21:09,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:21:09,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:21:09,316 INFO L87 Difference]: Start difference. First operand 363 states and 441 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-13 14:21:09,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:21:09,388 INFO L93 Difference]: Finished difference Result 410 states and 492 transitions. [2024-11-13 14:21:09,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:21:09,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 56 [2024-11-13 14:21:09,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:21:09,391 INFO L225 Difference]: With dead ends: 410 [2024-11-13 14:21:09,391 INFO L226 Difference]: Without dead ends: 410 [2024-11-13 14:21:09,392 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-13 14:21:09,393 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 96 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:21:09,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 246 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:21:09,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-11-13 14:21:09,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 361. [2024-11-13 14:21:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 336 states have (on average 1.3005952380952381) internal successors, (437), 360 states have internal predecessors, (437), 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-13 14:21:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 437 transitions. [2024-11-13 14:21:09,408 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 437 transitions. Word has length 56 [2024-11-13 14:21:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:21:09,408 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 437 transitions. [2024-11-13 14:21:09,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-13 14:21:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 437 transitions. [2024-11-13 14:21:09,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 14:21:09,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:09,411 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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-13 14:21:09,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 14:21:09,412 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-13 14:21:09,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:09,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1296844183, now seen corresponding path program 1 times [2024-11-13 14:21:09,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:21:09,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128125168] [2024-11-13 14:21:09,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:09,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:21:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:09,757 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 14:21:09,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:21:09,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128125168] [2024-11-13 14:21:09,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128125168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:21:09,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:21:09,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:21:09,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243979565] [2024-11-13 14:21:09,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:21:09,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:21:09,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:21:09,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:21:09,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:21:09,759 INFO L87 Difference]: Start difference. First operand 361 states and 437 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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-13 14:21:10,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:21:10,008 INFO L93 Difference]: Finished difference Result 365 states and 433 transitions. [2024-11-13 14:21:10,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:21:10,010 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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 57 [2024-11-13 14:21:10,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:21:10,012 INFO L225 Difference]: With dead ends: 365 [2024-11-13 14:21:10,012 INFO L226 Difference]: Without dead ends: 365 [2024-11-13 14:21:10,012 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-13 14:21:10,013 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 128 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:21:10,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 654 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:21:10,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-13 14:21:10,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 356. [2024-11-13 14:21:10,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 331 states have (on average 1.2900302114803626) internal successors, (427), 355 states have internal predecessors, (427), 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-13 14:21:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 427 transitions. [2024-11-13 14:21:10,025 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 427 transitions. Word has length 57 [2024-11-13 14:21:10,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:21:10,026 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 427 transitions. [2024-11-13 14:21:10,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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-13 14:21:10,026 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 427 transitions. [2024-11-13 14:21:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-13 14:21:10,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:10,031 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-11-13 14:21:10,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 14:21:10,031 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-13 14:21:10,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:10,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1513300581, now seen corresponding path program 1 times [2024-11-13 14:21:10,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:21:10,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044746246] [2024-11-13 14:21:10,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:10,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:21:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:11,351 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 14:21:11,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:21:11,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044746246] [2024-11-13 14:21:11,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044746246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:21:11,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:21:11,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-13 14:21:11,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117348052] [2024-11-13 14:21:11,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:21:11,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 14:21:11,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:21:11,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 14:21:11,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:21:11,356 INFO L87 Difference]: Start difference. First operand 356 states and 427 transitions. Second operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 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-13 14:21:12,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:21:12,338 INFO L93 Difference]: Finished difference Result 487 states and 599 transitions. [2024-11-13 14:21:12,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 14:21:12,340 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 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 58 [2024-11-13 14:21:12,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:21:12,342 INFO L225 Difference]: With dead ends: 487 [2024-11-13 14:21:12,342 INFO L226 Difference]: Without dead ends: 487 [2024-11-13 14:21:12,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2024-11-13 14:21:12,344 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 109 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:21:12,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 869 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 14:21:12,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-11-13 14:21:12,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 411. [2024-11-13 14:21:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 386 states have (on average 1.3082901554404145) internal successors, (505), 410 states have internal predecessors, (505), 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-13 14:21:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 505 transitions. [2024-11-13 14:21:12,361 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 505 transitions. Word has length 58 [2024-11-13 14:21:12,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:21:12,361 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 505 transitions. [2024-11-13 14:21:12,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 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-13 14:21:12,361 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 505 transitions. [2024-11-13 14:21:12,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-13 14:21:12,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:12,368 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-11-13 14:21:12,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 14:21:12,369 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-13 14:21:12,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:12,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1513300580, now seen corresponding path program 1 times [2024-11-13 14:21:12,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:21:12,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479461917] [2024-11-13 14:21:12,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:12,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:21:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 14:21:14,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:21:14,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479461917] [2024-11-13 14:21:14,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479461917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:21:14,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:21:14,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-13 14:21:14,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142906416] [2024-11-13 14:21:14,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:21:14,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 14:21:14,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:21:14,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 14:21:14,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:21:14,287 INFO L87 Difference]: Start difference. First operand 411 states and 505 transitions. Second operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 17 states have internal predecessors, (45), 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-13 14:21:15,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:21:15,776 INFO L93 Difference]: Finished difference Result 586 states and 717 transitions. [2024-11-13 14:21:15,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 14:21:15,777 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 17 states have internal predecessors, (45), 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 58 [2024-11-13 14:21:15,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:21:15,780 INFO L225 Difference]: With dead ends: 586 [2024-11-13 14:21:15,780 INFO L226 Difference]: Without dead ends: 586 [2024-11-13 14:21:15,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2024-11-13 14:21:15,781 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 140 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:21:15,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 764 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 14:21:15,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2024-11-13 14:21:15,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 411. [2024-11-13 14:21:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 386 states have (on average 1.3031088082901554) internal successors, (503), 410 states have internal predecessors, (503), 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-13 14:21:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 503 transitions. [2024-11-13 14:21:15,795 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 503 transitions. Word has length 58 [2024-11-13 14:21:15,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:21:15,795 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 503 transitions. [2024-11-13 14:21:15,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 17 states have internal predecessors, (45), 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-13 14:21:15,795 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 503 transitions. [2024-11-13 14:21:15,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 14:21:15,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:15,796 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 14:21:15,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 14:21:15,796 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-13 14:21:15,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:15,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1534225511, now seen corresponding path program 1 times [2024-11-13 14:21:15,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:21:15,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566597876] [2024-11-13 14:21:15,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:15,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:21:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 14:21:18,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:21:18,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566597876] [2024-11-13 14:21:18,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566597876] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:21:18,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084658393] [2024-11-13 14:21:18,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:18,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:21:18,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:21:18,358 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:21:18,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a7a421-412f-4fdf-aa1f-e87ceb0449a8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 14:21:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:18,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-11-13 14:21:18,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:21:18,933 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-13 14:21:19,212 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 14:21:19,212 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 12 treesize of output 14 [2024-11-13 14:21:19,402 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-13 14:21:19,431 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-13 14:21:19,945 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-13 14:21:19,970 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 29 treesize of output 17 [2024-11-13 14:21:20,161 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-13 14:21:20,161 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 45 treesize of output 46 [2024-11-13 14:21:20,200 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2024-11-13 14:21:20,200 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-13 14:21:20,866 INFO L349 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2024-11-13 14:21:20,867 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-13 14:21:20,905 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-13 14:21:20,905 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 55 [2024-11-13 14:21:21,322 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-13 14:21:21,330 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-13 14:21:23,254 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-13 14:21:23,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 145 [2024-11-13 14:21:23,299 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-13 14:21:23,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 137 [2024-11-13 14:21:25,195 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2024-11-13 14:21:25,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 127 treesize of output 126 [2024-11-13 14:21:25,265 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2024-11-13 14:21:25,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 87 treesize of output 103 [2024-11-13 14:21:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 14:21:26,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:21:28,059 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-13 14:21:28,069 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-13 14:22:43,307 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 ((.cse5 (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4))) (let ((.cse2 (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse111 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse109 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) (.cse102 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse111 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse107 (select .cse102 v_arrayElimCell_47)) (.cse108 (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse109 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse110 (+ 4 v_arrayElimCell_48))) (let ((.cse104 (select .cse108 .cse110)) (.cse105 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse111)) (.cse103 (select .cse107 .cse110)) (.cse106 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse109) v_arrayElimCell_47) .cse5))) (or (= (select (select .cse102 .cse103) .cse104) 0) (= (select |c_#valid| (select (select .cse105 .cse103) .cse104)) 1) (< .cse104 0) (= (select |c_#valid| (select (select .cse105 (select (select .cse105 v_arrayElimCell_47) .cse5)) .cse106)) 1) (= (select (select .cse102 (select .cse107 .cse5)) (select .cse108 .cse5)) 0) (not (= (select |c_#valid| .cse103) 1)) (< .cse106 0))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse118 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|))) (let ((.cse112 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse118 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse115 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse116 (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse115 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse117 (select .cse112 v_arrayElimCell_47)) (.cse119 (+ 4 v_arrayElimCell_48))) (let ((.cse114 (select .cse117 .cse119)) (.cse113 (select .cse116 .cse119))) (or (= (select (select .cse112 .cse113) .cse114) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse115) .cse113) .cse114)) 1) (< .cse114 0) (= (select (select .cse112 (select .cse116 .cse5)) (select .cse117 .cse5)) 0) (not (= (select |c_#valid| .cse113) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse118) v_arrayElimCell_47) .cse5) 0))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse123 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|)) (.cse120 (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|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse124 (+ 4 v_arrayElimCell_48))) (let ((.cse122 (select (select .cse120 v_arrayElimCell_47) .cse124)) (.cse121 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse123 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47) .cse124))) (or (= (select (select .cse120 .cse121) .cse122) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse123) .cse121) .cse122)) 1) (< .cse122 0) (not (= (select |c_#valid| .cse121) 1)))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse132 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|))) (let ((.cse125 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse132 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse134 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse130 (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse134 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse131 (select .cse125 v_arrayElimCell_47)) (.cse133 (+ 4 v_arrayElimCell_48))) (let ((.cse127 (select .cse131 .cse133)) (.cse128 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse134)) (.cse126 (select .cse130 .cse133)) (.cse129 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse132) v_arrayElimCell_47) .cse5))) (or (= (select (select .cse125 .cse126) .cse127) 0) (= (select |c_#valid| (select (select .cse128 .cse126) .cse127)) 1) (< .cse127 0) (= (select |c_#valid| (select (select .cse128 (select (select .cse128 v_arrayElimCell_47) .cse5)) .cse129)) 1) (= (select (select .cse125 (select .cse130 .cse5)) (select .cse131 .cse5)) 0) (not (= (select |c_#valid| .cse126) 1)) (< .cse129 0))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse138 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse135 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse138 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse139 (+ 4 v_arrayElimCell_48))) (let ((.cse137 (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|) .cse5 |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_47) .cse139)) (.cse136 (select (select .cse135 v_arrayElimCell_47) .cse139))) (or (= (select (select .cse135 .cse136) .cse137) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse138) .cse136) .cse137)) 1) (< .cse137 0) (not (= (select |c_#valid| .cse136) 1))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse143 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse146 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) (.cse140 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse143 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse144 (select .cse140 v_arrayElimCell_47)) (.cse145 (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse146 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse147 (+ 4 v_arrayElimCell_48))) (let ((.cse142 (select .cse145 .cse147)) (.cse141 (select .cse144 .cse147))) (or (= (select (select .cse140 .cse141) .cse142) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse143) .cse141) .cse142)) 1) (< .cse142 0) (= (select (select .cse140 (select .cse144 .cse5)) (select .cse145 .cse5)) 0) (not (= (select |c_#valid| .cse141) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse146) v_arrayElimCell_47) .cse5) 0))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse151 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse148 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse151 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse152 (select .cse148 v_arrayElimCell_47)) (.cse153 (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|) .cse5 |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_47)) (.cse154 (+ 4 v_arrayElimCell_48))) (let ((.cse150 (select .cse153 .cse154)) (.cse149 (select .cse152 .cse154))) (or (= (select (select .cse148 .cse149) .cse150) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse151) .cse149) .cse150)) 1) (< .cse150 0) (= (select (select .cse148 (select .cse152 .cse5)) (select .cse153 .cse5)) 0) (not (= (select |c_#valid| .cse149) 1)))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse159 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|))) (let ((.cse158 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|)) (.cse155 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse159 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse160 (+ 4 v_arrayElimCell_48))) (let ((.cse157 (select (select .cse155 v_arrayElimCell_47) .cse160)) (.cse156 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse158 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47) .cse160))) (or (= (select (select .cse155 .cse156) .cse157) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse158) .cse156) .cse157)) 1) (< .cse157 0) (not (= (select |c_#valid| .cse156) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse159) v_arrayElimCell_47) .cse5) 0)))))))) (.cse55 (and .cse0 .cse1)) (.cse3 (not .cse1)) (.cse6 (not (= (select |c_#valid| |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) 1))) (.cse7 (not .cse0))) (and (or .cse2 .cse0) (or .cse3 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse4 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |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 .cse4 |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| .cse4) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) 1)))) .cse6 .cse7) (or (let ((.cse10 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse54 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse52 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) (.cse46 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse54 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse50 (select .cse46 v_arrayElimCell_47)) (.cse51 (select (store |c_#memory_$Pointer$#2.offset| |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_47)) (.cse53 (+ 4 v_arrayElimCell_48))) (let ((.cse49 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse54)) (.cse48 (select .cse51 .cse53)) (.cse47 (select .cse50 .cse53))) (or (= (select (select .cse46 .cse47) .cse48) 0) (= (select |c_#valid| (select (select .cse49 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) 1) (= (select |c_#valid| (select (select .cse49 .cse47) .cse48)) 1) (< .cse48 0) (= (select (select .cse46 (select .cse50 .cse5)) (select .cse51 .cse5)) 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| .cse52) v_arrayElimCell_47) .cse5) 0)))))))) (.cse9 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse45 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse40 (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_48))) (let ((.cse43 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse45)) (.cse42 (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|) .cse5 |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_47) .cse44)) (.cse41 (select (select .cse40 v_arrayElimCell_47) .cse44))) (or (= (select (select .cse40 .cse41) .cse42) 0) (= (select |c_#valid| (select (select .cse43 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) 1) (= (select |c_#valid| (select (select .cse43 .cse41) .cse42)) 1) (< .cse42 0) (not (= (select |c_#valid| .cse41) 1)))))))) (.cse11 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse39 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse37 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) (.cse30 (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)))) (let ((.cse35 (select .cse30 v_arrayElimCell_47)) (.cse36 (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse37 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse38 (+ 4 v_arrayElimCell_48))) (let ((.cse32 (select .cse36 .cse38)) (.cse33 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse39)) (.cse31 (select .cse35 .cse38)) (.cse34 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse37) v_arrayElimCell_47) .cse5))) (or (= (select (select .cse30 .cse31) .cse32) 0) (= (select |c_#valid| (select (select .cse33 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) 1) (= (select |c_#valid| (select (select .cse33 .cse31) .cse32)) 1) (< .cse32 0) (= (select |c_#valid| (select (select .cse33 (select (select .cse33 v_arrayElimCell_47) .cse5)) .cse34)) 1) (= (select (select .cse30 (select .cse35 .cse5)) (select .cse36 .cse5)) 0) (not (= (select |c_#valid| .cse31) 1)) (< .cse34 0)))))))) (.cse8 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse29 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse22 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse29 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse26 (select .cse22 v_arrayElimCell_47)) (.cse27 (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|) .cse5 |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_47)) (.cse28 (+ 4 v_arrayElimCell_48))) (let ((.cse25 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse29)) (.cse24 (select .cse27 .cse28)) (.cse23 (select .cse26 .cse28))) (or (= (select (select .cse22 .cse23) .cse24) 0) (= (select |c_#valid| (select (select .cse25 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) 1) (= (select |c_#valid| (select (select .cse25 .cse23) .cse24)) 1) (< .cse24 0) (= (select (select .cse22 (select .cse26 .cse5)) (select .cse27 .cse5)) 0) (not (= (select |c_#valid| .cse23) 1)))))))))) (and (or .cse1 .cse8) (or .cse9 .cse1) (or .cse10 .cse1) (or .cse10 .cse0) (or .cse9 .cse0) (or .cse11 .cse1) (or .cse11 .cse0) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse21 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse19 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) (.cse12 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse21 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse17 (select .cse12 v_arrayElimCell_47)) (.cse18 (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_47)) (.cse20 (+ 4 v_arrayElimCell_48))) (let ((.cse14 (select .cse18 .cse20)) (.cse15 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse21)) (.cse13 (select .cse17 .cse20)) (.cse16 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse19) v_arrayElimCell_47) .cse5))) (or (= (select (select .cse12 .cse13) .cse14) 0) (= (select (select .cse12 |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 .cse15 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) 1) (= (select |c_#valid| (select (select .cse15 .cse13) .cse14)) 1) (< .cse14 0) (= (select |c_#valid| (select (select .cse15 (select (select .cse15 v_arrayElimCell_47) .cse5)) .cse16)) 1) (= (select (select .cse12 (select .cse17 .cse5)) (select .cse18 .cse5)) 0) (not (= (select |c_#valid| .cse13) 1)) (< .cse16 0))))))) (or .cse0 .cse8))) .cse55) (or .cse2 .cse1) (or (let ((.cse57 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse99 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|))) (let ((.cse92 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse99 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse101 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse97 (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse101 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse98 (select .cse92 v_arrayElimCell_47)) (.cse100 (+ 4 v_arrayElimCell_48))) (let ((.cse94 (select .cse98 .cse100)) (.cse95 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse101)) (.cse93 (select .cse97 .cse100)) (.cse96 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse99) v_arrayElimCell_47) .cse5))) (or (= (select (select .cse92 .cse93) .cse94) 0) (= (select |c_#valid| (select (select .cse95 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) 1) (= (select |c_#valid| (select (select .cse95 .cse93) .cse94)) 1) (< .cse94 0) (= (select |c_#valid| (select (select .cse95 (select (select .cse95 v_arrayElimCell_47) .cse5)) .cse96)) 1) (= (select (select .cse92 (select .cse97 .cse5)) (select .cse98 .cse5)) 0) (not (= (select |c_#valid| .cse93) 1)) (< .cse96 0)))))))) (.cse59 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse86 (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|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse91 (+ 4 v_arrayElimCell_48)) (.cse90 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse89 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse90)) (.cse88 (select (select .cse86 v_arrayElimCell_47) .cse91)) (.cse87 (select (select (store |c_#memory_$Pointer$#2.base| |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_47) .cse91))) (or (= (select (select .cse86 .cse87) .cse88) 0) (= (select |c_#valid| (select (select .cse89 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) 1) (= (select |c_#valid| (select (select .cse89 .cse87) .cse88)) 1) (< .cse88 0) (not (= (select |c_#valid| .cse87) 1))))))) (.cse56 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse83 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |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 .cse83 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse85 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse81 (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_47)) (.cse82 (select .cse77 v_arrayElimCell_47)) (.cse84 (+ 4 v_arrayElimCell_48))) (let ((.cse80 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse85)) (.cse79 (select .cse82 .cse84)) (.cse78 (select .cse81 .cse84))) (or (= (select (select .cse77 .cse78) .cse79) 0) (= (select |c_#valid| (select (select .cse80 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) 1) (= (select |c_#valid| (select (select .cse80 .cse78) .cse79)) 1) (< .cse79 0) (= (select (select .cse77 (select .cse81 .cse5)) (select .cse82 .cse5)) 0) (not (= (select |c_#valid| .cse78) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse83) v_arrayElimCell_47) .cse5) 0)))))))) (.cse58 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse74 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|))) (let ((.cse70 (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))) (.cse76 (+ 4 v_arrayElimCell_48)) (.cse75 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse73 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse75)) (.cse72 (select (select .cse70 v_arrayElimCell_47) .cse76)) (.cse71 (select (select (store |c_#memory_$Pointer$#2.base| |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)) v_arrayElimCell_47) .cse76))) (or (= (select (select .cse70 .cse71) .cse72) 0) (= (select |c_#valid| (select (select .cse73 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) 1) (= (select |c_#valid| (select (select .cse73 .cse71) .cse72)) 1) (< .cse72 0) (not (= (select |c_#valid| .cse71) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse74) v_arrayElimCell_47) .cse5) 0)))))))) (and (or .cse56 .cse0) (or .cse1 .cse57) (or .cse0 .cse57) (or .cse0 .cse58) (or .cse59 .cse0) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse67 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|))) (let ((.cse60 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse67 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse69 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|))) (let ((.cse65 (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_47)) (.cse66 (select .cse60 v_arrayElimCell_47)) (.cse68 (+ 4 v_arrayElimCell_48))) (let ((.cse62 (select .cse66 .cse68)) (.cse63 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse69)) (.cse61 (select .cse65 .cse68)) (.cse64 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse67) v_arrayElimCell_47) .cse5))) (or (= (select (select .cse60 .cse61) .cse62) 0) (= (select |c_#valid| (select (select .cse63 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|)) 1) (= (select |c_#valid| (select (select .cse63 .cse61) .cse62)) 1) (< .cse62 0) (= (select |c_#valid| (select (select .cse63 (select (select .cse63 v_arrayElimCell_47) .cse5)) .cse64)) 1) (= (select (select .cse60 (select .cse65 .cse5)) (select .cse66 .cse5)) 0) (not (= (select |c_#valid| .cse61) 1)) (= (select (select .cse60 |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) 0) (< .cse64 0))))))) (or .cse59 .cse1) (or .cse56 .cse1) (or .cse1 .cse58))) .cse55) (or (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|) .cse5 |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|) .cse5 |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))) .cse3 .cse6 .cse7)))) (< |c_ULTIMATE.start_sll_append_~head#1.offset| 0))) is different from true [2024-11-13 14:22:49,631 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_main_~#head~1#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse0 (= |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 ((.cse49 (and .cse3 .cse0)) (.cse51 (not .cse0)) (.cse52 (not (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1))) (.cse53 (not .cse3)) (.cse50 (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse105 (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 ((.cse102 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse105 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse106 (+ 4 v_arrayElimCell_48))) (let ((.cse103 (select (select .cse102 v_arrayElimCell_47) .cse106)) (.cse104 (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_47) .cse106))) (or (= (select (select .cse102 .cse103) .cse104) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse105) .cse103) .cse104)) 1) (not (= (select |c_#valid| .cse103) 1)) (< .cse104 0)))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse112 (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 ((.cse107 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse112 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse113 (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 ((.cse111 (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse113 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse110 (select .cse107 v_arrayElimCell_47)) (.cse114 (+ 4 v_arrayElimCell_48))) (let ((.cse108 (select .cse110 .cse114)) (.cse109 (select .cse111 .cse114))) (or (= (select (select .cse107 .cse108) .cse109) 0) (= (select (select .cse107 (select .cse110 .cse8)) (select .cse111 .cse8)) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse112) .cse108) .cse109)) 1) (not (= (select |c_#valid| .cse108) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse113) v_arrayElimCell_47) .cse8) 0) (< .cse109 0))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse119 (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 ((.cse115 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse119 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse118 (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|)) (.cse120 (+ 4 v_arrayElimCell_48))) (let ((.cse116 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse118 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47) .cse120)) (.cse117 (select (select .cse115 v_arrayElimCell_47) .cse120))) (or (= 0 (select (select .cse115 .cse116) .cse117)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse118) .cse116) .cse117)) 1) (not (= (select |c_#valid| .cse116) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse119) v_arrayElimCell_47) .cse8) 0) (< .cse117 0)))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse121 (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))) (.cse124 (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|)) (.cse125 (+ 4 v_arrayElimCell_48))) (let ((.cse122 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse124 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47) .cse125)) (.cse123 (select (select .cse121 v_arrayElimCell_47) .cse125))) (or (= 0 (select (select .cse121 .cse122) .cse123)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse124) .cse122) .cse123)) 1) (not (= (select |c_#valid| .cse122) 1)) (< .cse123 0))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse130 (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 ((.cse129 (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|)) (.cse126 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse130 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse132 (select .cse126 v_arrayElimCell_47)) (.cse131 (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse129 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse133 (+ 4 v_arrayElimCell_48))) (let ((.cse127 (select .cse131 .cse133)) (.cse128 (select .cse132 .cse133))) (or (= 0 (select (select .cse126 .cse127) .cse128)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse129) .cse127) .cse128)) 1) (not (= (select |c_#valid| .cse127) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse130) v_arrayElimCell_47) .cse8) 0) (< .cse128 0) (= (select (select .cse126 (select .cse131 .cse8)) (select .cse132 .cse8)) 0))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse139 (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 ((.cse134 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse139 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse138 (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_47)) (.cse137 (select .cse134 v_arrayElimCell_47)) (.cse140 (+ 4 v_arrayElimCell_48))) (let ((.cse135 (select .cse137 .cse140)) (.cse136 (select .cse138 .cse140))) (or (= (select (select .cse134 .cse135) .cse136) 0) (= (select (select .cse134 (select .cse137 .cse8)) (select .cse138 .cse8)) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse139) .cse135) .cse136)) 1) (not (= (select |c_#valid| .cse135) 1)) (< .cse136 0))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse150 (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 ((.cse141 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse150 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse149 (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 ((.cse147 (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse149 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse146 (select .cse141 v_arrayElimCell_47)) (.cse148 (+ 4 v_arrayElimCell_48))) (let ((.cse144 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse150)) (.cse142 (select .cse146 .cse148)) (.cse145 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse149) v_arrayElimCell_47) .cse8)) (.cse143 (select .cse147 .cse148))) (or (= (select (select .cse141 .cse142) .cse143) 0) (= (select |c_#valid| (select (select .cse144 (select (select .cse144 v_arrayElimCell_47) .cse8)) .cse145)) 1) (= (select (select .cse141 (select .cse146 .cse8)) (select .cse147 .cse8)) 0) (= (select |c_#valid| (select (select .cse144 .cse142) .cse143)) 1) (not (= (select |c_#valid| .cse142) 1)) (< .cse145 0) (< .cse143 0))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse159 (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 ((.cse160 (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|)) (.cse153 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse159 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse157 (select .cse153 v_arrayElimCell_47)) (.cse156 (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse160 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse158 (+ 4 v_arrayElimCell_48))) (let ((.cse151 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse160)) (.cse154 (select .cse156 .cse158)) (.cse152 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse159) v_arrayElimCell_47) .cse8)) (.cse155 (select .cse157 .cse158))) (or (= (select |c_#valid| (select (select .cse151 (select (select .cse151 v_arrayElimCell_47) .cse8)) .cse152)) 1) (= 0 (select (select .cse153 .cse154) .cse155)) (= (select |c_#valid| (select (select .cse151 .cse154) .cse155)) 1) (not (= (select |c_#valid| .cse154) 1)) (< .cse152 0) (< .cse155 0) (= (select (select .cse153 (select .cse156 .cse8)) (select .cse157 .cse8)) 0)))))))))) (and (or (let ((.cse2 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse47 (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 ((.cse48 (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|)) (.cse41 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse47 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse45 (select .cse41 v_arrayElimCell_47)) (.cse44 (select (store |c_#memory_$Pointer$#2.base| |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)) v_arrayElimCell_47)) (.cse46 (+ 4 v_arrayElimCell_48))) (let ((.cse39 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse48)) (.cse42 (select .cse44 .cse46)) (.cse40 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse47) v_arrayElimCell_47) .cse8)) (.cse43 (select .cse45 .cse46))) (or (= (select |c_#valid| (select (select .cse39 (select (select .cse39 v_arrayElimCell_47) .cse8)) .cse40)) 1) (= (select |c_#valid| (select (select .cse39 |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|)) 1) (= 0 (select (select .cse41 .cse42) .cse43)) (= (select |c_#valid| (select (select .cse39 .cse42) .cse43)) 1) (not (= (select |c_#valid| .cse42) 1)) (< .cse40 0) (< .cse43 0) (= (select (select .cse41 (select .cse44 .cse8)) (select .cse45 .cse8)) 0)))))))) (.cse5 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse36 (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 ((.cse33 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse36 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse37 (+ 4 v_arrayElimCell_48)) (.cse38 (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 ((.cse32 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse38)) (.cse34 (select (select (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)) v_arrayElimCell_47) .cse37)) (.cse35 (select (select .cse33 v_arrayElimCell_47) .cse37))) (or (= (select |c_#valid| (select (select .cse32 |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|)) 1) (= 0 (select (select .cse33 .cse34) .cse35)) (= (select |c_#valid| (select (select .cse32 .cse34) .cse35)) 1) (not (= (select |c_#valid| .cse34) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse36) v_arrayElimCell_47) .cse8) 0) (< .cse35 0))))))) (.cse1 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse27 (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))) (.cse30 (+ 4 v_arrayElimCell_48)) (.cse31 (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 ((.cse26 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse31)) (.cse28 (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_47) .cse30)) (.cse29 (select (select .cse27 v_arrayElimCell_47) .cse30))) (or (= (select |c_#valid| (select (select .cse26 |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|)) 1) (= 0 (select (select .cse27 .cse28) .cse29)) (= (select |c_#valid| (select (select .cse26 .cse28) .cse29)) 1) (not (= (select |c_#valid| .cse28) 1)) (< .cse29 0)))))) (.cse4 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse21 (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 ((.cse25 (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|)) (.cse18 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse21 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse23 (select .cse18 v_arrayElimCell_47)) (.cse22 (select (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)) v_arrayElimCell_47)) (.cse24 (+ 4 v_arrayElimCell_48))) (let ((.cse17 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse25)) (.cse19 (select .cse22 .cse24)) (.cse20 (select .cse23 .cse24))) (or (= (select |c_#valid| (select (select .cse17 |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|)) 1) (= 0 (select (select .cse18 .cse19) .cse20)) (= (select |c_#valid| (select (select .cse17 .cse19) .cse20)) 1) (not (= (select |c_#valid| .cse19) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse21) v_arrayElimCell_47) .cse8) 0) (< .cse20 0) (= (select (select .cse18 (select .cse22 .cse8)) (select .cse23 .cse8)) 0))))))))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or .cse2 .cse0) (or .cse4 .cse3) (or .cse5 .cse3) (or .cse5 .cse0) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse15 (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 ((.cse16 (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|)) (.cse6 (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 ((.cse13 (select .cse6 v_arrayElimCell_47)) (.cse12 (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse16 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse14 (+ 4 v_arrayElimCell_48))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse16)) (.cse10 (select .cse12 .cse14)) (.cse9 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse15) v_arrayElimCell_47) .cse8)) (.cse11 (select .cse13 .cse14))) (or (= (select (select .cse6 |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|) 0) (= (select |c_#valid| (select (select .cse7 (select (select .cse7 v_arrayElimCell_47) .cse8)) .cse9)) 1) (= (select |c_#valid| (select (select .cse7 |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|)) 1) (= 0 (select (select .cse6 .cse10) .cse11)) (= (select |c_#valid| (select (select .cse7 .cse10) .cse11)) 1) (not (= (select |c_#valid| .cse10) 1)) (< .cse9 0) (< .cse11 0) (= (select (select .cse6 (select .cse12 .cse8)) (select .cse13 .cse8)) 0))))))) (or .cse3 .cse1) (or .cse4 .cse0))) .cse49) (or .cse50 .cse0) (or .cse51 (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))) .cse52 .cse53) (or (let ((.cse55 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse100 (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 ((.cse95 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse100 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse99 (+ 4 v_arrayElimCell_48))) (let ((.cse98 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse100)) (.cse96 (select (select .cse95 v_arrayElimCell_47) .cse99)) (.cse97 (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_47) .cse99))) (or (= (select (select .cse95 .cse96) .cse97) 0) (= (select |c_#valid| (select (select .cse98 |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|)) 1) (= (select |c_#valid| (select (select .cse98 .cse96) .cse97)) 1) (not (= (select |c_#valid| .cse96) 1)) (< .cse97 0))))))) (.cse56 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse94 (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 ((.cse85 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse94 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse93 (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 ((.cse91 (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse93 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse90 (select .cse85 v_arrayElimCell_47)) (.cse92 (+ 4 v_arrayElimCell_48))) (let ((.cse88 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse94)) (.cse86 (select .cse90 .cse92)) (.cse89 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse93) v_arrayElimCell_47) .cse8)) (.cse87 (select .cse91 .cse92))) (or (= (select (select .cse85 .cse86) .cse87) 0) (= (select |c_#valid| (select (select .cse88 (select (select .cse88 v_arrayElimCell_47) .cse8)) .cse89)) 1) (= (select (select .cse85 (select .cse90 .cse8)) (select .cse91 .cse8)) 0) (= (select |c_#valid| (select (select .cse88 |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|)) 1) (= (select |c_#valid| (select (select .cse88 .cse86) .cse87)) 1) (not (= (select |c_#valid| .cse86) 1)) (< .cse89 0) (< .cse87 0)))))))) (.cse57 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse84 (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 ((.cse77 (store |c_#memory_$Pointer$#2.base| |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)))) (let ((.cse81 (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_47)) (.cse80 (select .cse77 v_arrayElimCell_47)) (.cse83 (+ 4 v_arrayElimCell_48))) (let ((.cse82 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse84)) (.cse78 (select .cse80 .cse83)) (.cse79 (select .cse81 .cse83))) (or (= (select (select .cse77 .cse78) .cse79) 0) (= (select (select .cse77 (select .cse80 .cse8)) (select .cse81 .cse8)) 0) (= (select |c_#valid| (select (select .cse82 |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|)) 1) (= (select |c_#valid| (select (select .cse82 .cse78) .cse79)) 1) (not (= (select |c_#valid| .cse78) 1)) (< .cse79 0)))))))) (.cse54 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 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|))) (let ((.cse68 (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))) (.cse74 (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 ((.cse72 (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_47)) (.cse71 (select .cse68 v_arrayElimCell_47)) (.cse75 (+ 4 v_arrayElimCell_48))) (let ((.cse73 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse76)) (.cse69 (select .cse71 .cse75)) (.cse70 (select .cse72 .cse75))) (or (= (select (select .cse68 .cse69) .cse70) 0) (= (select (select .cse68 (select .cse71 .cse8)) (select .cse72 .cse8)) 0) (= (select |c_#valid| (select (select .cse73 |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|)) 1) (= (select |c_#valid| (select (select .cse73 .cse69) .cse70)) 1) (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_47) .cse8) 0) (< .cse70 0))))))))) (and (or .cse54 .cse0) (or .cse55 .cse3) (or .cse0 .cse56) (or .cse55 .cse0) (or .cse3 .cse56) (or .cse3 .cse57) (or .cse0 .cse57) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse67 (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 ((.cse58 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse67 |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|) .cse8 |c_ULTIMATE.start_sll_create_#res#1.offset|))) (let ((.cse64 (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_47)) (.cse63 (select .cse58 v_arrayElimCell_47)) (.cse65 (+ 4 v_arrayElimCell_48))) (let ((.cse61 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse67)) (.cse59 (select .cse63 .cse65)) (.cse62 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse66) v_arrayElimCell_47) .cse8)) (.cse60 (select .cse64 .cse65))) (or (= (select (select .cse58 .cse59) .cse60) 0) (= (select |c_#valid| (select (select .cse61 (select (select .cse61 v_arrayElimCell_47) .cse8)) .cse62)) 1) (= (select (select .cse58 (select .cse63 .cse8)) (select .cse64 .cse8)) 0) (= (select |c_#valid| (select (select .cse61 |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|)) 1) (= 0 (select (select .cse58 |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset|)) (= (select |c_#valid| (select (select .cse61 .cse59) .cse60)) 1) (not (= (select |c_#valid| .cse59) 1)) (< .cse62 0) (< .cse60 0))))))) (or .cse54 .cse3))) .cse49) (or .cse51 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse101 (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| .cse101) |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 .cse101 |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|))))) .cse52 .cse53) (or .cse50 .cse3)))) (and (<= (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 1) 0) .cse3 .cse0) (< |c_ULTIMATE.start_sll_append_~head#1.offset| 0))) is different from true [2024-11-13 14:22:56,144 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse17 (= |c_ULTIMATE.start_main_~#head~1#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse16 (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#head~1#1.offset|))) (or (let ((.cse1 (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4))) (let ((.cse53 (and .cse17 .cse16)) (.cse2 (not .cse16)) (.cse3 (not (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (.cse4 (not .cse17)) (.cse101 (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse103 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse105 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse103 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse108 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse107 (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse108 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse106 (select .cse105 v_arrayElimCell_47)) (.cse109 (+ 4 v_arrayElimCell_48))) (let ((.cse104 (select .cse106 .cse109)) (.cse102 (select .cse107 .cse109))) (or (< .cse102 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse103) .cse104) .cse102)) 1) (= (select (select .cse105 (select .cse106 .cse1)) (select .cse107 .cse1)) 0) (not (= (select |c_#valid| .cse104) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse108) v_arrayElimCell_47) .cse1) 0) (= (select (select .cse105 .cse104) .cse102) 0))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse111 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse113 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse111 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse115 (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|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse114 (select .cse113 v_arrayElimCell_47)) (.cse116 (+ 4 v_arrayElimCell_48))) (let ((.cse112 (select .cse114 .cse116)) (.cse110 (select .cse115 .cse116))) (or (< .cse110 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse111) .cse112) .cse110)) 1) (= (select (select .cse113 (select .cse114 .cse1)) (select .cse115 .cse1)) 0) (not (= (select |c_#valid| .cse112) 1)) (= (select (select .cse113 .cse112) .cse110) 0))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse124 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse120 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse124 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse125 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse121 (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse125 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse122 (select .cse120 v_arrayElimCell_47)) (.cse126 (+ 4 v_arrayElimCell_48))) (let ((.cse117 (select .cse122 .cse126)) (.cse119 (select .cse121 .cse126)) (.cse118 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse125)) (.cse123 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse124) v_arrayElimCell_47) .cse1))) (or (< .cse117 0) (= (select |c_#valid| (select (select .cse118 .cse119) .cse117)) 1) (= (select (select .cse120 .cse119) .cse117) 0) (= (select (select .cse120 (select .cse121 .cse1)) (select .cse122 .cse1)) 0) (not (= (select |c_#valid| .cse119) 1)) (< .cse123 0) (= (select |c_#valid| (select (select .cse118 (select (select .cse118 v_arrayElimCell_47) .cse1)) .cse123)) 1))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse128 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse130 (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|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse131 (+ 4 v_arrayElimCell_48))) (let ((.cse127 (select (select .cse130 v_arrayElimCell_47) .cse131)) (.cse129 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse128 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47) .cse131))) (or (< .cse127 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse128) .cse129) .cse127)) 1) (= (select (select .cse130 .cse129) .cse127) 0) (not (= (select |c_#valid| .cse129) 1)))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse136 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse133 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse135 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse136 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse137 (+ 4 v_arrayElimCell_48))) (let ((.cse132 (select (select .cse135 v_arrayElimCell_47) .cse137)) (.cse134 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse133 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47) .cse137))) (or (< .cse132 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse133) .cse134) .cse132)) 1) (= (select (select .cse135 .cse134) .cse132) 0) (not (= (select |c_#valid| .cse134) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse136) v_arrayElimCell_47) .cse1) 0)))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse139 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse141 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse139 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse142 (+ 4 v_arrayElimCell_48))) (let ((.cse140 (select (select .cse141 v_arrayElimCell_47) .cse142)) (.cse138 (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|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47) .cse142))) (or (< .cse138 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse139) .cse140) .cse138)) 1) (not (= (select |c_#valid| .cse140) 1)) (= (select (select .cse141 .cse140) .cse138) 0)))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse149 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse146 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse149 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse144 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse147 (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse144 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse148 (select .cse146 v_arrayElimCell_47)) (.cse150 (+ 4 v_arrayElimCell_48))) (let ((.cse143 (select .cse148 .cse150)) (.cse145 (select .cse147 .cse150))) (or (< .cse143 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse144) .cse145) .cse143)) 1) (= (select (select .cse146 .cse145) .cse143) 0) (= (select (select .cse146 (select .cse147 .cse1)) (select .cse148 .cse1)) 0) (not (= (select |c_#valid| .cse145) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse149) v_arrayElimCell_47) .cse1) 0))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse159 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse154 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse159 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse158 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse156 (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse158 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse155 (select .cse154 v_arrayElimCell_47)) (.cse160 (+ 4 v_arrayElimCell_48))) (let ((.cse153 (select .cse155 .cse160)) (.cse151 (select .cse156 .cse160)) (.cse152 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse159)) (.cse157 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse158) v_arrayElimCell_47) .cse1))) (or (< .cse151 0) (= (select |c_#valid| (select (select .cse152 .cse153) .cse151)) 1) (= (select (select .cse154 (select .cse155 .cse1)) (select .cse156 .cse1)) 0) (not (= (select |c_#valid| .cse153) 1)) (< .cse157 0) (= (select (select .cse154 .cse153) .cse151) 0) (= (select |c_#valid| (select (select .cse152 (select (select .cse152 v_arrayElimCell_47) .cse1)) .cse157)) 1)))))))))) (and (or (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int)) (let ((.cse0 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |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 .cse0 |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| .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) 1)))) .cse2 .cse3 .cse4) (or (let ((.cse18 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse50 (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|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse52 (+ 4 v_arrayElimCell_48)) (.cse51 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse48 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse51)) (.cse47 (select (select .cse50 v_arrayElimCell_47) .cse52)) (.cse49 (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_47) .cse52))) (or (< .cse47 0) (= (select |c_#valid| (select (select .cse48 .cse49) .cse47)) 1) (= (select |c_#valid| (select (select .cse48 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) 1) (= (select (select .cse50 .cse49) .cse47) 0) (not (= (select |c_#valid| .cse49) 1))))))) (.cse15 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse44 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse41 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse44 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse46 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse42 (select (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)) v_arrayElimCell_47)) (.cse43 (select .cse41 v_arrayElimCell_47)) (.cse45 (+ 4 v_arrayElimCell_48))) (let ((.cse39 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse46)) (.cse38 (select .cse43 .cse45)) (.cse40 (select .cse42 .cse45))) (or (< .cse38 0) (= (select |c_#valid| (select (select .cse39 .cse40) .cse38)) 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) (= (select (select .cse41 .cse40) .cse38) 0) (= (select (select .cse41 (select .cse42 .cse1)) (select .cse43 .cse1)) 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| .cse44) v_arrayElimCell_47) .cse1) 0)))))))) (.cse19 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse35 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse31 (store |c_#memory_$Pointer$#2.offset| |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))) (.cse36 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse32 (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse36 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse33 (select .cse31 v_arrayElimCell_47)) (.cse37 (+ 4 v_arrayElimCell_48))) (let ((.cse28 (select .cse33 .cse37)) (.cse30 (select .cse32 .cse37)) (.cse29 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse36)) (.cse34 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse35) v_arrayElimCell_47) .cse1))) (or (< .cse28 0) (= (select |c_#valid| (select (select .cse29 .cse30) .cse28)) 1) (= (select |c_#valid| (select (select .cse29 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) 1) (= (select (select .cse31 .cse30) .cse28) 0) (= (select (select .cse31 (select .cse32 .cse1)) (select .cse33 .cse1)) 0) (not (= (select |c_#valid| .cse30) 1)) (< .cse34 0) (= (select |c_#valid| (select (select .cse29 (select (select .cse29 v_arrayElimCell_47) .cse1)) .cse34)) 1)))))))) (.cse20 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse25 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse24 (store |c_#memory_$Pointer$#2.offset| |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))) (.cse27 (+ 4 v_arrayElimCell_48)) (.cse26 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse22 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse26)) (.cse21 (select (select .cse24 v_arrayElimCell_47) .cse27)) (.cse23 (select (select (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)) v_arrayElimCell_47) .cse27))) (or (< .cse21 0) (= (select |c_#valid| (select (select .cse22 .cse23) .cse21)) 1) (= (select |c_#valid| (select (select .cse22 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) 1) (= (select (select .cse24 .cse23) .cse21) 0) (not (= (select |c_#valid| .cse23) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse25) v_arrayElimCell_47) .cse1) 0)))))))) (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse12 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse8 (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))) (.cse13 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse9 (select (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)) v_arrayElimCell_47)) (.cse10 (select .cse8 v_arrayElimCell_47)) (.cse14 (+ 4 v_arrayElimCell_48))) (let ((.cse5 (select .cse10 .cse14)) (.cse7 (select .cse9 .cse14)) (.cse6 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse13)) (.cse11 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse12) v_arrayElimCell_47) .cse1))) (or (< .cse5 0) (= (select |c_#valid| (select (select .cse6 .cse7) .cse5)) 1) (= (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) (= (select (select .cse8 .cse7) .cse5) 0) (= (select (select .cse8 (select .cse9 .cse1)) (select .cse10 .cse1)) 0) (not (= (select |c_#valid| .cse7) 1)) (< .cse11 0) (= (select (select .cse8 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= (select |c_#valid| (select (select .cse6 (select (select .cse6 v_arrayElimCell_47) .cse1)) .cse11)) 1))))))) (or .cse15 .cse16) (or .cse17 .cse18) (or .cse16 .cse18) (or .cse19 .cse17) (or .cse15 .cse17) (or .cse19 .cse16) (or .cse20 .cse17) (or .cse20 .cse16))) .cse53) (or (let ((.cse54 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse100 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse98 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse100 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse99 (+ 4 v_arrayElimCell_48))) (let ((.cse96 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse100)) (.cse97 (select (select .cse98 v_arrayElimCell_47) .cse99)) (.cse95 (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|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47) .cse99))) (or (< .cse95 0) (= (select |c_#valid| (select (select .cse96 .cse97) .cse95)) 1) (= (select |c_#valid| (select (select .cse96 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) 1) (not (= (select |c_#valid| .cse97) 1)) (= (select (select .cse98 .cse97) .cse95) 0))))))) (.cse65 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse94 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse89 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse94 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse92 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse91 (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse92 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse90 (select .cse89 v_arrayElimCell_47)) (.cse93 (+ 4 v_arrayElimCell_48))) (let ((.cse87 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse94)) (.cse88 (select .cse90 .cse93)) (.cse86 (select .cse91 .cse93))) (or (< .cse86 0) (= (select |c_#valid| (select (select .cse87 .cse88) .cse86)) 1) (= (select |c_#valid| (select (select .cse87 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) 1) (= (select (select .cse89 (select .cse90 .cse1)) (select .cse91 .cse1)) 0) (not (= (select |c_#valid| .cse88) 1)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse92) v_arrayElimCell_47) .cse1) 0) (= (select (select .cse89 .cse88) .cse86) 0)))))))) (.cse67 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse85 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse81 (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)))) (let ((.cse83 (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|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse82 (select .cse81 v_arrayElimCell_47)) (.cse84 (+ 4 v_arrayElimCell_48))) (let ((.cse79 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse85)) (.cse80 (select .cse82 .cse84)) (.cse78 (select .cse83 .cse84))) (or (< .cse78 0) (= (select |c_#valid| (select (select .cse79 .cse80) .cse78)) 1) (= (select |c_#valid| (select (select .cse79 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) 1) (= (select (select .cse81 (select .cse82 .cse1)) (select .cse83 .cse1)) 0) (not (= (select |c_#valid| .cse80) 1)) (= (select (select .cse81 .cse80) .cse78) 0)))))))) (.cse66 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse76 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse71 (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))) (.cse75 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse73 (select (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)) v_arrayElimCell_47)) (.cse72 (select .cse71 v_arrayElimCell_47)) (.cse77 (+ 4 v_arrayElimCell_48))) (let ((.cse70 (select .cse72 .cse77)) (.cse68 (select .cse73 .cse77)) (.cse69 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse76)) (.cse74 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse75) v_arrayElimCell_47) .cse1))) (or (< .cse68 0) (= (select |c_#valid| (select (select .cse69 .cse70) .cse68)) 1) (= (select |c_#valid| (select (select .cse69 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) 1) (= (select (select .cse71 (select .cse72 .cse1)) (select .cse73 .cse1)) 0) (not (= (select |c_#valid| .cse70) 1)) (< .cse74 0) (= (select (select .cse71 .cse70) .cse68) 0) (= (select |c_#valid| (select (select .cse69 (select (select .cse69 v_arrayElimCell_47) .cse1)) .cse74)) 1))))))))) (and (or .cse54 .cse17) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse63 (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse56 (store |c_#memory_$Pointer$#2.base| |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))) (.cse62 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse60 (select (store |c_#memory_$Pointer$#2.offset| |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)) v_arrayElimCell_47)) (.cse59 (select .cse56 v_arrayElimCell_47)) (.cse64 (+ 4 v_arrayElimCell_48))) (let ((.cse58 (select .cse59 .cse64)) (.cse55 (select .cse60 .cse64)) (.cse57 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse63)) (.cse61 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse62) v_arrayElimCell_47) .cse1))) (or (< .cse55 0) (= 0 (select (select .cse56 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select |c_#valid| (select (select .cse57 .cse58) .cse55)) 1) (= (select |c_#valid| (select (select .cse57 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) 1) (= (select (select .cse56 (select .cse59 .cse1)) (select .cse60 .cse1)) 0) (not (= (select |c_#valid| .cse58) 1)) (< .cse61 0) (= (select (select .cse56 .cse58) .cse55) 0) (= (select |c_#valid| (select (select .cse57 (select (select .cse57 v_arrayElimCell_47) .cse1)) .cse61)) 1))))))) (or .cse16 .cse65) (or .cse66 .cse16) (or .cse54 .cse16) (or .cse17 .cse65) (or .cse17 .cse67) (or .cse16 .cse67) (or .cse66 .cse17))) .cse53) (or .cse101 .cse17) (or .cse2 (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|) .cse1 |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|) .cse1 |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))) .cse3 .cse4) (or .cse101 .cse16)))) (and .cse17 .cse16 (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 1) 0)) (< |c_ULTIMATE.start_sll_append_~head#1.offset| 0))) is different from true [2024-11-13 14:23:05,010 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_sll_create_~new_head~0#1.offset| 1) 0) .cse0 .cse1) (let ((.cse3 (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4))) (let ((.cse4 (not .cse1)) (.cse5 (not (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))) (.cse6 (not .cse0)) (.cse54 (and .cse0 .cse1)) (.cse7 (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse105 (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_~new_head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse103 (store (select |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|)) (.cse106 (+ 4 v_arrayElimCell_48))) (let ((.cse102 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse103 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47) .cse106)) (.cse104 (select (select .cse105 v_arrayElimCell_47) .cse106))) (or (not (= (select |c_#valid| .cse102) 1)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse103) .cse102) .cse104)) 1) (< .cse104 0) (= (select (select .cse105 .cse102) .cse104) 0))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse112 (store (select |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|))) (let ((.cse108 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse112 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse111 (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_~new_head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse110 (select .cse108 v_arrayElimCell_47)) (.cse113 (+ 4 v_arrayElimCell_48))) (let ((.cse107 (select .cse110 .cse113)) (.cse109 (select .cse111 .cse113))) (or (not (= (select |c_#valid| .cse107) 1)) (= (select (select .cse108 .cse107) .cse109) 0) (= (select (select .cse108 (select .cse110 .cse3)) (select .cse111 .cse3)) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse112) .cse107) .cse109)) 1) (< .cse109 0))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse118 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse117 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse118 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse115 (store (select |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|)) (.cse119 (+ 4 v_arrayElimCell_48))) (let ((.cse114 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse115 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47) .cse119)) (.cse116 (select (select .cse117 v_arrayElimCell_47) .cse119))) (or (not (= (select |c_#valid| .cse114) 1)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse115) .cse114) .cse116)) 1) (< .cse116 0) (= (select (select .cse117 .cse114) .cse116) 0) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse118) v_arrayElimCell_47) .cse3) 0)))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse123 (store (select |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|))) (let ((.cse121 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse123 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse124 (+ 4 v_arrayElimCell_48))) (let ((.cse120 (select (select .cse121 v_arrayElimCell_47) .cse124)) (.cse122 (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_~new_head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47) .cse124))) (or (not (= (select |c_#valid| .cse120) 1)) (= (select (select .cse121 .cse120) .cse122) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse123) .cse120) .cse122)) 1) (< .cse122 0)))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse130 (store (select |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|))) (let ((.cse126 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse130 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse131 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse129 (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse131 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse128 (select .cse126 v_arrayElimCell_47)) (.cse132 (+ 4 v_arrayElimCell_48))) (let ((.cse125 (select .cse128 .cse132)) (.cse127 (select .cse129 .cse132))) (or (not (= (select |c_#valid| .cse125) 1)) (= (select (select .cse126 .cse125) .cse127) 0) (= (select (select .cse126 (select .cse128 .cse3)) (select .cse129 .cse3)) 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse130) .cse125) .cse127)) 1) (< .cse127 0) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse131) v_arrayElimCell_47) .cse3) 0))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse140 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse142 (store (select |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|)) (.cse137 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse140 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse139 (select .cse137 v_arrayElimCell_47)) (.cse138 (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse142 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse141 (+ 4 v_arrayElimCell_48))) (let ((.cse134 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse142)) (.cse133 (select .cse138 .cse141)) (.cse136 (select .cse139 .cse141)) (.cse135 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse140) v_arrayElimCell_47) .cse3))) (or (not (= (select |c_#valid| .cse133) 1)) (= (select |c_#valid| (select (select .cse134 (select (select .cse134 v_arrayElimCell_47) .cse3)) .cse135)) 1) (= (select |c_#valid| (select (select .cse134 .cse133) .cse136)) 1) (= (select (select .cse137 (select .cse138 .cse3)) (select .cse139 .cse3)) 0) (< .cse136 0) (= (select (select .cse137 .cse133) .cse136) 0) (< .cse135 0))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse152 (store (select |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|))) (let ((.cse144 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse152 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse150 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse149 (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse150 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse148 (select .cse144 v_arrayElimCell_47)) (.cse151 (+ 4 v_arrayElimCell_48))) (let ((.cse146 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse152)) (.cse143 (select .cse148 .cse151)) (.cse145 (select .cse149 .cse151)) (.cse147 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse150) v_arrayElimCell_47) .cse3))) (or (not (= (select |c_#valid| .cse143) 1)) (= (select (select .cse144 .cse143) .cse145) 0) (= (select |c_#valid| (select (select .cse146 (select (select .cse146 v_arrayElimCell_47) .cse3)) .cse147)) 1) (= (select (select .cse144 (select .cse148 .cse3)) (select .cse149 .cse3)) 0) (= (select |c_#valid| (select (select .cse146 .cse143) .cse145)) 1) (< .cse145 0) (< .cse147 0))))))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse159 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse154 (store (select |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|)) (.cse156 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse159 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse158 (select .cse156 v_arrayElimCell_47)) (.cse157 (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse154 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse160 (+ 4 v_arrayElimCell_48))) (let ((.cse153 (select .cse157 .cse160)) (.cse155 (select .cse158 .cse160))) (or (not (= (select |c_#valid| .cse153) 1)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse154) .cse153) .cse155)) 1) (= (select (select .cse156 (select .cse157 .cse3)) (select .cse158 .cse3)) 0) (< .cse155 0) (= (select (select .cse156 .cse153) .cse155) 0) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse159) v_arrayElimCell_47) .cse3) 0)))))))))) (and (or (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_~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| .cse2) |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 .cse2 |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)))) .cse4 .cse5 .cse6) (or .cse4 .cse5 (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_~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|) .cse3 |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))) .cse6) (or .cse7 .cse0) (or (let ((.cse8 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse51 (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_~new_head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse52 (+ 4 v_arrayElimCell_48)) (.cse53 (store (select |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|))) (let ((.cse49 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse53)) (.cse48 (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_47) .cse52)) (.cse50 (select (select .cse51 v_arrayElimCell_47) .cse52))) (or (not (= (select |c_#valid| .cse48) 1)) (= (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 .cse48) .cse50)) 1) (< .cse50 0) (= (select (select .cse51 .cse48) .cse50) 0)))))) (.cse20 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse45 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse47 (store (select |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|)) (.cse42 (store |c_#memory_$Pointer$#2.offset| |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)))) (let ((.cse44 (select .cse42 v_arrayElimCell_47)) (.cse43 (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse47 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse46 (+ 4 v_arrayElimCell_48))) (let ((.cse39 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse47)) (.cse38 (select .cse43 .cse46)) (.cse41 (select .cse44 .cse46)) (.cse40 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse45) v_arrayElimCell_47) .cse3))) (or (not (= (select |c_#valid| .cse38) 1)) (= (select |c_#valid| (select (select .cse39 (select (select .cse39 v_arrayElimCell_47) .cse3)) .cse40)) 1) (= (select |c_#valid| (select (select .cse39 |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 .cse39 .cse38) .cse41)) 1) (= (select (select .cse42 (select .cse43 .cse3)) (select .cse44 .cse3)) 0) (< .cse41 0) (= (select (select .cse42 .cse38) .cse41) 0) (< .cse40 0)))))))) (.cse9 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse35 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse34 (store |c_#memory_$Pointer$#2.offset| |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))) (.cse36 (+ 4 v_arrayElimCell_48)) (.cse37 (store (select |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|))) (let ((.cse32 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse37)) (.cse31 (select (select (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse37 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47) .cse36)) (.cse33 (select (select .cse34 v_arrayElimCell_47) .cse36))) (or (not (= (select |c_#valid| .cse31) 1)) (= (select |c_#valid| (select (select .cse32 |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 .cse32 .cse31) .cse33)) 1) (< .cse33 0) (= (select (select .cse34 .cse31) .cse33) 0) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse35) v_arrayElimCell_47) .cse3) 0))))))) (.cse21 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse28 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse30 (store (select |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|)) (.cse25 (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse28 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse27 (select .cse25 v_arrayElimCell_47)) (.cse26 (select (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)) v_arrayElimCell_47)) (.cse29 (+ 4 v_arrayElimCell_48))) (let ((.cse23 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse30)) (.cse22 (select .cse26 .cse29)) (.cse24 (select .cse27 .cse29))) (or (not (= (select |c_#valid| .cse22) 1)) (= (select |c_#valid| (select (select .cse23 |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 .cse23 .cse22) .cse24)) 1) (= (select (select .cse25 (select .cse26 .cse3)) (select .cse27 .cse3)) 0) (< .cse24 0) (= (select (select .cse25 .cse22) .cse24) 0) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse28) v_arrayElimCell_47) .cse3) 0))))))))) (and (or .cse1 .cse8) (or .cse1 .cse9) (or .cse0 .cse8) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse17 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse19 (store (select |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|)) (.cse14 (store |c_#memory_$Pointer$#2.offset| |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)))) (let ((.cse16 (select .cse14 v_arrayElimCell_47)) (.cse15 (select (store |c_#memory_$Pointer$#2.base| |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_47)) (.cse18 (+ 4 v_arrayElimCell_48))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse19)) (.cse10 (select .cse15 .cse18)) (.cse13 (select .cse16 .cse18)) (.cse12 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse17) v_arrayElimCell_47) .cse3))) (or (not (= (select |c_#valid| .cse10) 1)) (= (select |c_#valid| (select (select .cse11 (select (select .cse11 v_arrayElimCell_47) .cse3)) .cse12)) 1) (= (select |c_#valid| (select (select .cse11 |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 .cse11 .cse10) .cse13)) 1) (= (select (select .cse14 (select .cse15 .cse3)) (select .cse16 .cse3)) 0) (< .cse13 0) (= (select (select .cse14 .cse10) .cse13) 0) (= (select (select .cse14 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|) 0) (< .cse12 0))))))) (or .cse1 .cse20) (or .cse0 .cse20) (or .cse0 .cse9) (or .cse1 .cse21) (or .cse0 .cse21))) .cse54) (or .cse54 (let ((.cse56 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse101 (store (select |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|))) (let ((.cse93 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse101 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse99 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse98 (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse99 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse97 (select .cse93 v_arrayElimCell_47)) (.cse100 (+ 4 v_arrayElimCell_48))) (let ((.cse95 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse101)) (.cse92 (select .cse97 .cse100)) (.cse94 (select .cse98 .cse100)) (.cse96 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse99) v_arrayElimCell_47) .cse3))) (or (not (= (select |c_#valid| .cse92) 1)) (= (select (select .cse93 .cse92) .cse94) 0) (= (select |c_#valid| (select (select .cse95 (select (select .cse95 v_arrayElimCell_47) .cse3)) .cse96)) 1) (= (select (select .cse93 (select .cse97 .cse3)) (select .cse98 .cse3)) 0) (= (select |c_#valid| (select (select .cse95 |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 .cse95 .cse92) .cse94)) 1) (< .cse94 0) (< .cse96 0)))))))) (.cse58 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse91 (store (select |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|))) (let ((.cse85 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse91 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (let ((.cse88 (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_~new_head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47)) (.cse87 (select .cse85 v_arrayElimCell_47)) (.cse90 (+ 4 v_arrayElimCell_48))) (let ((.cse89 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse91)) (.cse84 (select .cse87 .cse90)) (.cse86 (select .cse88 .cse90))) (or (not (= (select |c_#valid| .cse84) 1)) (= (select (select .cse85 .cse84) .cse86) 0) (= (select (select .cse85 (select .cse87 .cse3)) (select .cse88 .cse3)) 0) (= (select |c_#valid| (select (select .cse89 |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 .cse89 .cse84) .cse86)) 1) (< .cse86 0)))))))) (.cse55 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse83 (store (select |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|))) (let ((.cse79 (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))) (.cse82 (+ 4 v_arrayElimCell_48))) (let ((.cse81 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse83)) (.cse78 (select (select .cse79 v_arrayElimCell_47) .cse82)) (.cse80 (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_~new_head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) v_arrayElimCell_47) .cse82))) (or (not (= (select |c_#valid| .cse78) 1)) (= (select (select .cse79 .cse78) .cse80) 0) (= (select |c_#valid| (select (select .cse81 |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 .cse81 .cse78) .cse80)) 1) (< .cse80 0))))))) (.cse57 (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse77 (store (select |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|))) (let ((.cse70 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store .cse77 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse75 (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse73 (select (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)) v_arrayElimCell_47)) (.cse72 (select .cse70 v_arrayElimCell_47)) (.cse76 (+ 4 v_arrayElimCell_48))) (let ((.cse74 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse77)) (.cse69 (select .cse72 .cse76)) (.cse71 (select .cse73 .cse76))) (or (not (= (select |c_#valid| .cse69) 1)) (= (select (select .cse70 .cse69) .cse71) 0) (= (select (select .cse70 (select .cse72 .cse3)) (select .cse73 .cse3)) 0) (= (select |c_#valid| (select (select .cse74 |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 .cse74 .cse69) .cse71)) 1) (< .cse71 0) (< (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse75) v_arrayElimCell_47) .cse3) 0))))))))) (and (or .cse55 .cse0) (or .cse56 .cse1) (or .cse57 .cse0) (or .cse56 .cse0) (or .cse0 .cse58) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 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_~new_head~0#1.base|))) (let ((.cse60 (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))) (.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_~new_head~0#1.offset|))) (let ((.cse65 (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_47)) (.cse64 (select .cse60 v_arrayElimCell_47)) (.cse67 (+ 4 v_arrayElimCell_48))) (let ((.cse62 (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse68)) (.cse59 (select .cse64 .cse67)) (.cse61 (select .cse65 .cse67)) (.cse63 (select (select (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| .cse66) v_arrayElimCell_47) .cse3))) (or (not (= (select |c_#valid| .cse59) 1)) (= (select (select .cse60 .cse59) .cse61) 0) (= (select |c_#valid| (select (select .cse62 (select (select .cse62 v_arrayElimCell_47) .cse3)) .cse63)) 1) (= (select (select .cse60 (select .cse64 .cse3)) (select .cse65 .cse3)) 0) (= (select |c_#valid| (select (select .cse62 |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 .cse62 .cse59) .cse61)) 1) (< .cse61 0) (= (select (select .cse60 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|) 0) (< .cse63 0))))))) (or .cse1 .cse58) (or .cse55 .cse1) (or .cse57 .cse1)))) (or .cse7 .cse1)))) (< |c_ULTIMATE.start_sll_append_~head#1.offset| 0))) is different from true