./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 13:07:47,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 13:07:47,527 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 13:07:47,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 13:07:47,536 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 13:07:47,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 13:07:47,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 13:07:47,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 13:07:47,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 13:07:47,566 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 13:07:47,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 13:07:47,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 13:07:47,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 13:07:47,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 13:07:47,569 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 13:07:47,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 13:07:47,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 13:07:47,571 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 13:07:47,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 13:07:47,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 13:07:47,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 13:07:47,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 13:07:47,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 13:07:47,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 13:07:47,577 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 13:07:47,577 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 13:07:47,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 13:07:47,577 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 13:07:47,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 13:07:47,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 13:07:47,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 13:07:47,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 13:07:47,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:07:47,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 13:07:47,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 13:07:47,580 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 13:07:47,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 13:07:47,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 13:07:47,581 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 13:07:47,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 13:07:47,582 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 13:07:47,582 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 13:07:47,583 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2024-11-18 13:07:47,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 13:07:47,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 13:07:47,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 13:07:47,874 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 13:07:47,874 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 13:07:47,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-11-18 13:07:49,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 13:07:49,679 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 13:07:49,680 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-11-18 13:07:49,707 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2b93118/6030053f01624d409668099b441c8448/FLAG390fabdf1 [2024-11-18 13:07:50,011 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2b93118/6030053f01624d409668099b441c8448 [2024-11-18 13:07:50,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 13:07:50,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 13:07:50,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 13:07:50,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 13:07:50,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 13:07:50,026 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:07:50" (1/1) ... [2024-11-18 13:07:50,029 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1140ddf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:50, skipping insertion in model container [2024-11-18 13:07:50,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:07:50" (1/1) ... [2024-11-18 13:07:50,082 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 13:07:50,487 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2024-11-18 13:07:50,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:07:50,501 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 13:07:50,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2024-11-18 13:07:50,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:07:50,601 INFO L204 MainTranslator]: Completed translation [2024-11-18 13:07:50,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:50 WrapperNode [2024-11-18 13:07:50,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 13:07:50,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 13:07:50,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 13:07:50,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 13:07:50,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:50" (1/1) ... [2024-11-18 13:07:50,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:50" (1/1) ... [2024-11-18 13:07:50,659 INFO L138 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 187 [2024-11-18 13:07:50,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 13:07:50,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 13:07:50,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 13:07:50,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 13:07:50,669 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:50" (1/1) ... [2024-11-18 13:07:50,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:50" (1/1) ... [2024-11-18 13:07:50,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:50" (1/1) ... [2024-11-18 13:07:50,697 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 26, 12]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 17, 1]. [2024-11-18 13:07:50,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:50" (1/1) ... [2024-11-18 13:07:50,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:50" (1/1) ... [2024-11-18 13:07:50,706 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:50" (1/1) ... [2024-11-18 13:07:50,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:50" (1/1) ... [2024-11-18 13:07:50,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:50" (1/1) ... [2024-11-18 13:07:50,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:50" (1/1) ... [2024-11-18 13:07:50,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 13:07:50,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 13:07:50,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 13:07:50,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 13:07:50,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:50" (1/1) ... [2024-11-18 13:07:50,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:07:50,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:07:50,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 13:07:50,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 13:07:50,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 13:07:50,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 13:07:50,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-18 13:07:50,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-18 13:07:50,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-18 13:07:50,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-18 13:07:50,831 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-18 13:07:50,831 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-18 13:07:50,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-18 13:07:50,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 13:07:50,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 13:07:50,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-18 13:07:50,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-18 13:07:50,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-18 13:07:50,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-18 13:07:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-18 13:07:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-18 13:07:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 13:07:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-18 13:07:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-18 13:07:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-18 13:07:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 13:07:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 13:07:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-18 13:07:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 13:07:50,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 13:07:50,990 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 13:07:50,992 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 13:07:51,283 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-18 13:07:51,284 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 13:07:51,300 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 13:07:51,300 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-18 13:07:51,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:07:51 BoogieIcfgContainer [2024-11-18 13:07:51,301 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 13:07:51,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 13:07:51,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 13:07:51,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 13:07:51,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:07:50" (1/3) ... [2024-11-18 13:07:51,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe43df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:07:51, skipping insertion in model container [2024-11-18 13:07:51,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:50" (2/3) ... [2024-11-18 13:07:51,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe43df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:07:51, skipping insertion in model container [2024-11-18 13:07:51,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:07:51" (3/3) ... [2024-11-18 13:07:51,310 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2024-11-18 13:07:51,323 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 13:07:51,324 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 13:07:51,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 13:07:51,390 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@65f7b85d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 13:07:51,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 13:07:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 13:07:51,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-18 13:07:51,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:07:51,405 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:07:51,409 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:07:51,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:07:51,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1243287101, now seen corresponding path program 1 times [2024-11-18 13:07:51,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:07:51,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604325525] [2024-11-18 13:07:51,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:07:51,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:07:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:07:51,721 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 13:07:51,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:07:51,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604325525] [2024-11-18 13:07:51,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604325525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:07:51,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:07:51,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 13:07:51,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873563859] [2024-11-18 13:07:51,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:07:51,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 13:07:51,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:07:51,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 13:07:51,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:07:51,751 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 13:07:51,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:07:51,768 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2024-11-18 13:07:51,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 13:07:51,771 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-11-18 13:07:51,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:07:51,778 INFO L225 Difference]: With dead ends: 79 [2024-11-18 13:07:51,779 INFO L226 Difference]: Without dead ends: 36 [2024-11-18 13:07:51,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:07:51,785 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:07:51,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:07:51,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-18 13:07:51,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-18 13:07:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 13:07:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2024-11-18 13:07:51,830 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 25 [2024-11-18 13:07:51,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:07:51,832 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2024-11-18 13:07:51,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 13:07:51,832 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2024-11-18 13:07:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-18 13:07:51,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:07:51,834 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:07:51,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 13:07:51,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:07:51,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:07:51,835 INFO L85 PathProgramCache]: Analyzing trace with hash -709703190, now seen corresponding path program 1 times [2024-11-18 13:07:51,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:07:51,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270081860] [2024-11-18 13:07:51,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:07:51,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:07:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:07:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 13:07:52,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:07:52,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270081860] [2024-11-18 13:07:52,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270081860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:07:52,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:07:52,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 13:07:52,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417578435] [2024-11-18 13:07:52,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:07:52,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 13:07:52,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:07:52,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 13:07:52,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:07:52,134 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 13:07:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:07:52,160 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2024-11-18 13:07:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 13:07:52,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-11-18 13:07:52,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:07:52,163 INFO L225 Difference]: With dead ends: 68 [2024-11-18 13:07:52,163 INFO L226 Difference]: Without dead ends: 41 [2024-11-18 13:07:52,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:07:52,165 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:07:52,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 85 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:07:52,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-18 13:07:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2024-11-18 13:07:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 13:07:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2024-11-18 13:07:52,175 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 25 [2024-11-18 13:07:52,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:07:52,176 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2024-11-18 13:07:52,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 13:07:52,177 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2024-11-18 13:07:52,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-18 13:07:52,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:07:52,179 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:07:52,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 13:07:52,180 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:07:52,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:07:52,181 INFO L85 PathProgramCache]: Analyzing trace with hash -37646058, now seen corresponding path program 1 times [2024-11-18 13:07:52,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:07:52,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029357064] [2024-11-18 13:07:52,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:07:52,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:07:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:07:52,368 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-18 13:07:52,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:07:52,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029357064] [2024-11-18 13:07:52,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029357064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:07:52,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:07:52,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 13:07:52,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170559120] [2024-11-18 13:07:52,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:07:52,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 13:07:52,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:07:52,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 13:07:52,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:07:52,376 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 13:07:52,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:07:52,406 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2024-11-18 13:07:52,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 13:07:52,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-11-18 13:07:52,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:07:52,408 INFO L225 Difference]: With dead ends: 53 [2024-11-18 13:07:52,409 INFO L226 Difference]: Without dead ends: 39 [2024-11-18 13:07:52,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:07:52,411 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:07:52,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:07:52,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-18 13:07:52,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-18 13:07:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 13:07:52,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-11-18 13:07:52,420 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 35 [2024-11-18 13:07:52,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:07:52,421 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-18 13:07:52,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 13:07:52,422 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2024-11-18 13:07:52,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-18 13:07:52,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:07:52,426 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:07:52,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 13:07:52,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:07:52,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:07:52,427 INFO L85 PathProgramCache]: Analyzing trace with hash 368663721, now seen corresponding path program 1 times [2024-11-18 13:07:52,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:07:52,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626523566] [2024-11-18 13:07:52,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:07:52,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:07:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:07:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:07:55,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:07:55,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626523566] [2024-11-18 13:07:55,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626523566] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:07:55,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334171885] [2024-11-18 13:07:55,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:07:55,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:07:55,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:07:55,455 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:07:55,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 13:07:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:07:56,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 124 conjuncts are in the unsatisfiable core [2024-11-18 13:07:56,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:07:56,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-18 13:07:56,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:07:56,543 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:07:56,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-18 13:07:56,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-18 13:07:56,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:07:56,775 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-18 13:07:56,776 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 [2024-11-18 13:07:56,789 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 [2024-11-18 13:07:57,005 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2024-11-18 13:07:57,006 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 2 case distinctions, treesize of input 94 treesize of output 48 [2024-11-18 13:07:57,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:07:57,020 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 30 treesize of output 27 [2024-11-18 13:07:57,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-18 13:07:57,296 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-18 13:07:57,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 24 [2024-11-18 13:07:57,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2024-11-18 13:07:57,316 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 15 treesize of output 7 [2024-11-18 13:07:57,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:07:57,593 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-18 13:07:57,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 46 [2024-11-18 13:07:57,616 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-18 13:07:57,617 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 [2024-11-18 13:07:57,631 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 20 treesize of output 15 [2024-11-18 13:07:57,914 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-18 13:07:57,915 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 26 [2024-11-18 13:07:58,088 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2024-11-18 13:07:58,098 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 25 treesize of output 15 [2024-11-18 13:07:58,196 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 [2024-11-18 13:07:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:07:58,294 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:08:10,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334171885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:08:10,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:08:10,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 46 [2024-11-18 13:08:10,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843848728] [2024-11-18 13:08:10,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:08:10,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-18 13:08:10,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:08:10,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-18 13:08:10,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2444, Unknown=38, NotChecked=0, Total=2652 [2024-11-18 13:08:10,108 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 46 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 37 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 13:08:12,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:08:12,661 INFO L93 Difference]: Finished difference Result 100 states and 138 transitions. [2024-11-18 13:08:12,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-18 13:08:12,662 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 37 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2024-11-18 13:08:12,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:08:12,663 INFO L225 Difference]: With dead ends: 100 [2024-11-18 13:08:12,663 INFO L226 Difference]: Without dead ends: 98 [2024-11-18 13:08:12,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=375, Invalid=5137, Unknown=38, NotChecked=0, Total=5550 [2024-11-18 13:08:12,667 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 106 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-18 13:08:12,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 468 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-18 13:08:12,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-18 13:08:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 64. [2024-11-18 13:08:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 55 states have internal predecessors, (73), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 13:08:12,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 85 transitions. [2024-11-18 13:08:12,688 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 85 transitions. Word has length 36 [2024-11-18 13:08:12,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:08:12,688 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 85 transitions. [2024-11-18 13:08:12,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 37 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 13:08:12,689 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2024-11-18 13:08:12,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-18 13:08:12,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:08:12,690 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:08:12,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 13:08:12,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:08:12,891 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:08:12,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:08:12,891 INFO L85 PathProgramCache]: Analyzing trace with hash -220702884, now seen corresponding path program 1 times [2024-11-18 13:08:12,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:08:12,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783718259] [2024-11-18 13:08:12,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:12,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:08:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:13,033 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-18 13:08:13,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:08:13,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783718259] [2024-11-18 13:08:13,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783718259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:08:13,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:08:13,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 13:08:13,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918686481] [2024-11-18 13:08:13,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:08:13,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 13:08:13,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:08:13,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 13:08:13,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 13:08:13,038 INFO L87 Difference]: Start difference. First operand 64 states and 85 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 13:08:13,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:08:13,065 INFO L93 Difference]: Finished difference Result 82 states and 107 transitions. [2024-11-18 13:08:13,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 13:08:13,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-18 13:08:13,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:08:13,066 INFO L225 Difference]: With dead ends: 82 [2024-11-18 13:08:13,066 INFO L226 Difference]: Without dead ends: 65 [2024-11-18 13:08:13,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:08:13,067 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:08:13,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 93 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:08:13,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-18 13:08:13,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-18 13:08:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 13:08:13,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2024-11-18 13:08:13,086 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 37 [2024-11-18 13:08:13,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:08:13,086 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2024-11-18 13:08:13,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 13:08:13,088 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2024-11-18 13:08:13,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-18 13:08:13,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:08:13,089 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:08:13,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 13:08:13,089 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:08:13,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:08:13,092 INFO L85 PathProgramCache]: Analyzing trace with hash 79364982, now seen corresponding path program 2 times [2024-11-18 13:08:13,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:08:13,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362885209] [2024-11-18 13:08:13,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:08:13,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:08:13,135 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:08:13,138 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:08:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 13:08:13,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:08:13,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362885209] [2024-11-18 13:08:13,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362885209] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:08:13,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378235462] [2024-11-18 13:08:13,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:08:13,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:08:13,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:08:13,311 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:08:13,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 13:08:13,540 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:08:13,541 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:08:13,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 13:08:13,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:08:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-18 13:08:13,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 13:08:13,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378235462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:08:13,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 13:08:13,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-11-18 13:08:13,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301041287] [2024-11-18 13:08:13,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:08:13,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 13:08:13,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:08:13,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 13:08:13,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 13:08:13,582 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 13:08:13,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:08:13,631 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2024-11-18 13:08:13,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 13:08:13,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-18 13:08:13,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:08:13,633 INFO L225 Difference]: With dead ends: 83 [2024-11-18 13:08:13,633 INFO L226 Difference]: Without dead ends: 65 [2024-11-18 13:08:13,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-18 13:08:13,634 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 27 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:08:13,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 133 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:08:13,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-18 13:08:13,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-18 13:08:13,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 13:08:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2024-11-18 13:08:13,644 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 37 [2024-11-18 13:08:13,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:08:13,644 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2024-11-18 13:08:13,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 13:08:13,644 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2024-11-18 13:08:13,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-18 13:08:13,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:08:13,646 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:08:13,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 13:08:13,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-18 13:08:13,847 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:08:13,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:08:13,847 INFO L85 PathProgramCache]: Analyzing trace with hash -599029201, now seen corresponding path program 1 times [2024-11-18 13:08:13,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:08:13,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54351455] [2024-11-18 13:08:13,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:13,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:08:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:13,985 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-18 13:08:13,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:08:13,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54351455] [2024-11-18 13:08:13,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54351455] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:08:13,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543763973] [2024-11-18 13:08:13,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:13,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:08:13,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:08:13,989 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:08:13,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 13:08:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:14,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-18 13:08:14,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:08:14,205 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-18 13:08:14,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:08:14,279 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-18 13:08:14,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543763973] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:08:14,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:08:14,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-18 13:08:14,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490685224] [2024-11-18 13:08:14,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:08:14,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 13:08:14,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:08:14,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 13:08:14,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-18 13:08:14,282 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 13:08:14,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:08:14,386 INFO L93 Difference]: Finished difference Result 78 states and 99 transitions. [2024-11-18 13:08:14,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 13:08:14,387 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2024-11-18 13:08:14,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:08:14,388 INFO L225 Difference]: With dead ends: 78 [2024-11-18 13:08:14,390 INFO L226 Difference]: Without dead ends: 63 [2024-11-18 13:08:14,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-18 13:08:14,390 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 2 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:08:14,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 222 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:08:14,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-18 13:08:14,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-18 13:08:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 54 states have internal predecessors, (67), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 13:08:14,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 79 transitions. [2024-11-18 13:08:14,406 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 79 transitions. Word has length 38 [2024-11-18 13:08:14,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:08:14,406 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 79 transitions. [2024-11-18 13:08:14,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 13:08:14,408 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2024-11-18 13:08:14,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-18 13:08:14,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:08:14,409 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:08:14,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 13:08:14,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:08:14,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:08:14,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:08:14,610 INFO L85 PathProgramCache]: Analyzing trace with hash -541770899, now seen corresponding path program 1 times [2024-11-18 13:08:14,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:08:14,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061411098] [2024-11-18 13:08:14,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:14,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:08:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 13:08:14,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:08:14,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061411098] [2024-11-18 13:08:14,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061411098] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:08:14,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210910929] [2024-11-18 13:08:14,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:14,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:08:14,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:08:14,914 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:08:14,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 13:08:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:15,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-18 13:08:15,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:08:15,251 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 [2024-11-18 13:08:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:08:15,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:08:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 13:08:15,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210910929] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:08:15,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:08:15,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 15 [2024-11-18 13:08:15,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94819790] [2024-11-18 13:08:15,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:08:15,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-18 13:08:15,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:08:15,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-18 13:08:15,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-18 13:08:15,332 INFO L87 Difference]: Start difference. First operand 63 states and 79 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 13:08:19,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-18 13:08:23,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-18 13:08:27,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-18 13:08:31,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-18 13:08:35,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-18 13:08:39,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-18 13:08:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:08:39,612 INFO L93 Difference]: Finished difference Result 116 states and 141 transitions. [2024-11-18 13:08:39,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-18 13:08:39,612 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2024-11-18 13:08:39,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:08:39,613 INFO L225 Difference]: With dead ends: 116 [2024-11-18 13:08:39,613 INFO L226 Difference]: Without dead ends: 66 [2024-11-18 13:08:39,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-18 13:08:39,615 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 29 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:08:39,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 401 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2024-11-18 13:08:39,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-18 13:08:39,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-18 13:08:39,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 13:08:39,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2024-11-18 13:08:39,625 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 38 [2024-11-18 13:08:39,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:08:39,626 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2024-11-18 13:08:39,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 13:08:39,626 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2024-11-18 13:08:39,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-18 13:08:39,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:08:39,627 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:08:39,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-18 13:08:39,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:08:39,832 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:08:39,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:08:39,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1955198847, now seen corresponding path program 1 times [2024-11-18 13:08:39,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:08:39,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056800515] [2024-11-18 13:08:39,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:39,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:08:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:42,083 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:08:42,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:08:42,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056800515] [2024-11-18 13:08:42,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056800515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:08:42,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831299797] [2024-11-18 13:08:42,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:42,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:08:42,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:08:42,086 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:08:42,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 13:08:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:42,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 136 conjuncts are in the unsatisfiable core [2024-11-18 13:08:42,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:08:42,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-18 13:08:42,793 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from false [2024-11-18 13:08:42,797 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from true [2024-11-18 13:08:42,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:08:42,831 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2024-11-18 13:08:42,833 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2024-11-18 13:08:42,868 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:08:42,868 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-18 13:08:42,877 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 5 treesize of output 3 [2024-11-18 13:08:42,886 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) is different from false [2024-11-18 13:08:42,889 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) is different from true [2024-11-18 13:08:42,915 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2024-11-18 13:08:42,917 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2024-11-18 13:08:42,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:08:42,954 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 43 treesize of output 22 [2024-11-18 13:08:42,987 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|))) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1))))) is different from false [2024-11-18 13:08:42,990 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|))) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1))))) is different from true [2024-11-18 13:08:43,026 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 1))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|)))))) is different from false [2024-11-18 13:08:43,030 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 1))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|)))))) is different from true [2024-11-18 13:08:43,056 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-18 13:08:43,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2024-11-18 13:08:43,077 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_30) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-18 13:08:43,080 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_30) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-18 13:08:43,111 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_30) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-18 13:08:43,114 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_30) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-18 13:08:43,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:08:43,181 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_30) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|)))) is different from false [2024-11-18 13:08:43,183 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_30) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|)))) is different from true [2024-11-18 13:08:43,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:08:43,251 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-18 13:08:43,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 36 [2024-11-18 13:08:43,315 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 1))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_30) 1)))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|)))))) is different from false [2024-11-18 13:08:43,320 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 1))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_30) 1)))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|)))))) is different from true [2024-11-18 13:08:43,406 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_30) 1)))) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|)))))) is different from false [2024-11-18 13:08:43,409 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_30) 1)))) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|)))))) is different from true [2024-11-18 13:08:43,488 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_30) 1)))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|)))))) is different from false [2024-11-18 13:08:43,492 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_30) 1)))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|)))))) is different from true [2024-11-18 13:08:43,621 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:08:43,624 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-18 13:08:43,639 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:08:43,642 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-18 13:08:43,651 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:08:43,654 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-18 13:08:43,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:08:43,667 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 61 treesize of output 22 [2024-11-18 13:08:43,678 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 45 treesize of output 41 [2024-11-18 13:08:43,699 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2024-11-18 13:08:43,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 72 [2024-11-18 13:08:43,722 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2024-11-18 13:08:43,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 80 [2024-11-18 13:08:43,726 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 9 treesize of output 7 [2024-11-18 13:08:43,735 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 49 treesize of output 19 [2024-11-18 13:08:43,746 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 41 treesize of output 15 [2024-11-18 13:08:43,784 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (v_arrayElimCell_35 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0))) (not (= .cse1 .cse0)) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_30) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) is different from false [2024-11-18 13:08:43,789 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (v_arrayElimCell_35 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0))) (not (= .cse1 .cse0)) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_30) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0)))) is different from true [2024-11-18 13:08:43,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:08:43,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 67 [2024-11-18 13:08:43,947 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (or (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_30) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0))))) is different from false [2024-11-18 13:08:43,951 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (or (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_30) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0))))) is different from true [2024-11-18 13:08:44,071 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 36 treesize of output 20 [2024-11-18 13:08:44,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-18 13:08:44,294 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_30) 1)))) (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0)) is different from false [2024-11-18 13:08:44,299 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_30) 1)))) (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0)) is different from true [2024-11-18 13:08:44,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:08:44,354 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 120 treesize of output 132 [2024-11-18 13:08:44,633 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (exists ((v_prenex_8 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_11 Int) (v_prenex_9 Int)) (and (= (select v_prenex_10 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_10 v_prenex_11) 1) (= (select v_prenex_8 v_prenex_9) 1) (= (select v_prenex_8 v_prenex_11) 0) (= (let ((.cse0 (@diff v_prenex_8 v_prenex_10))) (store v_prenex_8 .cse0 (select v_prenex_10 .cse0))) v_prenex_10))) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_30) 1))))) is different from false [2024-11-18 13:08:44,637 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (exists ((v_prenex_8 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_11 Int) (v_prenex_9 Int)) (and (= (select v_prenex_10 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_10 v_prenex_11) 1) (= (select v_prenex_8 v_prenex_9) 1) (= (select v_prenex_8 v_prenex_11) 0) (= (let ((.cse0 (@diff v_prenex_8 v_prenex_10))) (store v_prenex_8 .cse0 (select v_prenex_10 .cse0))) v_prenex_10))) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_35) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_30) 1))))) is different from true [2024-11-18 13:08:44,711 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 [2024-11-18 13:08:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-11-18 13:08:44,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:08:44,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:08:44,878 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 83 treesize of output 84 [2024-11-18 13:08:44,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:08:44,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 650 treesize of output 641 [2024-11-18 13:08:44,912 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 147 treesize of output 141 [2024-11-18 13:08:44,926 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 152 treesize of output 140 [2024-11-18 13:08:49,394 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse20 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse10))) (let ((.cse13 (not .cse20)) (.cse8 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (or (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1337))) (store .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1347) (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1335) .cse10) .cse6)) (+ 8 v_arrayElimCell_50)))) .cse20)) (.cse5 (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse30 (select (store (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1337))) (store .cse31 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1347) (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1335) .cse10) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ 8 v_arrayElimCell_50))) (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ 8 v_arrayElimCell_51)))))))) (.cse0 (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1337))) (store .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1347) (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1335) .cse10) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ 8 v_arrayElimCell_50))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ 8 v_arrayElimCell_52))) (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ 8 v_arrayElimCell_51)))))))) (.cse1 (or .cse20 (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1337))) (store .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1347) (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1335) .cse10) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ 8 v_arrayElimCell_50))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ 8 v_arrayElimCell_52)))))))) (.cse2 (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse10)) (.cse3 (or (forall ((v_ArrVal_1337 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1337))) (store .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1347) (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1335) .cse10) .cse6)) (+ 8 v_arrayElimCell_51)))) .cse13)) (.cse17 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8))) (and (or (and .cse0 .cse1 (or .cse2 (and .cse3 .cse4 .cse5))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| .cse6)) (or (not .cse2) (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1337))) (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1347) (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1335) .cse10) .cse6)) (+ 8 v_arrayElimCell_52))))) (or (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1337 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1337))) (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1347) (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1335) .cse10) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 (+ 8 v_arrayElimCell_51))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 (+ 8 v_arrayElimCell_52)))))) .cse13) (or (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| .cse10) (let ((.cse14 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and (or .cse2 (and .cse4 .cse5 (or (forall ((v_ArrVal_1337 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1337) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse14 .cse8 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1347) (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1335) .cse10) .cse6)) (+ 8 v_arrayElimCell_51)) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse13))) .cse0 (or .cse13 (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1337 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse15 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1337) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse14 .cse8 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1347) (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1335) .cse10) .cse6)))) (or (= (select .cse15 (+ 8 v_arrayElimCell_51)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 (+ 8 v_arrayElimCell_52))))))) .cse1))) (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse16 (select (store (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1337))) (store .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1347) (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1335) .cse10) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 .cse17)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 8 v_arrayElimCell_52))) (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 8 v_arrayElimCell_51))))))) (or .cse2 (and .cse3 (or (forall ((v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1337))) (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1347) (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1335) .cse10) .cse6)) .cse17))) .cse20) (forall ((v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1337))) (store .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1347) (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1335) .cse10) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 .cse17)) (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 (+ 8 v_arrayElimCell_51))))))))) (or (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1337))) (store .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1347) (select (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1335) .cse10) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 .cse17)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 (+ 8 v_arrayElimCell_52)))))) .cse20)))))) is different from false [2024-11-18 13:08:50,086 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse15 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse13)) (.cse34 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse10 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse34 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse11 (select .cse34 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (not .cse15))) (let ((.cse3 (or (forall ((v_ArrVal_1337 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (= (select (select (store (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1337))) (store .cse33 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse33 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) .cse11 v_ArrVal_1347) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) .cse11 v_ArrVal_1335) .cse13) .cse6)) (+ 8 v_arrayElimCell_51)) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse18)) (.cse0 (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse31 (select (store (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1337))) (store .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) .cse11 v_ArrVal_1347) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) .cse11 v_ArrVal_1335) .cse13) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ 8 v_arrayElimCell_50))) (forall ((v_arrayElimCell_51 Int)) (= (select .cse31 (+ 8 v_arrayElimCell_51)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ 8 v_arrayElimCell_52))))))) (.cse1 (or (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse29 (select (store (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1337))) (store .cse30 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse30 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) .cse11 v_ArrVal_1347) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) .cse11 v_ArrVal_1335) .cse13) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 (+ 8 v_arrayElimCell_50))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 (+ 8 v_arrayElimCell_52)))))) .cse15)) (.cse2 (or (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1337))) (store .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) .cse11 v_ArrVal_1347) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) .cse11 v_ArrVal_1335) .cse13) .cse6)) (+ 8 v_arrayElimCell_50)))) .cse15)) (.cse4 (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1337))) (store .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) .cse11 v_ArrVal_1347) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) .cse11 v_ArrVal_1335) .cse13) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ 8 v_arrayElimCell_50))) (forall ((v_arrayElimCell_51 Int)) (= (select .cse26 (+ 8 v_arrayElimCell_51)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse5 (= .cse11 .cse13)) (.cse8 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8))) (and (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4) .cse5)) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse6)) (or .cse5 (and (forall ((v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse7 (select (store (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1337))) (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) .cse11 v_ArrVal_1347) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) .cse11 v_ArrVal_1335) .cse13) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 .cse8)) (forall ((v_arrayElimCell_51 Int)) (= (select .cse7 (+ 8 v_arrayElimCell_51)) |c_ULTIMATE.start_main_~uneq~0#1|))))) .cse3 (or (forall ((v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1337))) (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) .cse11 v_ArrVal_1347) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) .cse11 v_ArrVal_1335) .cse13) .cse6)) .cse8))) .cse15))) (or (let ((.cse17 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and (or (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1337 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse16 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1337) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse17 .cse10 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343)) .cse11 v_ArrVal_1347) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) .cse11 v_ArrVal_1335) .cse13) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 8 v_arrayElimCell_51)))))) .cse18) .cse0 .cse1 (or (and .cse2 .cse4 (or (forall ((v_ArrVal_1337 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1337) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse17 .cse10 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343)) .cse11 v_ArrVal_1347) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) .cse11 v_ArrVal_1335) .cse13) .cse6)) (+ 8 v_arrayElimCell_51)))) .cse18)) .cse5))) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse13)) (or .cse15 (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1337))) (store .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) .cse11 v_ArrVal_1347) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) .cse11 v_ArrVal_1335) .cse13) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse19 .cse8)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse19 (+ 8 v_arrayElimCell_52))))))) (or (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1337))) (store .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) .cse11 v_ArrVal_1347) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) .cse11 v_ArrVal_1335) .cse13) .cse6)) (+ 8 v_arrayElimCell_52)))) (not .cse5)) (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse22 (select (store (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1337))) (store .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) .cse11 v_ArrVal_1347) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) .cse11 v_ArrVal_1335) .cse13) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 .cse8)) (forall ((v_arrayElimCell_51 Int)) (= (select .cse22 (+ 8 v_arrayElimCell_51)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 (+ 8 v_arrayElimCell_52)))))) (or (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1337 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1337))) (store .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1343))) .cse11 v_ArrVal_1347) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1336) .cse11 v_ArrVal_1335) .cse13) .cse6)))) (or (= (select .cse24 (+ 8 v_arrayElimCell_51)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ 8 v_arrayElimCell_52)))))) .cse18)))))) is different from false [2024-11-18 13:08:50,482 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse36 (select |c_#memory_$Pointer$#1.base| .cse4)) (.cse27 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (= .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (let ((.cse15 (not .cse1)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4)) (.cse6 (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse36 .cse27 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (.cse5 (select .cse36 .cse27)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 8)) (.cse21 (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse34 (select (store (let ((.cse35 (store |c_#memory_int#1| .cse4 v_ArrVal_1337))) (store .cse35 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse35 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse3 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1343))) .cse5 v_ArrVal_1347) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1336) .cse5 v_ArrVal_1335) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 (+ 8 v_arrayElimCell_50))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 (+ 8 v_arrayElimCell_52))) (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 (+ 8 v_arrayElimCell_51)))))))) (.cse25 (or (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_52 Int) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse32 (select (store (let ((.cse33 (store |c_#memory_int#1| .cse4 v_ArrVal_1337))) (store .cse33 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse33 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse3 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1343))) .cse5 v_ArrVal_1347) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1336) .cse5 v_ArrVal_1335) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 (+ 8 v_arrayElimCell_50))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 (+ 8 v_arrayElimCell_52)))))) .cse1)) (.cse0 (= .cse5 .cse7)) (.cse22 (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse30 (select (store (let ((.cse31 (store |c_#memory_int#1| .cse4 v_ArrVal_1337))) (store .cse31 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse3 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1343))) .cse5 v_ArrVal_1347) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1336) .cse5 v_ArrVal_1335) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ 8 v_arrayElimCell_50))) (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ 8 v_arrayElimCell_51)))))))) (.cse23 (or .cse1 (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse29 (store |c_#memory_int#1| .cse4 v_ArrVal_1337))) (store .cse29 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse3 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1343))) .cse5 v_ArrVal_1347) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1336) .cse5 v_ArrVal_1335) .cse7) .cse8)) (+ 8 v_arrayElimCell_50)))))) (.cse12 (or (forall ((v_ArrVal_1337 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse28 (store |c_#memory_int#1| .cse4 v_ArrVal_1337))) (store .cse28 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse28 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse3 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1343))) .cse5 v_ArrVal_1347) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1336) .cse5 v_ArrVal_1335) .cse7) .cse8)) (+ 8 v_arrayElimCell_51)))) .cse15))) (and (or .cse0 (and (or .cse1 (forall ((v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse2 (store |c_#memory_int#1| .cse4 v_ArrVal_1337))) (store .cse2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse3 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1343))) .cse5 v_ArrVal_1347) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1336) .cse5 v_ArrVal_1335) .cse7) .cse8)) .cse9)))) (forall ((v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse10 (select (store (let ((.cse11 (store |c_#memory_int#1| .cse4 v_ArrVal_1337))) (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse3 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1343))) .cse5 v_ArrVal_1347) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1336) .cse5 v_ArrVal_1335) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 (+ 8 v_arrayElimCell_51)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 .cse9))))) .cse12)) (or (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1337 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse13 (select (store (let ((.cse14 (store |c_#memory_int#1| .cse4 v_ArrVal_1337))) (store .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse3 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1343))) .cse5 v_ArrVal_1347) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1336) .cse5 v_ArrVal_1335) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 (+ 8 v_arrayElimCell_51)))))) .cse15) (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse16 (select (store (let ((.cse17 (store |c_#memory_int#1| .cse4 v_ArrVal_1337))) (store .cse17 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse3 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1343))) .cse5 v_ArrVal_1347) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1336) .cse5 v_ArrVal_1335) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 8 v_arrayElimCell_52))) (forall ((v_arrayElimCell_51 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 8 v_arrayElimCell_51)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 .cse9))))) (or .cse1 (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int#1| .cse4 v_ArrVal_1337))) (store .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse3 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1343))) .cse5 v_ArrVal_1347) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1336) .cse5 v_ArrVal_1335) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 .cse9)))))) (or (not .cse0) (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse20 (store |c_#memory_int#1| .cse4 v_ArrVal_1337))) (store .cse20 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse3 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1343))) .cse5 v_ArrVal_1347) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1336) .cse5 v_ArrVal_1335) .cse7) .cse8)) (+ 8 v_arrayElimCell_52))))) (or (let ((.cse24 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (and .cse21 (or .cse0 (and .cse22 .cse23 (or .cse15 (forall ((v_ArrVal_1337 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| .cse4 v_ArrVal_1337) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store .cse24 .cse3 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1343)) .cse5 v_ArrVal_1347) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1336) .cse5 v_ArrVal_1335) .cse7) .cse8)) (+ 8 v_arrayElimCell_51))))))) .cse25 (or (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1337 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1343 Int) (v_DerPreprocessor_3 Int)) (let ((.cse26 (select (store (store (store |c_#memory_int#1| .cse4 v_ArrVal_1337) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store .cse24 .cse3 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1343)) .cse5 v_ArrVal_1347) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1336) .cse5 v_ArrVal_1335) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ 8 v_arrayElimCell_51)))))) .cse15))) (= .cse4 .cse7)) (or (and .cse21 .cse25 (or .cse0 (and .cse22 .cse23 .cse12))) (= .cse27 .cse8))))))) is different from false