./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:47:42,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:47:43,081 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 10:47:43,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:47:43,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:47:43,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:47:43,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:47:43,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:47:43,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:47:43,143 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:47:43,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:47:43,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:47:43,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:47:43,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:47:43,147 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:47:43,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:47:43,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:47:43,148 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:47:43,149 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:47:43,149 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:47:43,149 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:47:43,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:47:43,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:47:43,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:47:43,151 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:47:43,152 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:47:43,152 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:47:43,153 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:47:43,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:47:43,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:47:43,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:47:43,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:47:43,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:47:43,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:47:43,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:47:43,173 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:47:43,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:47:43,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:47:43,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:47:43,174 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:47:43,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:47:43,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:47:43,175 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 [2023-11-26 10:47:43,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:47:43,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:47:43,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:47:43,552 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:47:43,553 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:47:43,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2023-11-26 10:47:46,763 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:47:47,055 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:47:47,056 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2023-11-26 10:47:47,079 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/data/769da7138/283cc0a7c3c24d2eac446040e6a93813/FLAG00723d4e6 [2023-11-26 10:47:47,098 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/data/769da7138/283cc0a7c3c24d2eac446040e6a93813 [2023-11-26 10:47:47,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:47:47,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:47:47,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:47:47,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:47:47,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:47:47,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:47:47" (1/1) ... [2023-11-26 10:47:47,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@606a22b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:47, skipping insertion in model container [2023-11-26 10:47:47,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:47:47" (1/1) ... [2023-11-26 10:47:47,180 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:47:47,611 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i[24989,25002] [2023-11-26 10:47:47,619 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:47:47,635 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:47:47,726 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i[24989,25002] [2023-11-26 10:47:47,727 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:47:47,764 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:47:47,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:47 WrapperNode [2023-11-26 10:47:47,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:47:47,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:47:47,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:47:47,768 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:47:47,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:47" (1/1) ... [2023-11-26 10:47:47,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:47" (1/1) ... [2023-11-26 10:47:47,853 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 168 [2023-11-26 10:47:47,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:47:47,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:47:47,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:47:47,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:47:47,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:47" (1/1) ... [2023-11-26 10:47:47,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:47" (1/1) ... [2023-11-26 10:47:47,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:47" (1/1) ... [2023-11-26 10:47:47,913 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 8, 21]. 68 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 14 writes are split as follows [0, 1, 13]. [2023-11-26 10:47:47,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:47" (1/1) ... [2023-11-26 10:47:47,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:47" (1/1) ... [2023-11-26 10:47:47,928 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:47" (1/1) ... [2023-11-26 10:47:47,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:47" (1/1) ... [2023-11-26 10:47:47,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:47" (1/1) ... [2023-11-26 10:47:47,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:47" (1/1) ... [2023-11-26 10:47:47,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:47:47,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:47:47,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:47:47,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:47:47,949 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:47" (1/1) ... [2023-11-26 10:47:47,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:47:47,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:47:47,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:47:48,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:47:48,081 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-26 10:47:48,081 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-26 10:47:48,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 10:47:48,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 10:47:48,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-26 10:47:48,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 10:47:48,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 10:47:48,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 10:47:48,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 10:47:48,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:47:48,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:47:48,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-26 10:47:48,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-26 10:47:48,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-26 10:47:48,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-26 10:47:48,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-26 10:47:48,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-26 10:47:48,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:47:48,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-26 10:47:48,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-26 10:47:48,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-26 10:47:48,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:47:48,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 10:47:48,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 10:47:48,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:47:48,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:47:48,302 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:47:48,314 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:47:48,369 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-26 10:47:48,736 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:47:48,782 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:47:48,782 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-26 10:47:48,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:47:48 BoogieIcfgContainer [2023-11-26 10:47:48,783 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:47:48,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:47:48,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:47:48,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:47:48,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:47:47" (1/3) ... [2023-11-26 10:47:48,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9c3a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:47:48, skipping insertion in model container [2023-11-26 10:47:48,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:47:47" (2/3) ... [2023-11-26 10:47:48,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9c3a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:47:48, skipping insertion in model container [2023-11-26 10:47:48,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:47:48" (3/3) ... [2023-11-26 10:47:48,798 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2023-11-26 10:47:48,825 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:47:48,825 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 10:47:48,889 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:47:48,898 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@50b004f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:47:48,899 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 10:47:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 28 states have (on average 1.75) internal successors, (49), 30 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:48,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-26 10:47:48,919 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:47:48,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:47:48,922 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:47:48,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:47:48,932 INFO L85 PathProgramCache]: Analyzing trace with hash 221915133, now seen corresponding path program 1 times [2023-11-26 10:47:48,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:47:48,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618640585] [2023-11-26 10:47:48,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:48,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:47:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:47:49,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:47:49,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618640585] [2023-11-26 10:47:49,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618640585] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:47:49,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:47:49,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:47:49,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705190088] [2023-11-26 10:47:49,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:47:49,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:47:49,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:47:49,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:47:49,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:47:49,387 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.75) internal successors, (49), 30 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:49,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:47:49,439 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2023-11-26 10:47:49,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:47:49,445 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-26 10:47:49,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:47:49,454 INFO L225 Difference]: With dead ends: 57 [2023-11-26 10:47:49,455 INFO L226 Difference]: Without dead ends: 24 [2023-11-26 10:47:49,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:47:49,466 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:47:49,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:47:49,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-26 10:47:49,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-26 10:47:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:49,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2023-11-26 10:47:49,513 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 12 [2023-11-26 10:47:49,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:47:49,514 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2023-11-26 10:47:49,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:49,515 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2023-11-26 10:47:49,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-26 10:47:49,517 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:47:49,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:47:49,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:47:49,518 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:47:49,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:47:49,519 INFO L85 PathProgramCache]: Analyzing trace with hash 4252586, now seen corresponding path program 1 times [2023-11-26 10:47:49,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:47:49,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105328296] [2023-11-26 10:47:49,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:49,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:47:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:49,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:47:49,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:47:49,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105328296] [2023-11-26 10:47:49,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105328296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:47:49,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:47:49,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:47:49,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610790525] [2023-11-26 10:47:49,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:47:49,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:47:49,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:47:49,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:47:49,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:47:49,863 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:49,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:47:49,923 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2023-11-26 10:47:49,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:47:49,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-26 10:47:49,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:47:49,926 INFO L225 Difference]: With dead ends: 47 [2023-11-26 10:47:49,926 INFO L226 Difference]: Without dead ends: 29 [2023-11-26 10:47:49,926 INFO L412 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 [2023-11-26 10:47:49,928 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:47:49,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 57 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:47:49,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-26 10:47:49,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2023-11-26 10:47:49,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:49,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2023-11-26 10:47:49,937 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 12 [2023-11-26 10:47:49,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:47:49,937 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2023-11-26 10:47:49,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:49,939 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2023-11-26 10:47:49,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-26 10:47:49,964 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:47:49,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:47:49,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:47:49,965 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:47:49,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:47:49,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1675711004, now seen corresponding path program 1 times [2023-11-26 10:47:49,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:47:49,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977502458] [2023-11-26 10:47:49,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:49,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:47:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:47:50,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:47:50,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977502458] [2023-11-26 10:47:50,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977502458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:47:50,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:47:50,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:47:50,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021493335] [2023-11-26 10:47:50,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:47:50,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:47:50,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:47:50,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:47:50,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:47:50,094 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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) [2023-11-26 10:47:50,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:47:50,135 INFO L93 Difference]: Finished difference Result 52 states and 73 transitions. [2023-11-26 10:47:50,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:47:50,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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 17 [2023-11-26 10:47:50,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:47:50,138 INFO L225 Difference]: With dead ends: 52 [2023-11-26 10:47:50,138 INFO L226 Difference]: Without dead ends: 29 [2023-11-26 10:47:50,139 INFO L412 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 [2023-11-26 10:47:50,141 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:47:50,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 56 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:47:50,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-26 10:47:50,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-11-26 10:47:50,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 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) [2023-11-26 10:47:50,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-11-26 10:47:50,149 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 17 [2023-11-26 10:47:50,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:47:50,149 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-11-26 10:47:50,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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) [2023-11-26 10:47:50,150 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-11-26 10:47:50,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-26 10:47:50,151 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:47:50,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:47:50,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:47:50,152 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:47:50,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:47:50,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1088904990, now seen corresponding path program 1 times [2023-11-26 10:47:50,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:47:50,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588203952] [2023-11-26 10:47:50,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:50,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:47:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:47:50,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:47:50,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588203952] [2023-11-26 10:47:50,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588203952] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:47:50,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347060030] [2023-11-26 10:47:50,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:50,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:47:50,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:47:50,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:47:50,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 10:47:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:50,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 10:47:50,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:47:50,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:47:50,630 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:47:50,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:47:50,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347060030] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:47:50,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:47:50,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-11-26 10:47:50,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536523801] [2023-11-26 10:47:50,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:47:50,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:47:50,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:47:50,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:47:50,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:47:50,663 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 4.6) 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) [2023-11-26 10:47:50,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:47:50,701 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2023-11-26 10:47:50,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:47:50,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) 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 17 [2023-11-26 10:47:50,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:47:50,703 INFO L225 Difference]: With dead ends: 48 [2023-11-26 10:47:50,703 INFO L226 Difference]: Without dead ends: 30 [2023-11-26 10:47:50,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:47:50,705 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:47:50,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 85 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:47:50,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-26 10:47:50,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-26 10:47:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2023-11-26 10:47:50,712 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 17 [2023-11-26 10:47:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:47:50,712 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2023-11-26 10:47:50,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) 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) [2023-11-26 10:47:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2023-11-26 10:47:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-26 10:47:50,713 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:47:50,713 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:47:50,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 10:47:50,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:47:50,921 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:47:50,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:47:50,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1157750568, now seen corresponding path program 1 times [2023-11-26 10:47:50,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:47:50,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503811102] [2023-11-26 10:47:50,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:50,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:47:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:51,083 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-26 10:47:51,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:47:51,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503811102] [2023-11-26 10:47:51,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503811102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:47:51,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:47:51,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:47:51,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601009280] [2023-11-26 10:47:51,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:47:51,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:47:51,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:47:51,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:47:51,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:47:51,087 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:47:51,118 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2023-11-26 10:47:51,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:47:51,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-26 10:47:51,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:47:51,120 INFO L225 Difference]: With dead ends: 44 [2023-11-26 10:47:51,120 INFO L226 Difference]: Without dead ends: 33 [2023-11-26 10:47:51,121 INFO L412 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 [2023-11-26 10:47:51,122 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 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 [2023-11-26 10:47:51,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:47:51,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-26 10:47:51,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2023-11-26 10:47:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 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) [2023-11-26 10:47:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2023-11-26 10:47:51,129 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 22 [2023-11-26 10:47:51,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:47:51,130 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2023-11-26 10:47:51,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:51,130 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2023-11-26 10:47:51,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-26 10:47:51,133 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:47:51,133 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:47:51,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:47:51,133 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:47:51,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:47:51,134 INFO L85 PathProgramCache]: Analyzing trace with hash 267537911, now seen corresponding path program 1 times [2023-11-26 10:47:51,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:47:51,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372681300] [2023-11-26 10:47:51,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:51,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:47:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:51,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-26 10:47:51,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:47:51,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372681300] [2023-11-26 10:47:51,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372681300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:47:51,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:47:51,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:47:51,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107885921] [2023-11-26 10:47:51,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:47:51,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:47:51,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:47:51,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:47:51,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:47:51,345 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:51,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:47:51,375 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2023-11-26 10:47:51,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:47:51,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 [2023-11-26 10:47:51,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:47:51,377 INFO L225 Difference]: With dead ends: 44 [2023-11-26 10:47:51,377 INFO L226 Difference]: Without dead ends: 31 [2023-11-26 10:47:51,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:47:51,379 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:47:51,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 55 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:47:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-26 10:47:51,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-26 10:47:51,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:51,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2023-11-26 10:47:51,385 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 23 [2023-11-26 10:47:51,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:47:51,386 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2023-11-26 10:47:51,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2023-11-26 10:47:51,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-26 10:47:51,387 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:47:51,388 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:47:51,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:47:51,388 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:47:51,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:47:51,389 INFO L85 PathProgramCache]: Analyzing trace with hash 2111998660, now seen corresponding path program 1 times [2023-11-26 10:47:51,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:47:51,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608192570] [2023-11-26 10:47:51,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:51,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:47:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:53,645 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:47:53,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:47:53,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608192570] [2023-11-26 10:47:53,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608192570] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:47:53,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69919100] [2023-11-26 10:47:53,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:53,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:47:53,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:47:53,655 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:47:53,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 10:47:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:54,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 85 conjunts are in the unsatisfiable core [2023-11-26 10:47:54,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:47:54,286 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 [2023-11-26 10:47:54,474 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-26 10:47:54,475 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 [2023-11-26 10:47:54,624 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 14 treesize of output 15 [2023-11-26 10:47:54,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-11-26 10:47:54,802 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-26 10:47:54,803 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 57 treesize of output 50 [2023-11-26 10:47:54,823 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 24 treesize of output 11 [2023-11-26 10:47:55,119 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-26 10:47:55,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-26 10:47:55,390 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 20 treesize of output 15 [2023-11-26 10:47:55,419 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 48 treesize of output 31 [2023-11-26 10:47:55,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 19 [2023-11-26 10:47:55,751 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 63 treesize of output 30 [2023-11-26 10:47:55,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 10:47:55,762 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 30 treesize of output 15 [2023-11-26 10:47:55,864 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 20 treesize of output 15 [2023-11-26 10:47:55,942 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 19 treesize of output 11 [2023-11-26 10:47:56,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:47:56,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:47:56,238 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_590) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_591) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_592) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse0 (select v_ArrVal_590 .cse0))) v_ArrVal_590)))) is different from false [2023-11-26 10:47:56,279 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_592 (Array Int Int)) (|v_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset_15| Int)) (or (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset_15| 4))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0 (select v_ArrVal_590 .cse0))) v_ArrVal_590)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_590) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_591) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4)) v_ArrVal_592) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (< |v_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset_15| |c_ULTIMATE.start_dll_insert_~last~0#1.offset|))) is different from false [2023-11-26 10:47:56,312 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_592 (Array Int Int)) (|v_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset_15| Int) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (or (< |v_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset_15| .cse0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| .cse1 v_ArrVal_590) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_591) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_585) .cse1) (+ .cse0 4)) v_ArrVal_592) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_590 (let ((.cse2 (+ |v_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset_15| 4))) (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_587) .cse1) .cse2 (select v_ArrVal_590 .cse2)))))))) is different from false [2023-11-26 10:47:56,368 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 76 treesize of output 56 [2023-11-26 10:47:56,378 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 49 treesize of output 33 [2023-11-26 10:47:56,717 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int) (v_ArrVal_591 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_592 (Array Int Int)) (|v_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset_15| Int) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_584))) (or (< |v_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset_15| |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= v_ArrVal_590 (let ((.cse1 (+ |v_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset_15| 4))) (store (select (store .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_587) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_590 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_590) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_591) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_582) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_585) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_592) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) 0))))) is different from false [2023-11-26 10:47:56,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 474 treesize of output 472 [2023-11-26 10:47:56,771 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 10:47:56,822 INFO L349 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2023-11-26 10:47:56,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 95 treesize of output 120 [2023-11-26 10:47:56,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 10:47:56,853 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 104 treesize of output 94 [2023-11-26 10:47:56,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 162 [2023-11-26 10:47:56,963 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 134 treesize of output 118 [2023-11-26 10:47:56,987 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 118 treesize of output 110 [2023-11-26 10:47:57,007 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 56 treesize of output 54 [2023-11-26 10:47:57,029 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 53 treesize of output 49 [2023-11-26 10:47:57,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 10:47:57,059 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 73 treesize of output 77 [2023-11-26 10:47:57,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 10:47:57,093 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 64 treesize of output 59 [2023-11-26 10:47:57,241 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 [2023-11-26 10:47:57,269 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 [2023-11-26 10:47:57,311 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 [2023-11-26 10:47:57,345 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 10:47:57,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2023-11-26 10:47:57,362 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 21 treesize of output 17 [2023-11-26 10:47:57,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-26 10:47:57,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69919100] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:47:57,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:47:57,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2023-11-26 10:47:57,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160922624] [2023-11-26 10:47:57,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:47:57,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-26 10:47:57,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:47:57,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-26 10:47:57,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1134, Unknown=10, NotChecked=284, Total=1560 [2023-11-26 10:47:57,824 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 40 states, 40 states have (on average 1.575) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:00,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:48:00,095 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2023-11-26 10:48:00,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-26 10:48:00,096 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.575) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 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 [2023-11-26 10:48:00,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:48:00,098 INFO L225 Difference]: With dead ends: 59 [2023-11-26 10:48:00,098 INFO L226 Difference]: Without dead ends: 57 [2023-11-26 10:48:00,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=294, Invalid=1968, Unknown=10, NotChecked=380, Total=2652 [2023-11-26 10:48:00,101 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 90 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:48:00,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 209 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 632 Invalid, 0 Unknown, 272 Unchecked, 1.1s Time] [2023-11-26 10:48:00,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-26 10:48:00,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 37. [2023-11-26 10:48:00,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:00,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2023-11-26 10:48:00,112 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 23 [2023-11-26 10:48:00,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:48:00,112 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2023-11-26 10:48:00,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.575) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:00,113 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2023-11-26 10:48:00,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-26 10:48:00,114 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:48:00,115 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:48:00,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-26 10:48:00,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:48:00,325 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:48:00,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:00,325 INFO L85 PathProgramCache]: Analyzing trace with hash -215542309, now seen corresponding path program 1 times [2023-11-26 10:48:00,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:00,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995440524] [2023-11-26 10:48:00,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:00,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-26 10:48:00,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:00,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995440524] [2023-11-26 10:48:00,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995440524] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:48:00,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590857949] [2023-11-26 10:48:00,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:00,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:48:00,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:48:00,516 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:48:00,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-26 10:48:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:00,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-26 10:48:00,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:48:00,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-26 10:48:00,773 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:48:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-26 10:48:00,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590857949] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:48:00,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:48:00,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-11-26 10:48:00,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64902217] [2023-11-26 10:48:00,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:48:00,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:48:00,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:00,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:48:00,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:48:00,859 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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) [2023-11-26 10:48:01,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:48:01,020 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2023-11-26 10:48:01,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:48:01,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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 24 [2023-11-26 10:48:01,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:48:01,021 INFO L225 Difference]: With dead ends: 53 [2023-11-26 10:48:01,021 INFO L226 Difference]: Without dead ends: 42 [2023-11-26 10:48:01,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-26 10:48:01,022 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:48:01,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 121 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:48:01,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-26 10:48:01,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2023-11-26 10:48:01,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 37 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2023-11-26 10:48:01,030 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 24 [2023-11-26 10:48:01,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:48:01,030 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2023-11-26 10:48:01,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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) [2023-11-26 10:48:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2023-11-26 10:48:01,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-26 10:48:01,031 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:48:01,031 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:48:01,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-26 10:48:01,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:48:01,238 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:48:01,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:01,238 INFO L85 PathProgramCache]: Analyzing trace with hash -158284007, now seen corresponding path program 1 times [2023-11-26 10:48:01,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:01,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956868381] [2023-11-26 10:48:01,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:01,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:48:01,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:01,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956868381] [2023-11-26 10:48:01,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956868381] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:48:01,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769281693] [2023-11-26 10:48:01,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:01,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:48:01,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:48:01,505 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:48:01,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-26 10:48:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:01,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-26 10:48:01,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:48:01,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-26 10:48:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:48:01,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:48:01,898 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 8 treesize of output 4 [2023-11-26 10:48:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:48:01,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769281693] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:48:01,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:48:01,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-11-26 10:48:01,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796990502] [2023-11-26 10:48:01,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:48:01,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-26 10:48:01,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:01,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-26 10:48:01,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-11-26 10:48:01,909 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 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) [2023-11-26 10:48:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:48:02,118 INFO L93 Difference]: Finished difference Result 69 states and 97 transitions. [2023-11-26 10:48:02,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:48:02,121 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 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 24 [2023-11-26 10:48:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:48:02,122 INFO L225 Difference]: With dead ends: 69 [2023-11-26 10:48:02,122 INFO L226 Difference]: Without dead ends: 38 [2023-11-26 10:48:02,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2023-11-26 10:48:02,124 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 92 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:48:02,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 164 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:48:02,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-26 10:48:02,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2023-11-26 10:48:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2023-11-26 10:48:02,131 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 24 [2023-11-26 10:48:02,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:48:02,132 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2023-11-26 10:48:02,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 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) [2023-11-26 10:48:02,132 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2023-11-26 10:48:02,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-26 10:48:02,133 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:48:02,133 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:48:02,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-26 10:48:02,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:48:02,340 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:48:02,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:02,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1047394134, now seen corresponding path program 1 times [2023-11-26 10:48:02,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:02,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653632492] [2023-11-26 10:48:02,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:02,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:48:02,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:02,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653632492] [2023-11-26 10:48:02,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653632492] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:48:02,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614538240] [2023-11-26 10:48:02,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:02,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:48:02,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:48:02,531 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:48:02,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-26 10:48:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:02,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-26 10:48:02,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:48:02,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-26 10:48:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:48:02,850 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:48:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:48:02,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614538240] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-26 10:48:02,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-26 10:48:02,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 11 [2023-11-26 10:48:02,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412675470] [2023-11-26 10:48:02,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:48:02,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:48:02,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:02,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:48:02,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-26 10:48:02,931 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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) [2023-11-26 10:48:03,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:48:03,091 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2023-11-26 10:48:03,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:48:03,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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 24 [2023-11-26 10:48:03,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:48:03,092 INFO L225 Difference]: With dead ends: 58 [2023-11-26 10:48:03,093 INFO L226 Difference]: Without dead ends: 51 [2023-11-26 10:48:03,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-26 10:48:03,094 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:48:03,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 103 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:48:03,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-26 10:48:03,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2023-11-26 10:48:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:03,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2023-11-26 10:48:03,101 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 24 [2023-11-26 10:48:03,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:48:03,101 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2023-11-26 10:48:03,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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) [2023-11-26 10:48:03,102 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2023-11-26 10:48:03,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-26 10:48:03,102 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:48:03,102 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:48:03,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-26 10:48:03,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-26 10:48:03,315 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:48:03,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:03,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1628918440, now seen corresponding path program 2 times [2023-11-26 10:48:03,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:03,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414408928] [2023-11-26 10:48:03,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:03,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-26 10:48:03,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:03,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414408928] [2023-11-26 10:48:03,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414408928] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:48:03,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:48:03,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:48:03,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465453501] [2023-11-26 10:48:03,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:48:03,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:48:03,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:03,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:48:03,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:48:03,530 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:03,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:48:03,563 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2023-11-26 10:48:03,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:48:03,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-26 10:48:03,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:48:03,565 INFO L225 Difference]: With dead ends: 48 [2023-11-26 10:48:03,565 INFO L226 Difference]: Without dead ends: 31 [2023-11-26 10:48:03,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:48:03,567 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 30 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 44 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 [2023-11-26 10:48:03,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 44 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:48:03,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-26 10:48:03,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-26 10:48:03,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 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) [2023-11-26 10:48:03,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-11-26 10:48:03,580 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 24 [2023-11-26 10:48:03,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:48:03,580 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-26 10:48:03,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:03,581 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-11-26 10:48:03,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-26 10:48:03,582 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:48:03,582 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:48:03,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:48:03,582 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:48:03,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:03,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1888805217, now seen corresponding path program 1 times [2023-11-26 10:48:03,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:03,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959524932] [2023-11-26 10:48:03,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:03,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:03,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-26 10:48:03,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:03,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959524932] [2023-11-26 10:48:03,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959524932] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:48:03,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193906562] [2023-11-26 10:48:03,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:03,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:48:03,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:48:03,894 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:48:03,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-26 10:48:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:04,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-26 10:48:04,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:48:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-26 10:48:04,197 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:48:04,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-26 10:48:04,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193906562] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:48:04,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:48:04,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-26 10:48:04,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260499387] [2023-11-26 10:48:04,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:48:04,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-26 10:48:04,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:04,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 10:48:04,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-26 10:48:04,243 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:04,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:48:04,315 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2023-11-26 10:48:04,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:48:04,316 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-26 10:48:04,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:48:04,318 INFO L225 Difference]: With dead ends: 41 [2023-11-26 10:48:04,319 INFO L226 Difference]: Without dead ends: 32 [2023-11-26 10:48:04,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-11-26 10:48:04,323 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:48:04,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 100 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:48:04,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-26 10:48:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-11-26 10:48:04,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 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) [2023-11-26 10:48:04,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-11-26 10:48:04,335 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 25 [2023-11-26 10:48:04,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:48:04,337 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-11-26 10:48:04,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:48:04,338 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-11-26 10:48:04,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-26 10:48:04,343 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:48:04,344 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:48:04,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-26 10:48:04,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-26 10:48:04,552 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:48:04,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:04,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1576525531, now seen corresponding path program 1 times [2023-11-26 10:48:04,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:04,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562656570] [2023-11-26 10:48:04,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:04,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:48:07,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:07,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562656570] [2023-11-26 10:48:07,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562656570] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:48:07,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492206835] [2023-11-26 10:48:07,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:07,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:48:07,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:48:07,371 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:48:07,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305f3b1-70d2-40f1-b834-bfcdb6b8f7bf/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-26 10:48:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:08,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 107 conjunts are in the unsatisfiable core [2023-11-26 10:48:08,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:48:08,096 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 [2023-11-26 10:48:08,187 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-26 10:48:08,187 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 [2023-11-26 10:48:08,263 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 18 treesize of output 7 [2023-11-26 10:48:08,334 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-26 10:48:08,335 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 [2023-11-26 10:48:08,510 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-26 10:48:08,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-26 10:48:08,653 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 37 treesize of output 26 [2023-11-26 10:48:08,672 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 11 treesize of output 7 [2023-11-26 10:48:08,935 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 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-26 10:48:08,939 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 20 treesize of output 15 [2023-11-26 10:48:08,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 10:48:08,953 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 40 treesize of output 22 [2023-11-26 10:48:08,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 11 [2023-11-26 10:48:08,975 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 35 [2023-11-26 10:48:08,986 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 20 treesize of output 15 [2023-11-26 10:48:09,085 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 65 treesize of output 40 [2023-11-26 10:48:09,097 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 22 treesize of output 17 [2023-11-26 10:48:09,104 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 25 treesize of output 24 [2023-11-26 10:48:09,230 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 7 treesize of output 3 [2023-11-26 10:48:09,236 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 58 treesize of output 38 [2023-11-26 10:48:09,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 22 [2023-11-26 10:48:09,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-11-26 10:48:09,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-26 10:48:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:48:09,447 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:48:09,549 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1465 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse0 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) .cse1) .cse2))))) is different from false [2023-11-26 10:48:09,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 10:48:09,576 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 131 treesize of output 122 [2023-11-26 10:48:09,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 10:48:09,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1324 treesize of output 1328 [2023-11-26 10:48:09,637 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 1046 treesize of output 1014 [2023-11-26 10:48:09,691 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 8 treesize of output 4 [2023-11-26 10:48:09,751 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 8 treesize of output 4 [2023-11-26 10:48:09,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 10:48:09,939 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 1031 treesize of output 1011 [2023-11-26 10:48:12,489 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse41 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse19 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse27 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse19)) (.cse15 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse16 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse20 (+ .cse41 4))) (let ((.cse12 (= .cse19 |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse22 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (let ((.cse74 (select (store (let ((.cse75 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1462))) (store .cse75 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse75 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse15 v_DerPreprocessor_4) .cse16 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) (select (select (let ((.cse76 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse76 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse76 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse74 v_arrayElimCell_63)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse74 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))))) (.cse23 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse72 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1462))) (store .cse72 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse72 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse15 v_DerPreprocessor_4) .cse16 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) (select (select (let ((.cse73 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse73 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse73 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)) v_arrayElimCell_63)) (= .cse41 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4))))) (.cse28 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse70 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1462))) (store .cse70 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse70 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse15 v_DerPreprocessor_4) .cse16 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) (select (select (let ((.cse71 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse71 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse71 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)) v_arrayElimCell_63)))) (.cse5 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (let ((.cse67 (select (store (let ((.cse68 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1462))) (store .cse68 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse68 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse15 v_DerPreprocessor_4) .cse16 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) (select (select (let ((.cse69 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse69 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse69 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse67 v_arrayElimCell_59)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse67 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))))) (.cse8 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (or (= .cse41 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse65 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1462))) (store .cse65 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse65 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse15 v_DerPreprocessor_4) .cse16 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) (select (select (let ((.cse66 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse66 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse66 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)) v_arrayElimCell_59))))) (.cse3 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse37 (not .cse27))) (let ((.cse6 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (let ((.cse62 (select (store (let ((.cse63 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1462))) (store .cse63 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse63 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse15 v_DerPreprocessor_4) .cse16 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) (select (select (let ((.cse64 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse64 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse64 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= .cse41 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse62 v_arrayElimCell_59)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse62 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))))) (.cse30 (= .cse19 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|)) (.cse0 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse60 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1462))) (store .cse60 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse60 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse15 v_DerPreprocessor_4) .cse16 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) (select (select (let ((.cse61 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse61 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse61 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))) (.cse2 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (or (= .cse41 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse58 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1462))) (store .cse58 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse58 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse15 v_DerPreprocessor_4) .cse16 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) (select (select (let ((.cse59 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse59 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse59 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))) (.cse31 (or .cse37 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse56 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1462))) (store .cse56 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse56 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse15 v_DerPreprocessor_4) .cse16 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) (select (select (let ((.cse57 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse57 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse57 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)) v_arrayElimCell_59))))) (.cse35 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (let ((.cse53 (select (store (let ((.cse54 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1462))) (store .cse54 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse54 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse15 v_DerPreprocessor_4) .cse16 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) (select (select (let ((.cse55 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse55 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse55 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse53 v_arrayElimCell_63)) (forall ((v_arrayElimCell_59 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse53 v_arrayElimCell_59))))))) (.cse9 (not .cse3)) (.cse10 (and .cse5 .cse8)) (.cse36 (or .cse27 .cse28)) (.cse11 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (let ((.cse50 (select (store (let ((.cse51 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1462))) (store .cse51 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse51 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse15 v_DerPreprocessor_4) .cse16 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) (select (select (let ((.cse52 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse52 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse52 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse50 v_arrayElimCell_63)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse50 v_arrayElimCell_59)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse50 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))))) (.cse29 (and .cse22 .cse23)) (.cse1 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse48 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1462))) (store .cse48 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse48 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse15 v_DerPreprocessor_4) .cse16 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) (select (select (let ((.cse49 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse49 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse49 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))) (.cse21 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (let ((.cse45 (select (store (let ((.cse46 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1462))) (store .cse46 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse46 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse15 v_DerPreprocessor_4) .cse16 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) (select (select (let ((.cse47 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse47 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse47 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 v_arrayElimCell_63)) (= .cse41 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 v_arrayElimCell_59)))))) (.cse7 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (let ((.cse42 (select (store (let ((.cse43 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1462))) (store .cse43 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse43 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse15 v_DerPreprocessor_4) .cse16 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) (select (select (let ((.cse44 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse44 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse44 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse42 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= (select .cse42 v_arrayElimCell_59) |c_ULTIMATE.start_main_~uneq~0#1|))))) (.cse4 (not .cse12))) (and (or (and .cse0 .cse1 .cse2) .cse3 .cse4) (or .cse4 (and .cse5 .cse6 .cse7)) (or (and .cse5 .cse1 .cse6 (or .cse8 .cse9)) .cse4) (or (and (or (and (or .cse4 .cse10) .cse11 (or .cse12 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (let ((.cse13 (select (store (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1462))) (store .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse15 v_DerPreprocessor_4) .cse16 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) (select (select (let ((.cse17 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse17 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 v_arrayElimCell_63)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 v_arrayElimCell_59)))))) .cse21) .cse9) (or .cse3 .cse4 (and .cse22 .cse23 .cse1)) (or .cse4 (and .cse11 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1462))) (store .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse15 v_DerPreprocessor_4) .cse16 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) (select (select (let ((.cse26 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse26 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse26 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= (select .cse24 v_arrayElimCell_63) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))) .cse1 .cse21 (or .cse9 .cse10))) (or .cse27 (and (or .cse9 .cse28) (or .cse29 .cse4))) (or .cse4 (and .cse11 .cse21 .cse7))) .cse30) (or .cse9 (and .cse5 (or .cse4 .cse8) .cse6)) (or .cse12 (and .cse31 (or .cse27 .cse0) (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (let ((.cse32 (select (store (let ((.cse33 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1462))) (store .cse33 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse33 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse15 v_DerPreprocessor_4) .cse16 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) (select (select (let ((.cse34 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse34 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse34 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (forall ((v_arrayElimCell_59 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 v_arrayElimCell_59))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))) (or .cse30 (and .cse35 .cse36)))) (or .cse27 (and (or .cse0 .cse9) (or .cse4 (and .cse0 .cse2)))) (or (and (or .cse12 (and .cse31 .cse35 .cse36)) (or .cse9 (and .cse11 (or .cse37 .cse10) .cse36 (or .cse37 .cse1) (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (let ((.cse38 (select (store (let ((.cse39 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1462))) (store .cse39 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse39 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse15 v_DerPreprocessor_4) .cse16 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) (select (select (let ((.cse40 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse40 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse40 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse38 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (forall ((v_arrayElimCell_63 Int)) (= (select .cse38 v_arrayElimCell_63) |c_ULTIMATE.start_main_~uneq~0#1|))))) .cse21)) (or (and .cse11 (or .cse29 .cse3) .cse1 .cse21 .cse7) .cse4)) (= .cse41 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|))))))) is different from false [2023-11-26 10:48:15,892 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse19 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse42 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse78 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse79 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse14 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse15 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse16 (select .cse78 .cse79)) (.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse78 .cse79 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse20 (+ .cse42 4)) (.cse7 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse19))) (let ((.cse38 (not .cse7)) (.cse25 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_subst_1 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse76 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse76 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse76 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse77 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse77 .cse16 (store (select .cse77 .cse16) (+ 8 v_subst_1) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)) v_arrayElimCell_63)))) (.cse28 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse16)) (.cse2 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_subst_8 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (or (= (+ 4 v_subst_8) .cse42) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse74 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse74 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse74 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse75 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse75 .cse16 (store (select .cse75 .cse16) (+ 8 v_subst_8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)) v_arrayElimCell_59))))) (.cse4 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_subst_9 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (let ((.cse71 (select (store (let ((.cse72 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse72 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse72 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse73 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse73 .cse16 (store (select .cse73 .cse16) (+ 8 v_subst_9) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse71 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse71 v_arrayElimCell_59)))))) (.cse26 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_subst_11 Int)) (or (= .cse42 (+ v_subst_11 4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse69 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse69 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse69 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse70 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse70 .cse16 (store (select .cse70 .cse16) (+ v_subst_11 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)) v_arrayElimCell_63))))) (.cse27 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_subst_10 Int)) (let ((.cse66 (select (store (let ((.cse67 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse67 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse67 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse68 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse68 .cse16 (store (select .cse68 .cse16) (+ v_subst_10 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse66 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse66 v_arrayElimCell_63)))))) (.cse10 (= .cse16 .cse19))) (let ((.cse5 (forall ((v_subst_14 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (let ((.cse63 (select (store (let ((.cse64 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse64 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse64 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse65 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse65 .cse16 (store (select .cse65 .cse16) (+ v_subst_14 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse63 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= .cse42 (+ v_subst_14 4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse63 v_arrayElimCell_59)))))) (.cse23 (= .cse19 |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse9 (forall ((v_subst_13 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse61 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse61 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse61 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse62 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse62 .cse16 (store (select .cse62 .cse16) (+ v_subst_13 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= .cse42 (+ v_subst_13 4))))) (.cse8 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_subst_5 Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse59 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse59 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse59 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse60 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse60 .cse16 (store (select .cse60 .cse16) (+ 8 v_subst_5) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))) (.cse0 (not .cse10)) (.cse24 (and .cse26 .cse27)) (.cse6 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (let ((.cse56 (select (store (let ((.cse57 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse57 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse57 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse58 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse58 .cse16 (store (select .cse58 .cse16) .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= (select .cse56 v_arrayElimCell_59) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse56 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))))) (.cse29 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_subst_6 Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (let ((.cse53 (select (store (let ((.cse54 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse54 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse54 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse55 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse55 .cse16 (store (select .cse55 .cse16) (+ 8 v_subst_6) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse53 v_arrayElimCell_59)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse53 v_arrayElimCell_63)) (= .cse42 (+ 4 v_subst_6)))))) (.cse31 (and .cse2 .cse4)) (.cse30 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_subst_7 Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (let ((.cse50 (select (store (let ((.cse51 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse51 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse51 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse52 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse52 .cse16 (store (select .cse52 .cse16) (+ 8 v_subst_7) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse50 v_arrayElimCell_59)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse50 v_arrayElimCell_63)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse50 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))))) (.cse3 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse48 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse48 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse48 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse49 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse49 .cse16 (store (select .cse49 .cse16) .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))) (.cse1 (not .cse28)) (.cse21 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_subst_2 Int)) (let ((.cse45 (select (store (let ((.cse46 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse46 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse46 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse47 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse47 .cse16 (store (select .cse47 .cse16) (+ 8 v_subst_2) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 v_arrayElimCell_63)) (forall ((v_arrayElimCell_59 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 v_arrayElimCell_59))))))) (.cse22 (or .cse7 .cse25)) (.cse11 (or .cse38 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_subst_3 Int) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (= (select (select (store (let ((.cse43 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse43 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse43 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse44 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse44 .cse16 (store (select .cse44 .cse16) (+ 8 v_subst_3) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)) v_arrayElimCell_59) |c_ULTIMATE.start_main_~uneq~0#1|))))) (and (or .cse0 (and (or .cse1 .cse2) .cse3 .cse4 .cse5)) (or .cse0 (and .cse4 .cse6 .cse5)) (or (and .cse4 (or .cse0 .cse2) .cse5) .cse1) (or .cse7 (and (or .cse1 .cse8) (or .cse0 (and .cse9 .cse8)))) (or .cse10 (and .cse11 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse17 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse17 .cse16 (store (select .cse17 .cse16) (+ 8 v_subst_4) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (forall ((v_arrayElimCell_59 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 v_arrayElimCell_59)))))) (or (and .cse21 .cse22) .cse23) (or .cse7 .cse8))) (or (and (or .cse7 (and (or .cse24 .cse0) (or .cse1 .cse25))) (or (and .cse26 .cse3 .cse27) .cse0 .cse28) (or .cse0 (and .cse29 .cse30 .cse6)) (or .cse0 (and .cse29 .cse3 (or .cse1 .cse31) .cse30 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (let ((.cse32 (select (store (let ((.cse33 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse33 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse33 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse34 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse34 .cse16 (store (select .cse34 .cse16) .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= (select .cse32 v_arrayElimCell_63) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (or .cse1 (and .cse29 (or .cse0 .cse31) (or .cse10 (forall ((v_arrayElimCell_63 Int) (v_subst_12 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse36 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse36 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse37 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse37 .cse16 (store (select .cse37 .cse16) (+ v_subst_12 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 v_arrayElimCell_59)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 v_arrayElimCell_63)))))) .cse30))) .cse23) (or .cse0 (and .cse3 .cse9 .cse8) .cse28) (or (and (or .cse0 (and .cse29 (or .cse24 .cse28) .cse3 .cse30 .cse6)) (or (and .cse29 .cse22 (or .cse38 .cse31) .cse30 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (let ((.cse39 (select (store (let ((.cse40 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse40 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse40 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse41 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse41 .cse16 (store (select .cse41 .cse16) .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (forall ((v_arrayElimCell_63 Int)) (= (select .cse39 v_arrayElimCell_63) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse39 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))) (or .cse38 .cse3)) .cse1) (or (and .cse21 .cse22 .cse11) .cse10)) (= .cse42 |c_ULTIMATE.start_dll_insert_~last~0#1.offset|))))))) is different from false [2023-11-26 10:48:19,906 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse19 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse42 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse78 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse79 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse14 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse15 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse16 (select .cse78 .cse79)) (.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse78 .cse79 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse20 (+ .cse42 4)) (.cse7 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse19))) (let ((.cse38 (not .cse7)) (.cse25 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_subst_1 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse76 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse76 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse76 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse77 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse77 .cse16 (store (select .cse77 .cse16) (+ 8 v_subst_1) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)) v_arrayElimCell_63)))) (.cse28 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse16)) (.cse2 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_subst_8 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (or (= (+ 4 v_subst_8) .cse42) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse74 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse74 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse74 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse75 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse75 .cse16 (store (select .cse75 .cse16) (+ 8 v_subst_8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)) v_arrayElimCell_59))))) (.cse4 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_subst_9 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (let ((.cse71 (select (store (let ((.cse72 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse72 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse72 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse73 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse73 .cse16 (store (select .cse73 .cse16) (+ 8 v_subst_9) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse71 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse71 v_arrayElimCell_59)))))) (.cse26 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_subst_11 Int)) (or (= .cse42 (+ v_subst_11 4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse69 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse69 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse69 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse70 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse70 .cse16 (store (select .cse70 .cse16) (+ v_subst_11 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)) v_arrayElimCell_63))))) (.cse27 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_subst_10 Int)) (let ((.cse66 (select (store (let ((.cse67 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse67 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse67 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse68 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse68 .cse16 (store (select .cse68 .cse16) (+ v_subst_10 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse66 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse66 v_arrayElimCell_63)))))) (.cse10 (= .cse16 .cse19))) (let ((.cse5 (forall ((v_subst_14 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (let ((.cse63 (select (store (let ((.cse64 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse64 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse64 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse65 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse65 .cse16 (store (select .cse65 .cse16) (+ v_subst_14 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse63 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= .cse42 (+ v_subst_14 4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse63 v_arrayElimCell_59)))))) (.cse23 (= .cse19 |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse9 (forall ((v_subst_13 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse61 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse61 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse61 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse62 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse62 .cse16 (store (select .cse62 .cse16) (+ v_subst_13 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= .cse42 (+ v_subst_13 4))))) (.cse8 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_subst_5 Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse59 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse59 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse59 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse60 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse60 .cse16 (store (select .cse60 .cse16) (+ 8 v_subst_5) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))) (.cse0 (not .cse10)) (.cse24 (and .cse26 .cse27)) (.cse6 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (let ((.cse56 (select (store (let ((.cse57 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse57 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse57 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse58 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse58 .cse16 (store (select .cse58 .cse16) .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= (select .cse56 v_arrayElimCell_59) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse56 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))))) (.cse29 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_subst_6 Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (let ((.cse53 (select (store (let ((.cse54 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse54 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse54 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse55 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse55 .cse16 (store (select .cse55 .cse16) (+ 8 v_subst_6) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse53 v_arrayElimCell_59)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse53 v_arrayElimCell_63)) (= .cse42 (+ 4 v_subst_6)))))) (.cse31 (and .cse2 .cse4)) (.cse30 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_subst_7 Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (let ((.cse50 (select (store (let ((.cse51 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse51 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse51 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse52 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse52 .cse16 (store (select .cse52 .cse16) (+ 8 v_subst_7) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse50 v_arrayElimCell_59)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse50 v_arrayElimCell_63)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse50 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))))) (.cse3 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse48 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse48 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse48 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse49 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse49 .cse16 (store (select .cse49 .cse16) .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))) (.cse1 (not .cse28)) (.cse21 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_subst_2 Int)) (let ((.cse45 (select (store (let ((.cse46 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse46 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse46 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse47 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse47 .cse16 (store (select .cse47 .cse16) (+ 8 v_subst_2) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 v_arrayElimCell_63)) (forall ((v_arrayElimCell_59 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 v_arrayElimCell_59))))))) (.cse22 (or .cse7 .cse25)) (.cse11 (or .cse38 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_subst_3 Int) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (= (select (select (store (let ((.cse43 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse43 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse43 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse44 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse44 .cse16 (store (select .cse44 .cse16) (+ 8 v_subst_3) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)) v_arrayElimCell_59) |c_ULTIMATE.start_main_~uneq~0#1|))))) (and (or .cse0 (and (or .cse1 .cse2) .cse3 .cse4 .cse5)) (or .cse0 (and .cse4 .cse6 .cse5)) (or (and .cse4 (or .cse0 .cse2) .cse5) .cse1) (or .cse7 (and (or .cse1 .cse8) (or .cse0 (and .cse9 .cse8)))) (or .cse10 (and .cse11 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse17 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse17 .cse16 (store (select .cse17 .cse16) (+ 8 v_subst_4) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (forall ((v_arrayElimCell_59 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 v_arrayElimCell_59)))))) (or (and .cse21 .cse22) .cse23) (or .cse7 .cse8))) (or (and (or .cse7 (and (or .cse24 .cse0) (or .cse1 .cse25))) (or (and .cse26 .cse3 .cse27) .cse0 .cse28) (or .cse0 (and .cse29 .cse30 .cse6)) (or .cse0 (and .cse29 .cse3 (or .cse1 .cse31) .cse30 (forall ((v_arrayElimCell_63 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (let ((.cse32 (select (store (let ((.cse33 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse33 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse33 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse34 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse34 .cse16 (store (select .cse34 .cse16) .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= (select .cse32 v_arrayElimCell_63) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (or .cse1 (and .cse29 (or .cse0 .cse31) (or .cse10 (forall ((v_arrayElimCell_63 Int) (v_subst_12 Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_59 Int)) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse36 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse36 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse37 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse37 .cse16 (store (select .cse37 .cse16) (+ v_subst_12 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 v_arrayElimCell_59)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 v_arrayElimCell_63)))))) .cse30))) .cse23) (or .cse0 (and .cse3 .cse9 .cse8) .cse28) (or (and (or .cse0 (and .cse29 (or .cse24 .cse28) .cse3 .cse30 .cse6)) (or (and .cse29 .cse22 (or .cse38 .cse31) .cse30 (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (let ((.cse39 (select (store (let ((.cse40 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462))) (store .cse40 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse40 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse14 v_DerPreprocessor_4) .cse15 v_ArrVal_1461))) .cse16 v_ArrVal_1465) (select (select (let ((.cse41 (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1457))) (store .cse41 .cse16 (store (select .cse41 .cse16) .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse19) .cse20)))) (or (forall ((v_arrayElimCell_63 Int)) (= (select .cse39 v_arrayElimCell_63) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse39 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))) (or .cse38 .cse3)) .cse1) (or (and .cse21 .cse22 .cse11) .cse10)) (= .cse42 |c_ULTIMATE.start_dll_insert_~last~0#1.offset|))))))) is different from true