./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB --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 a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:52:55,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:52:55,347 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 02:52:55,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:52:55,354 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:52:55,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:52:55,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:52:55,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:52:55,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:52:55,388 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:52:55,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:52:55,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:52:55,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:52:55,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:52:55,389 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:52:55,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:52:55,389 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:52:55,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:52:55,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:52:55,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:52:55,390 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 02:52:55,390 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 02:52:55,390 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 02:52:55,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:52:55,391 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:52:55,391 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 02:52:55,391 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:52:55,391 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:52:55,391 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:52:55,391 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:52:55,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:52:55,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:52:55,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:52:55,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:52:55,392 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:52:55,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:52:55,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:52:55,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:52:55,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:52:55,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:52:55,393 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:52:55,394 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:52:55,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:52:55,394 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:52:55,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:52:55,394 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:52:55,394 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:52:55,395 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_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB 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 -> a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 [2024-11-28 02:52:55,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:52:55,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:52:55,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:52:55,763 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:52:55,763 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:52:55,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2024-11-28 02:52:59,632 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/data/89ad7ba44/ba70c7300baf47768782b6d5791f85b2/FLAGd740c8451 [2024-11-28 02:53:00,107 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:53:00,108 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2024-11-28 02:53:00,136 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/data/89ad7ba44/ba70c7300baf47768782b6d5791f85b2/FLAGd740c8451 [2024-11-28 02:53:00,163 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/data/89ad7ba44/ba70c7300baf47768782b6d5791f85b2 [2024-11-28 02:53:00,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:53:00,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:53:00,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:53:00,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:53:00,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:53:00,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:53:00" (1/1) ... [2024-11-28 02:53:00,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386efbad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:00, skipping insertion in model container [2024-11-28 02:53:00,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:53:00" (1/1) ... [2024-11-28 02:53:00,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:53:00,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:53:00,811 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:53:00,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:53:00,960 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:53:00,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:00 WrapperNode [2024-11-28 02:53:00,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:53:00,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:53:00,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:53:00,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:53:00,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:00" (1/1) ... [2024-11-28 02:53:01,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:00" (1/1) ... [2024-11-28 02:53:01,047 INFO L138 Inliner]: procedures = 127, calls = 41, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 127 [2024-11-28 02:53:01,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:53:01,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:53:01,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:53:01,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:53:01,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:00" (1/1) ... [2024-11-28 02:53:01,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:00" (1/1) ... [2024-11-28 02:53:01,074 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:00" (1/1) ... [2024-11-28 02:53:01,108 INFO L175 MemorySlicer]: Split 23 memory accesses to 3 slices as follows [2, 7, 14]. 61 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2024-11-28 02:53:01,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:00" (1/1) ... [2024-11-28 02:53:01,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:00" (1/1) ... [2024-11-28 02:53:01,121 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:00" (1/1) ... [2024-11-28 02:53:01,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:00" (1/1) ... [2024-11-28 02:53:01,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:00" (1/1) ... [2024-11-28 02:53:01,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:00" (1/1) ... [2024-11-28 02:53:01,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:00" (1/1) ... [2024-11-28 02:53:01,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:53:01,139 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:53:01,139 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:53:01,139 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:53:01,140 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:00" (1/1) ... [2024-11-28 02:53:01,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:53:01,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:53:01,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:53:01,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:53:01,243 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-28 02:53:01,243 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-28 02:53:01,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 02:53:01,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 02:53:01,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 02:53:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 02:53:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 02:53:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 02:53:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 02:53:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:53:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 02:53:01,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 02:53:01,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 02:53:01,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 02:53:01,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 02:53:01,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 02:53:01,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 02:53:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 02:53:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-28 02:53:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-28 02:53:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-28 02:53:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:53:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 02:53:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 02:53:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:53:01,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:53:01,426 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:53:01,429 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:53:01,465 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-28 02:53:02,001 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-11-28 02:53:02,001 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:53:02,026 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:53:02,026 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-28 02:53:02,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:53:02 BoogieIcfgContainer [2024-11-28 02:53:02,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:53:02,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:53:02,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:53:02,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:53:02,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:53:00" (1/3) ... [2024-11-28 02:53:02,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9e153ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:53:02, skipping insertion in model container [2024-11-28 02:53:02,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:00" (2/3) ... [2024-11-28 02:53:02,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9e153ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:53:02, skipping insertion in model container [2024-11-28 02:53:02,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:53:02" (3/3) ... [2024-11-28 02:53:02,046 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_unequal.i [2024-11-28 02:53:02,069 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:53:02,072 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_prepend_unequal.i that has 2 procedures, 107 locations, 1 initial locations, 3 loop locations, and 45 error locations. [2024-11-28 02:53:02,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:53:02,161 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;@26e0608e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:53:02,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2024-11-28 02:53:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 58 states have (on average 2.0172413793103448) internal successors, (117), 104 states have internal predecessors, (117), 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-28 02:53:02,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:53:02,178 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:02,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:53:02,179 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:02,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:02,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1037518442, now seen corresponding path program 1 times [2024-11-28 02:53:02,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:02,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139162459] [2024-11-28 02:53:02,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:02,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:02,446 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-28 02:53:02,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:02,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139162459] [2024-11-28 02:53:02,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139162459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:02,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:02,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:53:02,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852780273] [2024-11-28 02:53:02,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:02,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:53:02,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:02,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:53:02,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:53:02,488 INFO L87 Difference]: Start difference. First operand has 106 states, 58 states have (on average 2.0172413793103448) internal successors, (117), 104 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:02,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:02,647 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2024-11-28 02:53:02,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:53:02,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 02:53:02,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:02,656 INFO L225 Difference]: With dead ends: 102 [2024-11-28 02:53:02,657 INFO L226 Difference]: Without dead ends: 96 [2024-11-28 02:53:02,658 INFO L434 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-28 02:53:02,662 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 9 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:02,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 153 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:53:02,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-28 02:53:02,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-28 02:53:02,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 95 states have internal predecessors, (102), 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-28 02:53:02,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2024-11-28 02:53:02,755 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 6 [2024-11-28 02:53:02,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:02,756 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2024-11-28 02:53:02,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2024-11-28 02:53:02,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:53:02,758 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:02,759 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:53:02,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:53:02,761 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:02,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:02,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1037518443, now seen corresponding path program 1 times [2024-11-28 02:53:02,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:02,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413988548] [2024-11-28 02:53:02,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:02,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:02,938 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-28 02:53:02,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:02,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413988548] [2024-11-28 02:53:02,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413988548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:02,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:02,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:53:02,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949094020] [2024-11-28 02:53:02,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:02,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:53:02,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:02,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:53:02,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:53:02,941 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:03,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:03,064 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2024-11-28 02:53:03,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:53:03,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 02:53:03,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:03,070 INFO L225 Difference]: With dead ends: 93 [2024-11-28 02:53:03,070 INFO L226 Difference]: Without dead ends: 93 [2024-11-28 02:53:03,070 INFO L434 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-28 02:53:03,071 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:03,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 145 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:53:03,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-28 02:53:03,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-28 02:53:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 92 states have internal predecessors, (99), 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-28 02:53:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2024-11-28 02:53:03,087 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 6 [2024-11-28 02:53:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:03,087 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2024-11-28 02:53:03,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:03,089 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2024-11-28 02:53:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-28 02:53:03,089 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:03,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:03,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:53:03,090 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:03,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:03,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2101067345, now seen corresponding path program 1 times [2024-11-28 02:53:03,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:03,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111469789] [2024-11-28 02:53:03,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:03,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:03,229 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-28 02:53:03,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:03,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111469789] [2024-11-28 02:53:03,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111469789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:03,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:03,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:53:03,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595300185] [2024-11-28 02:53:03,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:03,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:53:03,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:03,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:53:03,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:53:03,233 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-28 02:53:03,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:03,265 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2024-11-28 02:53:03,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:53:03,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-11-28 02:53:03,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:03,267 INFO L225 Difference]: With dead ends: 104 [2024-11-28 02:53:03,267 INFO L226 Difference]: Without dead ends: 104 [2024-11-28 02:53:03,271 INFO L434 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-28 02:53:03,272 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 11 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:03,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 191 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:53:03,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-28 02:53:03,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2024-11-28 02:53:03,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 93 states have internal predecessors, (100), 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-28 02:53:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2024-11-28 02:53:03,286 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 7 [2024-11-28 02:53:03,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:03,286 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2024-11-28 02:53:03,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-28 02:53:03,286 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2024-11-28 02:53:03,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 02:53:03,287 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:03,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:03,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:53:03,291 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:03,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:03,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1519983918, now seen corresponding path program 1 times [2024-11-28 02:53:03,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:03,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493640894] [2024-11-28 02:53:03,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:03,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:03,422 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-28 02:53:03,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:03,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493640894] [2024-11-28 02:53:03,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493640894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:03,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:03,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:53:03,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433746821] [2024-11-28 02:53:03,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:03,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:53:03,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:03,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:53:03,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:53:03,427 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:03,463 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2024-11-28 02:53:03,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:53:03,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-28 02:53:03,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:03,471 INFO L225 Difference]: With dead ends: 100 [2024-11-28 02:53:03,471 INFO L226 Difference]: Without dead ends: 100 [2024-11-28 02:53:03,471 INFO L434 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-28 02:53:03,472 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:03,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 186 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:53:03,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-28 02:53:03,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-28 02:53:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 61 states have (on average 1.7377049180327868) internal successors, (106), 99 states have internal predecessors, (106), 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-28 02:53:03,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2024-11-28 02:53:03,491 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 10 [2024-11-28 02:53:03,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:03,491 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2024-11-28 02:53:03,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:03,491 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2024-11-28 02:53:03,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-28 02:53:03,492 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:03,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:03,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:53:03,492 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:03,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:03,493 INFO L85 PathProgramCache]: Analyzing trace with hash 973131718, now seen corresponding path program 1 times [2024-11-28 02:53:03,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:03,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907168619] [2024-11-28 02:53:03,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:03,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:03,670 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-28 02:53:03,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:03,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907168619] [2024-11-28 02:53:03,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907168619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:53:03,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069078684] [2024-11-28 02:53:03,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:03,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:53:03,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:53:03,676 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:53:03,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:53:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:03,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 02:53:03,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:53:03,934 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-28 02:53:03,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:53:03,996 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-28 02:53:03,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069078684] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:53:03,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:53:03,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-28 02:53:03,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387805598] [2024-11-28 02:53:03,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:53:04,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:53:04,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:04,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:53:04,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:53:04,005 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:04,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:04,044 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2024-11-28 02:53:04,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:53:04,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-28 02:53:04,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:04,046 INFO L225 Difference]: With dead ends: 102 [2024-11-28 02:53:04,046 INFO L226 Difference]: Without dead ends: 102 [2024-11-28 02:53:04,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:53:04,048 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 11 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:04,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 275 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:53:04,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-28 02:53:04,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-28 02:53:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 101 states have internal predecessors, (108), 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-28 02:53:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2024-11-28 02:53:04,063 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 15 [2024-11-28 02:53:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:04,066 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2024-11-28 02:53:04,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:04,066 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2024-11-28 02:53:04,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-28 02:53:04,067 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:04,067 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:04,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 02:53:04,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:53:04,268 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:04,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:04,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1281123431, now seen corresponding path program 1 times [2024-11-28 02:53:04,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:04,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937415412] [2024-11-28 02:53:04,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:04,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:04,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:04,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937415412] [2024-11-28 02:53:04,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937415412] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:53:04,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276416610] [2024-11-28 02:53:04,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:04,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:53:04,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:53:04,634 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:53:04,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:53:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:04,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 02:53:04,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:53:04,825 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-28 02:53:04,884 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 02:53:04,885 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-28 02:53:04,934 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:04,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:53:05,004 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:05,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276416610] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:53:05,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:53:05,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-28 02:53:05,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217033163] [2024-11-28 02:53:05,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:53:05,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:53:05,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:05,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:53:05,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:53:05,008 INFO L87 Difference]: Start difference. First operand 102 states and 108 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-28 02:53:05,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:05,212 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2024-11-28 02:53:05,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:53:05,212 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 18 [2024-11-28 02:53:05,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:05,213 INFO L225 Difference]: With dead ends: 101 [2024-11-28 02:53:05,213 INFO L226 Difference]: Without dead ends: 101 [2024-11-28 02:53:05,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:53:05,214 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:05,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 186 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:53:05,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-28 02:53:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-28 02:53:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 63 states have (on average 1.6984126984126984) internal successors, (107), 100 states have internal predecessors, (107), 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-28 02:53:05,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2024-11-28 02:53:05,225 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 18 [2024-11-28 02:53:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:05,225 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2024-11-28 02:53:05,226 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-28 02:53:05,226 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2024-11-28 02:53:05,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-28 02:53:05,226 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:05,226 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:05,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 02:53:05,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:53:05,427 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:05,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:05,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1281123430, now seen corresponding path program 1 times [2024-11-28 02:53:05,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:05,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637656472] [2024-11-28 02:53:05,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:05,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:05,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:05,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637656472] [2024-11-28 02:53:05,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637656472] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:53:05,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435946618] [2024-11-28 02:53:05,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:05,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:53:05,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:53:05,759 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:53:05,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:53:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:05,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-28 02:53:05,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:53:05,969 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-28 02:53:05,974 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-28 02:53:06,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:53:06,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 02:53:06,122 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:53:06,123 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-28 02:53:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:06,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:53:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:06,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435946618] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:53:06,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:53:06,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-28 02:53:06,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577876355] [2024-11-28 02:53:06,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:53:06,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 02:53:06,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:06,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 02:53:06,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-28 02:53:06,656 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 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-28 02:53:07,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:07,031 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2024-11-28 02:53:07,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:53:07,032 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 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 18 [2024-11-28 02:53:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:07,033 INFO L225 Difference]: With dead ends: 100 [2024-11-28 02:53:07,033 INFO L226 Difference]: Without dead ends: 100 [2024-11-28 02:53:07,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:53:07,034 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 13 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:07,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 340 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:53:07,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-28 02:53:07,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-28 02:53:07,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 99 states have internal predecessors, (106), 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-28 02:53:07,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2024-11-28 02:53:07,041 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 18 [2024-11-28 02:53:07,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:07,041 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2024-11-28 02:53:07,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 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-28 02:53:07,041 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2024-11-28 02:53:07,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-28 02:53:07,042 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:07,042 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:07,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 02:53:07,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:53:07,243 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:07,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:07,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1335124933, now seen corresponding path program 2 times [2024-11-28 02:53:07,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:07,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313814991] [2024-11-28 02:53:07,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:53:07,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:07,266 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 02:53:07,266 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:53:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 02:53:07,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:07,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313814991] [2024-11-28 02:53:07,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313814991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:07,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:07,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:53:07,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065948877] [2024-11-28 02:53:07,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:07,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:53:07,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:07,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:53:07,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:53:07,296 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-28 02:53:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:07,390 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2024-11-28 02:53:07,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:53:07,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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 23 [2024-11-28 02:53:07,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:07,391 INFO L225 Difference]: With dead ends: 97 [2024-11-28 02:53:07,391 INFO L226 Difference]: Without dead ends: 97 [2024-11-28 02:53:07,391 INFO L434 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-28 02:53:07,392 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:07,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 133 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:53:07,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-28 02:53:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-28 02:53:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 63 states have (on average 1.6349206349206349) internal successors, (103), 96 states have internal predecessors, (103), 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-28 02:53:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2024-11-28 02:53:07,398 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 23 [2024-11-28 02:53:07,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:07,398 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2024-11-28 02:53:07,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-28 02:53:07,398 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2024-11-28 02:53:07,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-28 02:53:07,398 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:07,399 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:07,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:53:07,399 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:07,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:07,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1335124932, now seen corresponding path program 1 times [2024-11-28 02:53:07,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:07,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318942909] [2024-11-28 02:53:07,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:07,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:07,511 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:07,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:07,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318942909] [2024-11-28 02:53:07,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318942909] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:53:07,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236192121] [2024-11-28 02:53:07,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:07,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:53:07,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:53:07,514 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:53:07,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:53:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:07,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 02:53:07,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:53:07,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:07,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:53:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:07,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236192121] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:53:07,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:53:07,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-28 02:53:07,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705194704] [2024-11-28 02:53:07,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:53:07,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:53:07,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:07,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:53:07,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:53:07,741 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-28 02:53:07,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:07,791 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2024-11-28 02:53:07,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:53:07,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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 23 [2024-11-28 02:53:07,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:07,793 INFO L225 Difference]: With dead ends: 97 [2024-11-28 02:53:07,793 INFO L226 Difference]: Without dead ends: 97 [2024-11-28 02:53:07,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-28 02:53:07,794 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 4 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:07,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 253 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:53:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-28 02:53:07,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-28 02:53:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 63 states have (on average 1.619047619047619) internal successors, (102), 96 states have internal predecessors, (102), 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-28 02:53:07,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2024-11-28 02:53:07,800 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 23 [2024-11-28 02:53:07,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:07,800 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2024-11-28 02:53:07,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-28 02:53:07,800 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2024-11-28 02:53:07,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 02:53:07,801 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:07,801 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:07,813 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 02:53:08,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:53:08,002 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:08,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:08,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1178626338, now seen corresponding path program 1 times [2024-11-28 02:53:08,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:08,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459394547] [2024-11-28 02:53:08,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:08,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 02:53:08,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:08,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459394547] [2024-11-28 02:53:08,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459394547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:08,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:08,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:53:08,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771371739] [2024-11-28 02:53:08,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:08,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:53:08,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:08,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:53:08,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:53:08,198 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:08,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:08,289 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2024-11-28 02:53:08,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:53:08,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-28 02:53:08,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:08,291 INFO L225 Difference]: With dead ends: 94 [2024-11-28 02:53:08,291 INFO L226 Difference]: Without dead ends: 94 [2024-11-28 02:53:08,291 INFO L434 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-28 02:53:08,292 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:08,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 137 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:53:08,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-28 02:53:08,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-28 02:53:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 63 states have (on average 1.5714285714285714) internal successors, (99), 93 states have internal predecessors, (99), 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-28 02:53:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2024-11-28 02:53:08,296 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 24 [2024-11-28 02:53:08,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:08,297 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2024-11-28 02:53:08,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2024-11-28 02:53:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 02:53:08,298 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:08,298 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:08,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:53:08,298 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:08,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:08,299 INFO L85 PathProgramCache]: Analyzing trace with hash 144666817, now seen corresponding path program 1 times [2024-11-28 02:53:08,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:08,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093968569] [2024-11-28 02:53:08,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:08,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:53:08,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:08,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093968569] [2024-11-28 02:53:08,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093968569] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:53:08,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316322438] [2024-11-28 02:53:08,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:08,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:53:08,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:53:08,859 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:53:08,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 02:53:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:09,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 02:53:09,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:53:09,100 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-28 02:53:09,134 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 02:53:09,135 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-28 02:53:09,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:53:09,276 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 16 treesize of output 18 [2024-11-28 02:53:09,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:53:09,517 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-11-28 02:53:09,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 22 [2024-11-28 02:53:09,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:09,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:53:17,991 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_575 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| Int)) (let ((.cse0 (store (store |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| v_ArrVal_575) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_33| 1))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.base_33| 1)) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= (select .cse0 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34|) 1))))) is different from false [2024-11-28 02:53:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-28 02:53:18,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316322438] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:53:18,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:53:18,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-28 02:53:18,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309047234] [2024-11-28 02:53:18,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:53:18,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 02:53:18,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:18,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 02:53:18,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=177, Unknown=2, NotChecked=28, Total=272 [2024-11-28 02:53:18,028 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 17 states, 16 states have (on average 4.6875) internal successors, (75), 17 states have internal predecessors, (75), 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-28 02:53:18,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:18,490 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2024-11-28 02:53:18,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:53:18,491 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.6875) internal successors, (75), 17 states have internal predecessors, (75), 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-28 02:53:18,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:18,492 INFO L225 Difference]: With dead ends: 100 [2024-11-28 02:53:18,492 INFO L226 Difference]: Without dead ends: 100 [2024-11-28 02:53:18,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=105, Invalid=239, Unknown=2, NotChecked=34, Total=380 [2024-11-28 02:53:18,494 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 372 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:18,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 231 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 244 Invalid, 0 Unknown, 92 Unchecked, 0.3s Time] [2024-11-28 02:53:18,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-28 02:53:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2024-11-28 02:53:18,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 87 states have internal predecessors, (93), 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-28 02:53:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-11-28 02:53:18,502 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 29 [2024-11-28 02:53:18,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:18,502 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-11-28 02:53:18,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.6875) internal successors, (75), 17 states have internal predecessors, (75), 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-28 02:53:18,502 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-11-28 02:53:18,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 02:53:18,503 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:18,503 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:18,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 02:53:18,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-28 02:53:18,704 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:18,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:18,705 INFO L85 PathProgramCache]: Analyzing trace with hash 144666818, now seen corresponding path program 1 times [2024-11-28 02:53:18,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:18,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983508210] [2024-11-28 02:53:18,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:18,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:19,417 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:19,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:19,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983508210] [2024-11-28 02:53:19,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983508210] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:53:19,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143218053] [2024-11-28 02:53:19,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:19,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:53:19,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:53:19,420 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:53:19,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 02:53:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:19,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-28 02:53:19,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:53:19,625 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-28 02:53:19,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:53:19,665 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-28 02:53:19,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:53:19,748 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-28 02:53:19,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:53:19,859 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-28 02:53:19,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 02:53:19,918 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:53:19,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143218053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:19,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:53:19,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-28 02:53:19,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699426662] [2024-11-28 02:53:19,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:19,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:53:19,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:19,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:53:19,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-28 02:53:19,921 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-28 02:53:20,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:20,070 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2024-11-28 02:53:20,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:53:20,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-28 02:53:20,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:20,072 INFO L225 Difference]: With dead ends: 82 [2024-11-28 02:53:20,072 INFO L226 Difference]: Without dead ends: 82 [2024-11-28 02:53:20,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:53:20,073 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 61 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:20,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 100 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:53:20,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-28 02:53:20,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-28 02:53:20,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.380952380952381) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2024-11-28 02:53:20,077 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 29 [2024-11-28 02:53:20,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:20,079 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2024-11-28 02:53:20,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-28 02:53:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2024-11-28 02:53:20,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 02:53:20,080 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:20,080 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:20,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 02:53:20,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-28 02:53:20,281 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:20,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:20,281 INFO L85 PathProgramCache]: Analyzing trace with hash 189704073, now seen corresponding path program 1 times [2024-11-28 02:53:20,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:20,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499837836] [2024-11-28 02:53:20,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:20,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 02:53:20,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:20,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499837836] [2024-11-28 02:53:20,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499837836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:20,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:20,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:53:20,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394915552] [2024-11-28 02:53:20,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:20,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:53:20,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:20,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:53:20,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:53:20,422 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:20,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:20,584 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2024-11-28 02:53:20,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:53:20,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-28 02:53:20,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:20,585 INFO L225 Difference]: With dead ends: 81 [2024-11-28 02:53:20,585 INFO L226 Difference]: Without dead ends: 81 [2024-11-28 02:53:20,586 INFO L434 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-28 02:53:20,586 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 11 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:20,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 178 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:53:20,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-28 02:53:20,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-28 02:53:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 80 states have internal predecessors, (86), 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-28 02:53:20,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2024-11-28 02:53:20,591 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 30 [2024-11-28 02:53:20,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:20,592 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2024-11-28 02:53:20,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:20,592 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2024-11-28 02:53:20,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 02:53:20,595 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:20,595 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:20,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 02:53:20,595 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:20,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:20,596 INFO L85 PathProgramCache]: Analyzing trace with hash 189704074, now seen corresponding path program 1 times [2024-11-28 02:53:20,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:20,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023232363] [2024-11-28 02:53:20,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:20,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:20,859 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 02:53:20,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:20,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023232363] [2024-11-28 02:53:20,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023232363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:20,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:20,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:53:20,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227384532] [2024-11-28 02:53:20,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:20,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:53:20,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:20,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:53:20,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:53:20,863 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:21,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:21,016 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2024-11-28 02:53:21,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:53:21,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-28 02:53:21,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:21,018 INFO L225 Difference]: With dead ends: 80 [2024-11-28 02:53:21,018 INFO L226 Difference]: Without dead ends: 80 [2024-11-28 02:53:21,018 INFO L434 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-28 02:53:21,019 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 10 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:21,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 190 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:53:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-28 02:53:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-28 02:53:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 79 states have internal predecessors, (85), 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-28 02:53:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2024-11-28 02:53:21,025 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 30 [2024-11-28 02:53:21,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:21,026 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2024-11-28 02:53:21,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2024-11-28 02:53:21,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 02:53:21,027 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:21,028 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:21,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 02:53:21,030 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:21,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:21,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1155959092, now seen corresponding path program 1 times [2024-11-28 02:53:21,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:21,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9402236] [2024-11-28 02:53:21,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:21,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:53:21,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:21,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9402236] [2024-11-28 02:53:21,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9402236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:21,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:21,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:53:21,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068793663] [2024-11-28 02:53:21,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:21,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 02:53:21,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:21,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 02:53:21,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:53:21,461 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:21,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:21,762 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2024-11-28 02:53:21,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:53:21,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-28 02:53:21,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:21,764 INFO L225 Difference]: With dead ends: 79 [2024-11-28 02:53:21,764 INFO L226 Difference]: Without dead ends: 79 [2024-11-28 02:53:21,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-28 02:53:21,765 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 18 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:21,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 239 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:53:21,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-28 02:53:21,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-28 02:53:21,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 78 states have internal predecessors, (84), 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-28 02:53:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2024-11-28 02:53:21,769 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 35 [2024-11-28 02:53:21,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:21,770 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2024-11-28 02:53:21,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:21,770 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2024-11-28 02:53:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 02:53:21,771 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:21,771 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:21,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 02:53:21,772 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:21,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1155959091, now seen corresponding path program 1 times [2024-11-28 02:53:21,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:21,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843137496] [2024-11-28 02:53:21,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:21,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:53:22,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:22,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843137496] [2024-11-28 02:53:22,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843137496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:22,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:22,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:53:22,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084810967] [2024-11-28 02:53:22,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:22,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:53:22,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:22,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:53:22,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:53:22,392 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:22,693 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-11-28 02:53:22,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:53:22,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-28 02:53:22,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:22,694 INFO L225 Difference]: With dead ends: 78 [2024-11-28 02:53:22,694 INFO L226 Difference]: Without dead ends: 78 [2024-11-28 02:53:22,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:53:22,695 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 11 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:22,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 259 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:53:22,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-28 02:53:22,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-28 02:53:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 77 states have internal predecessors, (83), 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-28 02:53:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-11-28 02:53:22,699 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 35 [2024-11-28 02:53:22,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:22,699 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-11-28 02:53:22,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:22,699 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-11-28 02:53:22,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-28 02:53:22,700 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:22,700 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:22,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 02:53:22,701 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:22,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:22,701 INFO L85 PathProgramCache]: Analyzing trace with hash 137761454, now seen corresponding path program 1 times [2024-11-28 02:53:22,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:22,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738860471] [2024-11-28 02:53:22,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:22,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:53:22,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:22,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738860471] [2024-11-28 02:53:22,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738860471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:22,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:22,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:53:22,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489800897] [2024-11-28 02:53:22,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:22,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:53:22,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:22,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:53:22,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:53:22,967 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-28 02:53:23,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:23,127 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-11-28 02:53:23,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:53:23,127 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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 38 [2024-11-28 02:53:23,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:23,128 INFO L225 Difference]: With dead ends: 78 [2024-11-28 02:53:23,128 INFO L226 Difference]: Without dead ends: 78 [2024-11-28 02:53:23,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:53:23,129 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 13 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:23,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 342 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:53:23,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-28 02:53:23,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-28 02:53:23,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 77 states have internal predecessors, (82), 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-28 02:53:23,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-28 02:53:23,133 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 38 [2024-11-28 02:53:23,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:23,133 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-28 02:53:23,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-28 02:53:23,134 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-28 02:53:23,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 02:53:23,134 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:23,134 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:23,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 02:53:23,135 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:23,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:23,135 INFO L85 PathProgramCache]: Analyzing trace with hash -241043502, now seen corresponding path program 1 times [2024-11-28 02:53:23,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:23,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921936832] [2024-11-28 02:53:23,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:23,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:23,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 02:53:23,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:23,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921936832] [2024-11-28 02:53:23,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921936832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:23,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:23,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 02:53:23,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679548329] [2024-11-28 02:53:23,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:23,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 02:53:23,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:23,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 02:53:23,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:53:23,501 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:23,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:23,783 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2024-11-28 02:53:23,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:53:23,783 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-28 02:53:23,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:23,784 INFO L225 Difference]: With dead ends: 79 [2024-11-28 02:53:23,784 INFO L226 Difference]: Without dead ends: 79 [2024-11-28 02:53:23,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:53:23,785 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 35 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:23,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 204 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:53:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-28 02:53:23,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2024-11-28 02:53:23,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 63 states have (on average 1.253968253968254) internal successors, (79), 74 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:23,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2024-11-28 02:53:23,788 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 41 [2024-11-28 02:53:23,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:23,789 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2024-11-28 02:53:23,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:23,789 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2024-11-28 02:53:23,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 02:53:23,790 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:23,790 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:23,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 02:53:23,791 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:23,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:23,791 INFO L85 PathProgramCache]: Analyzing trace with hash -241043501, now seen corresponding path program 1 times [2024-11-28 02:53:23,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:23,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320712728] [2024-11-28 02:53:23,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:23,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:24,410 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 02:53:24,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:24,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320712728] [2024-11-28 02:53:24,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320712728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:24,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:24,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:53:24,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691205087] [2024-11-28 02:53:24,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:24,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 02:53:24,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:24,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 02:53:24,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:53:24,413 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:24,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:24,725 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2024-11-28 02:53:24,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:53:24,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-28 02:53:24,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:24,726 INFO L225 Difference]: With dead ends: 77 [2024-11-28 02:53:24,726 INFO L226 Difference]: Without dead ends: 77 [2024-11-28 02:53:24,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-28 02:53:24,727 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 31 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:24,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 244 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:53:24,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-28 02:53:24,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2024-11-28 02:53:24,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 72 states have internal predecessors, (77), 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-28 02:53:24,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2024-11-28 02:53:24,734 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 41 [2024-11-28 02:53:24,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:24,734 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2024-11-28 02:53:24,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:24,734 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2024-11-28 02:53:24,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-28 02:53:24,735 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:24,735 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:24,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 02:53:24,735 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:24,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:24,736 INFO L85 PathProgramCache]: Analyzing trace with hash -578655566, now seen corresponding path program 1 times [2024-11-28 02:53:24,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:24,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363162547] [2024-11-28 02:53:24,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:24,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 02:53:25,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:25,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363162547] [2024-11-28 02:53:25,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363162547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:25,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:25,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 02:53:25,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413457222] [2024-11-28 02:53:25,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:25,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:53:25,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:25,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:53:25,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:53:25,845 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:26,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:26,421 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2024-11-28 02:53:26,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:53:26,421 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-28 02:53:26,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:26,422 INFO L225 Difference]: With dead ends: 73 [2024-11-28 02:53:26,422 INFO L226 Difference]: Without dead ends: 73 [2024-11-28 02:53:26,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2024-11-28 02:53:26,423 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:26,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 479 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 02:53:26,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-28 02:53:26,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-28 02:53:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 72 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-28 02:53:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2024-11-28 02:53:26,426 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 45 [2024-11-28 02:53:26,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:26,426 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2024-11-28 02:53:26,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-11-28 02:53:26,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-28 02:53:26,428 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:26,428 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:26,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 02:53:26,428 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:26,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:26,429 INFO L85 PathProgramCache]: Analyzing trace with hash -758485789, now seen corresponding path program 1 times [2024-11-28 02:53:26,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:26,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002398824] [2024-11-28 02:53:26,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:26,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 02:53:27,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:27,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002398824] [2024-11-28 02:53:27,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002398824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:27,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:27,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 02:53:27,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563747534] [2024-11-28 02:53:27,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:27,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 02:53:27,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:27,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 02:53:27,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:53:27,693 INFO L87 Difference]: Start difference. First operand 73 states and 76 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-28 02:53:28,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:28,616 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2024-11-28 02:53:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 02:53:28,616 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 46 [2024-11-28 02:53:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:28,617 INFO L225 Difference]: With dead ends: 75 [2024-11-28 02:53:28,617 INFO L226 Difference]: Without dead ends: 75 [2024-11-28 02:53:28,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2024-11-28 02:53:28,619 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 41 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:28,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 373 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 02:53:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-28 02:53:28,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-28 02:53:28,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 74 states have internal predecessors, (80), 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-28 02:53:28,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2024-11-28 02:53:28,628 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 46 [2024-11-28 02:53:28,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:28,629 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2024-11-28 02:53:28,629 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-28 02:53:28,629 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2024-11-28 02:53:28,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-28 02:53:28,629 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:28,630 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:28,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 02:53:28,630 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:28,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:28,630 INFO L85 PathProgramCache]: Analyzing trace with hash -758485788, now seen corresponding path program 1 times [2024-11-28 02:53:28,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:28,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897675421] [2024-11-28 02:53:28,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:28,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:53:30,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:30,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897675421] [2024-11-28 02:53:30,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897675421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:30,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:30,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 02:53:30,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932623992] [2024-11-28 02:53:30,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:30,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:53:30,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:30,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:53:30,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2024-11-28 02:53:30,453 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 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-28 02:53:31,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:31,509 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2024-11-28 02:53:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 02:53:31,511 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 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 46 [2024-11-28 02:53:31,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:31,512 INFO L225 Difference]: With dead ends: 77 [2024-11-28 02:53:31,512 INFO L226 Difference]: Without dead ends: 77 [2024-11-28 02:53:31,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2024-11-28 02:53:31,515 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 46 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:31,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 415 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 02:53:31,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-28 02:53:31,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-28 02:53:31,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 67 states have (on average 1.208955223880597) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:31,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2024-11-28 02:53:31,519 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 46 [2024-11-28 02:53:31,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:31,520 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2024-11-28 02:53:31,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 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-28 02:53:31,520 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2024-11-28 02:53:31,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-28 02:53:31,520 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:31,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:31,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 02:53:31,521 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:31,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:31,521 INFO L85 PathProgramCache]: Analyzing trace with hash -224703174, now seen corresponding path program 1 times [2024-11-28 02:53:31,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:31,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486083953] [2024-11-28 02:53:31,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:31,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:32,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:53:32,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:32,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486083953] [2024-11-28 02:53:32,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486083953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:32,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:32,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 02:53:32,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267404771] [2024-11-28 02:53:32,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:32,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:53:32,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:32,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:53:32,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2024-11-28 02:53:32,744 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 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-28 02:53:33,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:33,540 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2024-11-28 02:53:33,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 02:53:33,541 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 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 49 [2024-11-28 02:53:33,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:33,542 INFO L225 Difference]: With dead ends: 77 [2024-11-28 02:53:33,542 INFO L226 Difference]: Without dead ends: 77 [2024-11-28 02:53:33,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2024-11-28 02:53:33,543 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 46 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:33,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 525 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:53:33,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-28 02:53:33,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-28 02:53:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 76 states have internal predecessors, (80), 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-28 02:53:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2024-11-28 02:53:33,547 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 49 [2024-11-28 02:53:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:33,547 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2024-11-28 02:53:33,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 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-28 02:53:33,548 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2024-11-28 02:53:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-28 02:53:33,548 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:33,548 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:33,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 02:53:33,549 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-28 02:53:33,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:33,550 INFO L85 PathProgramCache]: Analyzing trace with hash 798823207, now seen corresponding path program 1 times [2024-11-28 02:53:33,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:33,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998403724] [2024-11-28 02:53:33,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:33,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:36,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:36,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:36,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998403724] [2024-11-28 02:53:36,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998403724] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:53:36,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156406666] [2024-11-28 02:53:36,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:36,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:53:36,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:53:36,995 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:53:36,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ac54a-2ee4-4f89-bbe4-b29aa28fd72d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 02:53:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:37,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-28 02:53:37,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:53:37,315 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-28 02:53:37,480 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:53:37,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 02:53:37,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:53:37,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 02:53:37,780 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 02:53:37,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-28 02:53:38,072 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-11-28 02:53:38,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 36 treesize of output 52 [2024-11-28 02:53:38,259 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 50 treesize of output 33 [2024-11-28 02:53:38,321 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 50 treesize of output 33 [2024-11-28 02:53:38,362 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 50 treesize of output 33 [2024-11-28 02:53:38,854 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 59 treesize of output 42 [2024-11-28 02:53:38,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:53:39,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:53:39,449 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:53:39,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:53:39,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 58 [2024-11-28 02:53:39,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:53:39,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2024-11-28 02:53:39,788 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:53:39,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 102 [2024-11-28 02:53:39,800 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:53:39,801 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:53:39,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 26 [2024-11-28 02:53:40,126 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:53:40,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2024-11-28 02:53:40,140 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 21 treesize of output 13 [2024-11-28 02:53:40,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2024-11-28 02:53:41,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:53:41,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:53:41,246 INFO L349 Elim1Store]: treesize reduction 43, result has 15.7 percent of original size [2024-11-28 02:53:41,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 43 [2024-11-28 02:53:42,054 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:42,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:53:43,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:53:43,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2024-11-28 02:53:43,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:53:43,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 103 [2024-11-28 02:53:43,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2024-11-28 02:54:02,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:54:02,998 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 102 [2024-11-28 02:54:03,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:54:03,042 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 102 [2024-11-28 02:54:03,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:54:03,106 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 102 [2024-11-28 02:54:03,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:54:03,174 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 102 [2024-11-28 02:54:13,223 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 467 treesize of output 413 [2024-11-28 02:54:13,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:54:13,276 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 717 treesize of output 641 [2024-11-28 02:54:13,302 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 541 treesize of output 513 [2024-11-28 02:54:13,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:54:13,354 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 904 treesize of output 884 [2024-11-28 02:54:18,646 INFO L349 Elim1Store]: treesize reduction 50, result has 33.3 percent of original size [2024-11-28 02:54:18,646 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 80 [2024-11-28 02:54:18,680 INFO L349 Elim1Store]: treesize reduction 20, result has 31.0 percent of original size [2024-11-28 02:54:18,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 60 treesize of output 52 [2024-11-28 02:54:18,711 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:54:18,723 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:54:18,825 INFO L349 Elim1Store]: treesize reduction 66, result has 33.3 percent of original size [2024-11-28 02:54:18,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 case distinctions, treesize of input 99 treesize of output 105 [2024-11-28 02:54:22,992 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse49 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 1)) (.cse43 (not (= .cse8 1))) (.cse7 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (and (or (< |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse0 (+ v_prenex_6 4))) (or (not (= (select v_arrayElimArr_3 .cse0) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| 1) (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (select .cse1 (select (select (store .cse1 |c_ULTIMATE.start_dll_create_#res#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse0))) (+ v_prenex_4 4))) 1) (< |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_4) (< v_prenex_5 |c_ULTIMATE.start_dll_create_#res#1.offset|) (< v_prenex_4 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_4 Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_4) (forall ((v_prenex_6 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (let ((.cse2 (+ v_prenex_6 4)) (.cse3 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| 1)) (.cse5 (store (select .cse4 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)) (.cse6 (+ v_prenex_4 4))) (or (not (= (select v_arrayElimArr_3 .cse2) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse3 (select (select .cse4 (select (select (store .cse4 |c_ULTIMATE.start_dll_create_#res#1.base| .cse5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse2)) .cse6)) 1) (= 1 (select .cse3 (select (select .cse4 (select .cse5 .cse7)) .cse6))))))) (< v_prenex_4 0))) (< v_prenex_5 |c_ULTIMATE.start_dll_create_#res#1.offset|))))) (or (not (= .cse8 0)) (let ((.cse9 (store |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base| 1))) (and (forall ((v_arrayElimArr_7 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4))) (or (= 1 (select .cse9 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_arrayElimArr_7) (select v_arrayElimArr_7 .cse7)) .cse10))) (= (select .cse9 (select v_arrayElimArr_7 .cse10)) 1) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| |c_ULTIMATE.start_dll_create_#res#1.offset|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 0) (not (= (select v_arrayElimArr_7 (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| 8)) |c_ULTIMATE.start_dll_create_#res#1.base|))))) (forall ((v_arrayElimCell_48 Int)) (= (select .cse9 v_arrayElimCell_48) 1))))))) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1776 Int)) (let ((.cse11 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_4 Int)) (or (forall ((v_prenex_6 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (let ((.cse14 (+ v_prenex_6 4)) (.cse13 (store (select .cse12 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)) (.cse15 (+ v_prenex_4 4))) (or (= (select .cse11 (select (select .cse12 (select (select (store .cse12 |c_ULTIMATE.start_dll_create_#res#1.base| .cse13) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse14)) .cse15)) 1) (not (= (select v_arrayElimArr_3 .cse14) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse11 (select (select .cse12 (select .cse13 .cse7)) .cse15)) 1))))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_4) (< v_prenex_4 0))) (< v_prenex_5 |c_ULTIMATE.start_dll_create_#res#1.offset|))) (not (= (select .cse11 |c_ULTIMATE.start_dll_create_#res#1.base|) 1))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (forall ((v_ArrVal_1776 Int)) (let ((.cse16 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3)) (.cse20 (+ v_prenex_6 4))) (let ((.cse18 (let ((.cse21 (select v_arrayElimArr_3 .cse20))) (store .cse17 .cse21 (store (select .cse17 .cse21) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)))) (.cse19 (+ v_prenex_4 4))) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_4) (= (select .cse16 (select (select .cse17 (select (select .cse18 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse7)) .cse19)) 1) (= (select .cse16 (select (select .cse17 (select (select .cse18 |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse20)) .cse19)) 1) (< v_prenex_5 |c_ULTIMATE.start_dll_create_#res#1.offset|) (< v_prenex_4 0))))) (not (= (select .cse16 |c_ULTIMATE.start_dll_create_#res#1.base|) 1))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1776 Int)) (let ((.cse22 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((v_prenex_7 Int) (v_arrayElimArr_4 (Array Int Int)) (v_prenex_8 Int) (v_prenex_9 Int)) (or (= (select .cse22 (select (let ((.cse23 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_4))) (let ((.cse24 (store (select .cse23 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store .cse23 |c_ULTIMATE.start_dll_create_#res#1.base| .cse24) (select .cse24 .cse7)))) (+ v_prenex_7 4))) 1) (= |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_9) (< v_prenex_8 |c_ULTIMATE.start_dll_create_#res#1.offset|) (not (= (select v_arrayElimArr_4 (+ v_prenex_9 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (< v_prenex_7 0))) (not (= (select .cse22 |c_ULTIMATE.start_dll_create_#res#1.base|) 1))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1776 Int)) (let ((.cse25 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((v_prenex_7 Int) (v_arrayElimArr_4 (Array Int Int)) (v_prenex_8 Int) (v_prenex_9 Int)) (or (= |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_9) (< v_prenex_8 |c_ULTIMATE.start_dll_create_#res#1.offset|) (= (select .cse25 (select (let ((.cse26 (let ((.cse27 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_4)) (.cse28 (select v_arrayElimArr_4 (+ v_prenex_9 4)))) (store .cse27 .cse28 (store (select .cse27 .cse28) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))))) (select .cse26 (select (select .cse26 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse7))) (+ v_prenex_7 4))) 1) (< v_prenex_7 0))) (not (= (select .cse25 |c_ULTIMATE.start_dll_create_#res#1.base|) 1))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1776 Int)) (let ((.cse29 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_4) (= (select .cse29 (select (let ((.cse30 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (select .cse30 (select (select (let ((.cse31 (select v_arrayElimArr_3 (+ v_prenex_6 4)))) (store .cse30 .cse31 (store (select .cse30 .cse31) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse7))) (+ v_prenex_4 4))) 1) (< v_prenex_5 |c_ULTIMATE.start_dll_create_#res#1.offset|) (< v_prenex_4 0))) (not (= (select .cse29 |c_ULTIMATE.start_dll_create_#res#1.base|) 1))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1776 Int)) (let ((.cse32 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 (+ v_prenex_6 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (< |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_4) (< v_prenex_5 |c_ULTIMATE.start_dll_create_#res#1.offset|) (= (select .cse32 (select (let ((.cse33 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (select .cse33 (select (store (select .cse33 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse7))) (+ v_prenex_4 4))) 1) (< v_prenex_4 0))) (not (= (select .cse32 |c_ULTIMATE.start_dll_create_#res#1.base|) 1))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1776 Int)) (let ((.cse34 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (or (not (= (select v_arrayElimArr_2 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| |c_ULTIMATE.start_dll_create_#res#1.offset|) (= (select .cse34 (select (let ((.cse35 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2))) (let ((.cse36 (store (select .cse35 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store .cse35 |c_ULTIMATE.start_dll_create_#res#1.base| .cse36) (select .cse36 .cse7)))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4))) 1) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 0))) (not (= (select .cse34 |c_ULTIMATE.start_dll_create_#res#1.base|) 1))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1776 Int)) (let ((.cse38 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| Int)) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse42 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2))) (let ((.cse40 (store (select .cse42 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (let ((.cse39 (store .cse42 |c_ULTIMATE.start_dll_create_#res#1.base| .cse40)) (.cse37 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) (.cse41 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4))) (or (not (= (select v_arrayElimArr_2 .cse37) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse38 (select (select .cse39 (select .cse40 .cse7)) .cse41)) 1) (= (select .cse38 (select (select .cse39 (select (select .cse39 |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse37)) .cse41)) 1)))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 0))) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| |c_ULTIMATE.start_dll_create_#res#1.offset|))) (not (= (select .cse38 |c_ULTIMATE.start_dll_create_#res#1.base|) 1))))))) (or .cse43 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_prenex_1 Int) (v_ArrVal_1776 Int)) (or (< v_prenex_1 0) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (not (= (select v_arrayElimArr_5 (+ v_prenex_3 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776) (select (let ((.cse44 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_5))) (let ((.cse45 (store (select .cse44 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ 8 v_prenex_2) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store .cse44 |c_ULTIMATE.start_dll_create_#res#1.base| .cse45) (select .cse45 .cse7)))) (+ v_prenex_1 4))) 1) (< v_prenex_2 |c_ULTIMATE.start_dll_create_#res#1.offset|)))) (or .cse43 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_prenex_1 Int) (v_ArrVal_1776 Int)) (or (< v_prenex_1 0) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776) (select (let ((.cse46 (let ((.cse47 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_5)) (.cse48 (select v_arrayElimArr_5 (+ v_prenex_3 4)))) (store .cse47 .cse48 (store (select .cse47 .cse48) (+ 8 v_prenex_2) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))))) (select .cse46 (select (select .cse46 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse7))) (+ v_prenex_1 4))) 1) (< v_prenex_2 |c_ULTIMATE.start_dll_create_#res#1.offset|))))) .cse49) (or .cse49 (and (or .cse43 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_prenex_1 Int) (v_ArrVal_1776 Int)) (or (< v_prenex_1 0) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (not (= (select v_arrayElimArr_5 (+ v_prenex_3 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776) (select (let ((.cse50 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_5))) (let ((.cse51 (store (select .cse50 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ 8 v_prenex_2) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store .cse50 |c_ULTIMATE.start_dll_create_#res#1.base| .cse51) (select .cse51 .cse7)))) (+ v_prenex_1 4))) 1)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (forall ((v_prenex_7 Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_1776 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse52 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (= |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_9) (= (select .cse52 (select (let ((.cse53 (let ((.cse54 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_4)) (.cse55 (select v_arrayElimArr_4 (+ v_prenex_9 4)))) (store .cse54 .cse55 (store (select .cse54 .cse55) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))))) (select .cse53 (select (select .cse53 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse7))) (+ v_prenex_7 4))) 1) (not (= (select .cse52 |c_ULTIMATE.start_dll_create_#res#1.base|) 1)) (< v_prenex_7 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_1776 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse56 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (= (select .cse56 (select (let ((.cse57 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_4))) (let ((.cse58 (store (select .cse57 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store .cse57 |c_ULTIMATE.start_dll_create_#res#1.base| .cse58) (select .cse58 .cse7)))) (+ v_prenex_7 4))) 1) (= |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_9) (not (= (select v_arrayElimArr_4 (+ v_prenex_9 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (not (= (select .cse56 |c_ULTIMATE.start_dll_create_#res#1.base|) 1)) (< v_prenex_7 0)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1776 Int)) (let ((.cse60 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3)) (.cse63 (+ v_prenex_6 4))) (let ((.cse61 (let ((.cse64 (select v_arrayElimArr_3 .cse63))) (store .cse60 .cse64 (store (select .cse60 .cse64) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)))) (.cse62 (+ v_prenex_4 4)) (.cse59 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (< v_prenex_5 v_prenex_4) (= (select .cse59 (select (select .cse60 (select (select .cse61 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse7)) .cse62)) 1) (= (select .cse59 (select (select .cse60 (select (select .cse61 |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse63)) .cse62)) 1) (not (= (select .cse59 |c_ULTIMATE.start_dll_create_#res#1.base|) 1)) (< v_prenex_4 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)))) (or .cse43 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_prenex_1 Int) (v_ArrVal_1776 Int)) (or (< v_prenex_1 0) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776) (select (let ((.cse65 (let ((.cse66 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_5)) (.cse67 (select v_arrayElimArr_5 (+ v_prenex_3 4)))) (store .cse66 .cse67 (store (select .cse66 .cse67) (+ 8 v_prenex_2) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))))) (select .cse65 (select (select .cse65 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse7))) (+ v_prenex_1 4))) 1)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1776 Int)) (let ((.cse68 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (< v_prenex_5 v_prenex_4) (not (= (select v_arrayElimArr_3 (+ v_prenex_6 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse68 (select (let ((.cse69 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (select .cse69 (select (store (select .cse69 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse7))) (+ v_prenex_4 4))) 1) (not (= (select .cse68 |c_ULTIMATE.start_dll_create_#res#1.base|) 1)) (< v_prenex_4 0)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1776 Int)) (let ((.cse71 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (let ((.cse73 (+ v_prenex_6 4)) (.cse72 (store (select .cse71 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)) (.cse74 (+ v_prenex_4 4)) (.cse70 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (= (select .cse70 (select (select .cse71 (select (select (store .cse71 |c_ULTIMATE.start_dll_create_#res#1.base| .cse72) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse73)) .cse74)) 1) (< v_prenex_5 v_prenex_4) (not (= (select v_arrayElimArr_3 .cse73) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse70 (select (select .cse71 (select .cse72 .cse7)) .cse74)) 1) (not (= (select .cse70 |c_ULTIMATE.start_dll_create_#res#1.base|) 1)) (< v_prenex_4 0))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| Int) (v_ArrVal_1776 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse75 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (not (= (select v_arrayElimArr_2 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse75 (select (let ((.cse76 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2))) (let ((.cse77 (store (select .cse76 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store .cse76 |c_ULTIMATE.start_dll_create_#res#1.base| .cse77) (select .cse77 .cse7)))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4))) 1) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 0) (not (= (select .cse75 |c_ULTIMATE.start_dll_create_#res#1.base|) 1))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| Int) (v_ArrVal_1776 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse83 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2))) (let ((.cse81 (store (select .cse83 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (let ((.cse79 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776)) (.cse80 (store .cse83 |c_ULTIMATE.start_dll_create_#res#1.base| .cse81)) (.cse78 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) (.cse82 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4))) (or (not (= (select v_arrayElimArr_2 .cse78) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse79 (select (select .cse80 (select .cse81 .cse7)) .cse82)) 1) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 0) (not (= (select .cse79 |c_ULTIMATE.start_dll_create_#res#1.base|) 1)) (= (select .cse79 (select (select .cse80 (select (select .cse80 |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse78)) .cse82)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1776 Int)) (let ((.cse84 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (< v_prenex_5 v_prenex_4) (= (select .cse84 (select (let ((.cse85 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (select .cse85 (select (select (let ((.cse86 (select v_arrayElimArr_3 (+ v_prenex_6 4)))) (store .cse85 .cse86 (store (select .cse85 .cse86) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse7))) (+ v_prenex_4 4))) 1) (not (= (select .cse84 |c_ULTIMATE.start_dll_create_#res#1.base|) 1)) (< v_prenex_4 0))))))))))) is different from true [2024-11-28 02:54:28,289 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse84 (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse10 (not (= .cse84 1))) (.cse39 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 1)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (and (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_1776 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (= (select .cse0 (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_4))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse2) (select .cse2 .cse3)))) (+ v_prenex_7 4))) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_9) (not (= (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (not (= (select v_arrayElimArr_4 (+ v_prenex_9 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< v_prenex_7 0)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| Int) (v_ArrVal_1776 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2))) (let ((.cse7 (store (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (let ((.cse5 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776)) (.cse6 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse7)) (.cse4 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) (.cse8 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4))) (or (not (= (select v_arrayElimArr_2 .cse4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse5 (select (select .cse6 (select .cse7 .cse3)) .cse8)) 1) (not (= (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (= (select .cse5 (select (select .cse6 (select (select .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse4)) .cse8)) 1) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 0)))))))) (or .cse10 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_prenex_1 Int) (v_ArrVal_1776 Int)) (or (< v_prenex_1 0) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776) (select (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_5)) (.cse13 (select v_arrayElimArr_5 (+ v_prenex_3 4)))) (store .cse12 .cse13 (store (select .cse12 .cse13) (+ 8 v_prenex_2) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3))) (+ v_prenex_1 4))) 1)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1776 Int)) (let ((.cse14 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (< v_prenex_5 v_prenex_4) (= (select .cse14 (select (let ((.cse15 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (select .cse15 (select (select (let ((.cse16 (select v_arrayElimArr_3 (+ v_prenex_6 4)))) (store .cse15 .cse16 (store (select .cse15 .cse16) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3))) (+ v_prenex_4 4))) 1) (not (= (select .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (< v_prenex_4 0)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1776 Int)) (let ((.cse18 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3)) (.cse21 (+ v_prenex_6 4))) (let ((.cse17 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776)) (.cse19 (let ((.cse22 (select v_arrayElimArr_3 .cse21))) (store .cse18 .cse22 (store (select .cse18 .cse22) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)))) (.cse20 (+ v_prenex_4 4))) (or (< v_prenex_5 v_prenex_4) (= (select .cse17 (select (select .cse18 (select (select .cse19 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3)) .cse20)) 1) (not (= (select .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (= (select .cse17 (select (select .cse18 (select (select .cse19 |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse21)) .cse20)) 1) (< v_prenex_4 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| Int) (v_ArrVal_1776 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse23 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (not (= (select v_arrayElimArr_2 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse23 (select (let ((.cse24 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2))) (let ((.cse25 (store (select .cse24 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store .cse24 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse25) (select .cse25 .cse3)))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4))) 1) (not (= (select .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 0)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1776 Int)) (let ((.cse28 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (let ((.cse26 (+ v_prenex_6 4)) (.cse27 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776)) (.cse29 (store (select .cse28 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)) (.cse30 (+ v_prenex_4 4))) (or (< v_prenex_5 v_prenex_4) (not (= (select v_arrayElimArr_3 .cse26) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse27 (select (select .cse28 (select (select (store .cse28 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse29) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse26)) .cse30)) 1) (not (= (select .cse27 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (= (select .cse27 (select (select .cse28 (select .cse29 .cse3)) .cse30)) 1) (< v_prenex_4 0))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1776 Int)) (let ((.cse31 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (< v_prenex_5 v_prenex_4) (not (= (select v_arrayElimArr_3 (+ v_prenex_6 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= (select .cse31 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (= (select .cse31 (select (let ((.cse32 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (select .cse32 (select (store (select .cse32 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse3))) (+ v_prenex_4 4))) 1) (< v_prenex_4 0)))))) (or .cse10 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_prenex_1 Int) (v_ArrVal_1776 Int)) (or (< v_prenex_1 0) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776) (select (let ((.cse33 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_5))) (let ((.cse34 (store (select .cse33 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ 8 v_prenex_2) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store .cse33 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse34) (select .cse34 .cse3)))) (+ v_prenex_1 4))) 1) (not (= (select v_arrayElimArr_5 (+ v_prenex_3 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_1776 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse35 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_9) (not (= (select .cse35 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (= (select .cse35 (select (let ((.cse36 (let ((.cse37 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_4)) (.cse38 (select v_arrayElimArr_4 (+ v_prenex_9 4)))) (store .cse37 .cse38 (store (select .cse37 .cse38) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))))) (select .cse36 (select (select .cse36 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3))) (+ v_prenex_7 4))) 1) (< v_prenex_7 0))))))) .cse39) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1776 Int)) (let ((.cse41 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((v_prenex_5 Int)) (or (< v_prenex_5 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (forall ((v_prenex_4 Int)) (or (forall ((v_prenex_6 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse42 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (let ((.cse40 (+ v_prenex_6 4)) (.cse43 (store (select .cse42 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)) (.cse44 (+ v_prenex_4 4))) (or (not (= (select v_arrayElimArr_3 .cse40) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse41 (select (select .cse42 (select (select (store .cse42 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse43) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse40)) .cse44)) 1) (= (select .cse41 (select (select .cse42 (select .cse43 .cse3)) .cse44)) 1))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_4) (< v_prenex_4 0))))) (not (= (select .cse41 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1776 Int)) (let ((.cse45 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int))) (or (< v_prenex_5 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select .cse45 (select (let ((.cse46 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (select .cse46 (select (select (let ((.cse47 (select v_arrayElimArr_3 (+ v_prenex_6 4)))) (store .cse46 .cse47 (store (select .cse46 .cse47) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3))) (+ v_prenex_4 4))) 1) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_4) (< v_prenex_4 0))) (not (= (select .cse45 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1776 Int)) (let ((.cse48 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse49 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3)) (.cse52 (+ v_prenex_6 4))) (let ((.cse50 (let ((.cse53 (select v_arrayElimArr_3 .cse52))) (store .cse49 .cse53 (store (select .cse49 .cse53) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)))) (.cse51 (+ v_prenex_4 4))) (or (< v_prenex_5 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select .cse48 (select (select .cse49 (select (select .cse50 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3)) .cse51)) 1) (= (select .cse48 (select (select .cse49 (select (select .cse50 |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse52)) .cse51)) 1) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_4) (< v_prenex_4 0))))) (not (= (select .cse48 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1776 Int)) (let ((.cse54 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((v_prenex_7 Int) (v_arrayElimArr_4 (Array Int Int)) (v_prenex_8 Int) (v_prenex_9 Int)) (or (= (select .cse54 (select (let ((.cse55 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_4))) (let ((.cse56 (store (select .cse55 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store .cse55 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse56) (select .cse56 .cse3)))) (+ v_prenex_7 4))) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_9) (< v_prenex_8 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (not (= (select v_arrayElimArr_4 (+ v_prenex_9 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< v_prenex_7 0))) (not (= (select .cse54 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1776 Int)) (let ((.cse57 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (not (= (select .cse57 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int))) (or (< v_prenex_5 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (not (= (select v_arrayElimArr_3 (+ v_prenex_6 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_4) (= (select .cse57 (select (let ((.cse58 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (select .cse58 (select (store (select .cse58 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse3))) (+ v_prenex_4 4))) 1) (< v_prenex_4 0)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1776 Int)) (let ((.cse60 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| Int)) (or (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse64 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2))) (let ((.cse62 (store (select .cse64 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (let ((.cse61 (store .cse64 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse62)) (.cse59 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) (.cse63 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4))) (or (not (= (select v_arrayElimArr_2 .cse59) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse60 (select (select .cse61 (select .cse62 .cse3)) .cse63)) 1) (= (select .cse60 (select (select .cse61 (select (select .cse61 |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse59)) .cse63)) 1)))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 0))))) (not (= (select .cse60 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1776 Int)) (let ((.cse65 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((v_prenex_7 Int) (v_arrayElimArr_4 (Array Int Int)) (v_prenex_8 Int) (v_prenex_9 Int)) (or (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_9) (< v_prenex_8 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select .cse65 (select (let ((.cse66 (let ((.cse67 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_4)) (.cse68 (select v_arrayElimArr_4 (+ v_prenex_9 4)))) (store .cse67 .cse68 (store (select .cse67 .cse68) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))))) (select .cse66 (select (select .cse66 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3))) (+ v_prenex_7 4))) 1) (< v_prenex_7 0))) (not (= (select .cse65 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))))))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_prenex_1 Int) (v_ArrVal_1776 Int)) (or (< v_prenex_1 0) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (< v_prenex_2 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776) (select (let ((.cse69 (let ((.cse70 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_5)) (.cse71 (select v_arrayElimArr_5 (+ v_prenex_3 4)))) (store .cse70 .cse71 (store (select .cse70 .cse71) (+ 8 v_prenex_2) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))))) (select .cse69 (select (select .cse69 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3))) (+ v_prenex_1 4))) 1))) .cse10) (or .cse10 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_prenex_1 Int) (v_ArrVal_1776 Int)) (or (< v_prenex_1 0) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (< v_prenex_2 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776) (select (let ((.cse72 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_5))) (let ((.cse73 (store (select .cse72 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ 8 v_prenex_2) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store .cse72 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse73) (select .cse73 .cse3)))) (+ v_prenex_1 4))) 1) (not (= (select v_arrayElimArr_5 (+ v_prenex_3 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1776 Int)) (let ((.cse74 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (or (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (not (= (select v_arrayElimArr_2 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse74 (select (let ((.cse75 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2))) (let ((.cse76 (store (select .cse75 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store .cse75 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse76) (select .cse76 .cse3)))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4))) 1) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 0))) (not (= (select .cse74 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))))))) .cse39) (or (< |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse77 (+ v_prenex_6 4))) (or (< v_prenex_5 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (not (= (select v_arrayElimArr_3 .cse77) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_4) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| 1) (select (let ((.cse78 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (select .cse78 (select (select (store .cse78 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse78 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse77))) (+ v_prenex_4 4))) 1) (< v_prenex_4 0)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_prenex_5 Int)) (or (< v_prenex_5 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (forall ((v_prenex_4 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_4) (forall ((v_prenex_6 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse81 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (let ((.cse80 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| 1)) (.cse82 (store (select .cse81 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)) (.cse79 (+ v_prenex_6 4)) (.cse83 (+ v_prenex_4 4))) (or (not (= (select v_arrayElimArr_3 .cse79) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse80 (select (select .cse81 (select .cse82 .cse3)) .cse83)) 1) (= (select .cse80 (select (select .cse81 (select (select (store .cse81 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse82) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse79)) .cse83)) 1))))) (< v_prenex_4 0))))))) (or (not (= .cse84 0)) (let ((.cse85 (store |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1))) (and (forall ((v_arrayElimArr_7 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| Int)) (let ((.cse86 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4))) (or (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select .cse85 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_7) (select v_arrayElimArr_7 .cse3)) .cse86)) 1) (not (= (select v_arrayElimArr_7 (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse85 (select v_arrayElimArr_7 .cse86)) 1) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 0)))) (forall ((v_arrayElimCell_48 Int)) (= (select .cse85 v_arrayElimCell_48) 1)))))))))) is different from true [2024-11-28 02:57:19,045 WARN L286 SmtUtils]: Spent 5.56s on a formula simplification that was a NOOP. DAG size: 311 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 02:57:26,214 WARN L873 $PredicateComparison]: unable to prove that (or (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (let ((.cse76 (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse37 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 1)) (.cse12 (not (= .cse76 1))) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse4 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (or (and (forall ((v_ArrVal_1775 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1774 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| Int) (v_ArrVal_1776 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (= (select .cse0 (select (let ((.cse1 (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 .cse2))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4))) 1) (not (= (select v_arrayElimArr_2 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 0)))))) (forall ((v_ArrVal_1775 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1774 Int)) (or (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1776 Int)) (let ((.cse5 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (= (select .cse5 (select (let ((.cse6 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (select .cse6 (select (store (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse2))) (+ v_prenex_4 4))) 1) (< v_prenex_5 v_prenex_4) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_3 (+ v_prenex_6 4)))) (not (= (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) (< v_prenex_4 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)))) (forall ((v_ArrVal_1775 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1774 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| Int) (v_ArrVal_1776 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse11 (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse11)) (.cse10 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4)) (.cse9 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) (.cse7 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (= (select .cse7 (select (select .cse8 (select (select .cse8 |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse9)) .cse10)) 1) (= (select .cse7 (select (select .cse8 (select .cse11 .cse2)) .cse10)) 1) (not (= (select v_arrayElimArr_2 .cse9) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 0))))))) (or .cse12 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (v_ArrVal_1775 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_prenex_1 Int) (v_ArrVal_1774 Int) (v_ArrVal_1776 Int)) (or (< v_prenex_1 0) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776) (select (let ((.cse13 (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_2) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse13) (select .cse13 .cse2))) (+ v_prenex_1 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_5 (+ v_prenex_3 4))))))) (forall ((v_ArrVal_1775 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1774 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1776 Int)) (let ((.cse15 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3)) (.cse18 (+ v_prenex_6 4))) (let ((.cse14 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776)) (.cse16 (let ((.cse19 (select v_arrayElimArr_3 .cse18))) (store .cse15 .cse19 (store (select .cse15 .cse19) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)))) (.cse17 (+ v_prenex_4 4))) (or (= (select .cse14 (select (select .cse15 (select (select .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) .cse17)) 1) (< v_prenex_5 v_prenex_4) (not (= (select .cse14 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) (= (select .cse14 (select (select .cse15 (select (select .cse16 |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse18)) .cse17)) 1) (< v_prenex_4 0))))))) (forall ((v_ArrVal_1775 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1774 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1776 Int)) (let ((.cse20 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (= (select .cse20 (select (let ((.cse21 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (select .cse21 (select (select (let ((.cse22 (select v_arrayElimArr_3 (+ v_prenex_6 4)))) (store .cse21 .cse22 (store (select .cse21 .cse22) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (+ v_prenex_4 4))) 1) (< v_prenex_5 v_prenex_4) (not (= (select .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) (< v_prenex_4 0)))))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1775 (Array Int Int)) (v_prenex_3 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_prenex_1 Int) (v_ArrVal_1774 Int) (v_ArrVal_1776 Int)) (or (< v_prenex_1 0) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776) (select (let ((.cse23 (let ((.cse24 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_5)) (.cse25 (select v_arrayElimArr_5 (+ v_prenex_3 4)))) (store .cse24 .cse25 (store (select .cse24 .cse25) (+ 8 v_prenex_2) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))))) (select .cse23 (select (select .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (+ v_prenex_1 4))) 1))) .cse12) (forall ((v_ArrVal_1775 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1774 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1776 Int)) (let ((.cse27 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (let ((.cse26 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776)) (.cse28 (store (select .cse27 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)) (.cse30 (+ v_prenex_6 4)) (.cse29 (+ v_prenex_4 4))) (or (= (select .cse26 (select (select .cse27 (select .cse28 .cse2)) .cse29)) 1) (< v_prenex_5 v_prenex_4) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_3 .cse30))) (not (= (select .cse26 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) (= (select .cse26 (select (select .cse27 (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse28) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse30)) .cse29)) 1) (< v_prenex_4 0))))))) (forall ((v_ArrVal_1775 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1774 Int)) (or (forall ((v_prenex_7 Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_1776 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse31 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_4 (+ v_prenex_9 4)))) (not (= (select .cse31 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_9) (= (select .cse31 (select (let ((.cse32 (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse32) (select .cse32 .cse2))) (+ v_prenex_7 4))) 1) (< v_prenex_7 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)))) (forall ((v_ArrVal_1775 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1774 Int)) (or (forall ((v_prenex_7 Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_1776 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse33 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (= (select .cse33 (select (let ((.cse34 (let ((.cse35 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_4)) (.cse36 (select v_arrayElimArr_4 (+ v_prenex_9 4)))) (store .cse35 .cse36 (store (select .cse35 .cse36) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))))) (select .cse34 (select (select .cse34 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (+ v_prenex_7 4))) 1) (not (= (select .cse33 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_9) (< v_prenex_7 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0))))) .cse37) (or .cse37 (and (forall ((v_ArrVal_1775 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1774 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1776 Int)) (let ((.cse38 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse39 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3)) (.cse42 (+ v_prenex_6 4))) (let ((.cse40 (let ((.cse43 (select v_arrayElimArr_3 .cse42))) (store .cse39 .cse43 (store (select .cse39 .cse43) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)))) (.cse41 (+ v_prenex_4 4))) (or (= (select .cse38 (select (select .cse39 (select (select .cse40 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) .cse41)) 1) (< v_prenex_5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_4) (= (select .cse38 (select (select .cse39 (select (select .cse40 |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse42)) .cse41)) 1) (< v_prenex_4 0))))) (not (= (select .cse38 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))))))) (forall ((v_ArrVal_1775 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1774 Int)) (or (forall ((v_ArrVal_1776 Int)) (let ((.cse44 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((v_prenex_5 Int)) (or (< v_prenex_5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (forall ((v_prenex_4 Int)) (or (forall ((v_prenex_6 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse45 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (let ((.cse46 (store (select .cse45 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)) (.cse48 (+ v_prenex_6 4)) (.cse47 (+ v_prenex_4 4))) (or (= (select .cse44 (select (select .cse45 (select .cse46 .cse2)) .cse47)) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_3 .cse48))) (= (select .cse44 (select (select .cse45 (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse46) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse48)) .cse47)) 1))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_4) (< v_prenex_4 0))))) (not (= (select .cse44 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)))) (or .cse12 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1775 (Array Int Int)) (v_prenex_3 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_prenex_1 Int) (v_ArrVal_1774 Int) (v_ArrVal_1776 Int)) (or (< v_prenex_1 0) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776) (select (let ((.cse49 (let ((.cse50 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_5)) (.cse51 (select v_arrayElimArr_5 (+ v_prenex_3 4)))) (store .cse50 .cse51 (store (select .cse50 .cse51) (+ 8 v_prenex_2) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))))) (select .cse49 (select (select .cse49 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (+ v_prenex_1 4))) 1) (< v_prenex_2 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1775 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1774 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1776 Int)) (let ((.cse52 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| Int)) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse56 (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (let ((.cse53 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse56)) (.cse55 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4)) (.cse54 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (= (select .cse52 (select (select .cse53 (select (select .cse53 |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse54)) .cse55)) 1) (= (select .cse52 (select (select .cse53 (select .cse56 .cse2)) .cse55)) 1) (not (= (select v_arrayElimArr_2 .cse54) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 0))) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (not (= (select .cse52 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))))))) (forall ((v_ArrVal_1775 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1774 Int)) (or (forall ((v_ArrVal_1776 Int)) (let ((.cse57 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((v_prenex_7 Int) (v_arrayElimArr_4 (Array Int Int)) (v_prenex_8 Int) (v_prenex_9 Int)) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_4 (+ v_prenex_9 4)))) (< v_prenex_8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_9) (= (select .cse57 (select (let ((.cse58 (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse58) (select .cse58 .cse2))) (+ v_prenex_7 4))) 1) (< v_prenex_7 0))) (not (= (select .cse57 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)))) (forall ((v_ArrVal_1775 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1774 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1776 Int)) (let ((.cse59 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (or (= (select .cse59 (select (let ((.cse60 (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse60) (select .cse60 .cse2))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4))) 1) (not (= (select v_arrayElimArr_2 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 0))) (not (= (select .cse59 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))))))) (forall ((v_ArrVal_1775 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1774 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1776 Int)) (let ((.cse61 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int))) (or (= (select .cse61 (select (let ((.cse62 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (select .cse62 (select (store (select .cse62 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse2))) (+ v_prenex_4 4))) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_3 (+ v_prenex_6 4)))) (< v_prenex_5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_4) (< v_prenex_4 0))) (not (= (select .cse61 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))))))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (v_ArrVal_1775 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_prenex_1 Int) (v_ArrVal_1774 Int) (v_ArrVal_1776 Int)) (or (< v_prenex_1 0) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776) (select (let ((.cse63 (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_2) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse63) (select .cse63 .cse2))) (+ v_prenex_1 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (< v_prenex_2 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_5 (+ v_prenex_3 4)))))) .cse12) (forall ((v_ArrVal_1775 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1774 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1776 Int)) (let ((.cse64 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((v_prenex_7 Int) (v_arrayElimArr_4 (Array Int Int)) (v_prenex_8 Int) (v_prenex_9 Int)) (or (= (select .cse64 (select (let ((.cse65 (let ((.cse66 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_4)) (.cse67 (select v_arrayElimArr_4 (+ v_prenex_9 4)))) (store .cse66 .cse67 (store (select .cse66 .cse67) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))))) (select .cse65 (select (select .cse65 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (+ v_prenex_7 4))) 1) (< v_prenex_8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_9) (< v_prenex_7 0))) (not (= (select .cse64 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))))))) (forall ((v_ArrVal_1775 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1774 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1776 Int)) (let ((.cse68 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1776))) (or (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int))) (or (= (select .cse68 (select (let ((.cse69 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (select .cse69 (select (select (let ((.cse70 (select v_arrayElimArr_3 (+ v_prenex_6 4)))) (store .cse69 .cse70 (store (select .cse69 .cse70) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (+ v_prenex_4 4))) 1) (< v_prenex_5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_4) (< v_prenex_4 0))) (not (= (select .cse68 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))))))))) (or (< |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (and (forall ((v_ArrVal_1775 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1774 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_4 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_4) (forall ((v_prenex_6 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse73 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (let ((.cse71 (+ v_prenex_6 4)) (.cse72 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| 1)) (.cse74 (store (select .cse73 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)) (.cse75 (+ v_prenex_4 4))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_3 .cse71))) (= (select .cse72 (select (select .cse73 (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse74) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse71)) .cse75)) 1) (= (select .cse72 (select (select .cse73 (select .cse74 .cse2)) .cse75)) 1))))) (< v_prenex_4 0))) (< v_prenex_5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (or (not (= .cse76 0)) (let ((.cse77 (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1))) (and (forall ((v_arrayElimCell_48 Int)) (= (select .cse77 v_arrayElimCell_48) 1)) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| Int)) (let ((.cse78 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4))) (or (= (select .cse77 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_7) (select v_arrayElimArr_7 .cse2)) .cse78)) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_7 (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| 8)))) (= (select .cse77 (select v_arrayElimArr_7 .cse78)) 1) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 0))))))) (forall ((v_ArrVal_1775 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1774 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse79 (+ v_prenex_6 4))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_3 .cse79))) (< v_prenex_5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_4) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| 1) (select (let ((.cse80 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1774)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3))) (select .cse80 (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse80 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse79))) (+ v_prenex_4 4))) 1) (< v_prenex_4 0)))))))))))) is different from true [2024-11-28 02:57:26,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:57:26,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 77 [2024-11-28 02:57:27,307 INFO L349 Elim1Store]: treesize reduction 226, result has 48.0 percent of original size [2024-11-28 02:57:27,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 90848 treesize of output 84835 [2024-11-28 02:57:29,058 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:57:29,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:57:29,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9977 treesize of output 7481 [2024-11-28 02:57:29,484 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:57:29,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:57:29,524 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 7184 treesize of output 6780 [2024-11-28 02:57:40,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6719 treesize of output 6687 [2024-11-28 02:57:55,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-28 02:57:56,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-28 02:57:56,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-28 02:57:56,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-28 02:57:56,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-28 02:57:58,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:57:58,226 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 290 treesize of output 282 [2024-11-28 02:58:00,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:00,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 101 [2024-11-28 02:58:00,297 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:58:00,919 INFO L349 Elim1Store]: treesize reduction 105, result has 67.7 percent of original size [2024-11-28 02:58:00,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 34608 treesize of output 33070 [2024-11-28 02:58:02,333 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:58:02,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:02,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20912 treesize of output 15008 [2024-11-28 02:58:02,700 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:58:02,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:58:02,737 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 14762 treesize of output 13542 [2024-11-28 02:58:15,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70