/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 03:33:38,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 03:33:38,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 03:33:38,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 03:33:38,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 03:33:38,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 03:33:38,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 03:33:38,558 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 03:33:38,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 03:33:38,558 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 03:33:38,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 03:33:38,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 03:33:38,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 03:33:38,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 03:33:38,559 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 03:33:38,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 03:33:38,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 03:33:38,565 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 03:33:38,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 03:33:38,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 03:33:38,567 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 03:33:38,567 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 03:33:38,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 03:33:38,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 03:33:38,567 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 03:33:38,568 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 03:33:38,568 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 03:33:38,568 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 03:33:38,568 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 03:33:38,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 03:33:38,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 03:33:38,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 03:33:38,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:33:38,569 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 03:33:38,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 03:33:38,570 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 03:33:38,570 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 03:33:38,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 03:33:38,570 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 03:33:38,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 03:33:38,570 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 03:33:38,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 03:33:38,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 03:33:38,571 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: Use bitabs translation -> false [2023-12-21 03:33:38,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 03:33:38,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 03:33:38,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 03:33:38,763 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 03:33:38,767 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 03:33:38,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i [2023-12-21 03:33:39,797 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 03:33:39,990 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 03:33:39,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i [2023-12-21 03:33:39,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0b50938a/8744116d8ea6480186fa109f30656d04/FLAGd11484a6a [2023-12-21 03:33:40,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0b50938a/8744116d8ea6480186fa109f30656d04 [2023-12-21 03:33:40,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 03:33:40,013 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 03:33:40,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 03:33:40,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 03:33:40,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 03:33:40,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:33:40" (1/1) ... [2023-12-21 03:33:40,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bf28a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:40, skipping insertion in model container [2023-12-21 03:33:40,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:33:40" (1/1) ... [2023-12-21 03:33:40,068 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 03:33:40,291 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i[25148,25161] [2023-12-21 03:33:40,294 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:33:40,303 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 03:33:40,336 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i[25148,25161] [2023-12-21 03:33:40,337 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:33:40,362 INFO L206 MainTranslator]: Completed translation [2023-12-21 03:33:40,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:40 WrapperNode [2023-12-21 03:33:40,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 03:33:40,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 03:33:40,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 03:33:40,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 03:33:40,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:40" (1/1) ... [2023-12-21 03:33:40,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:40" (1/1) ... [2023-12-21 03:33:40,399 INFO L138 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 187 [2023-12-21 03:33:40,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 03:33:40,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 03:33:40,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 03:33:40,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 03:33:40,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:40" (1/1) ... [2023-12-21 03:33:40,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:40" (1/1) ... [2023-12-21 03:33:40,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:40" (1/1) ... [2023-12-21 03:33:40,432 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 12, 26]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 18 writes are split as follows [0, 1, 17]. [2023-12-21 03:33:40,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:40" (1/1) ... [2023-12-21 03:33:40,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:40" (1/1) ... [2023-12-21 03:33:40,439 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:40" (1/1) ... [2023-12-21 03:33:40,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:40" (1/1) ... [2023-12-21 03:33:40,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:40" (1/1) ... [2023-12-21 03:33:40,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:40" (1/1) ... [2023-12-21 03:33:40,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 03:33:40,458 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 03:33:40,459 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 03:33:40,459 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 03:33:40,466 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:40" (1/1) ... [2023-12-21 03:33:40,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:33:40,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:33:40,514 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) [2023-12-21 03:33:40,522 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 [2023-12-21 03:33:40,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 03:33:40,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 03:33:40,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 03:33:40,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 03:33:40,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 03:33:40,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 03:33:40,541 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-21 03:33:40,541 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-21 03:33:40,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 03:33:40,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 03:33:40,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 03:33:40,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-21 03:33:40,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-21 03:33:40,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-21 03:33:40,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-21 03:33:40,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-21 03:33:40,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-21 03:33:40,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 03:33:40,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-21 03:33:40,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-21 03:33:40,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-21 03:33:40,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 03:33:40,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 03:33:40,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 03:33:40,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 03:33:40,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 03:33:40,642 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 03:33:40,643 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 03:33:40,820 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 03:33:40,896 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 03:33:40,897 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-21 03:33:40,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:33:40 BoogieIcfgContainer [2023-12-21 03:33:40,897 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 03:33:40,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 03:33:40,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 03:33:40,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 03:33:40,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:33:40" (1/3) ... [2023-12-21 03:33:40,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bae292e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:33:40, skipping insertion in model container [2023-12-21 03:33:40,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:40" (2/3) ... [2023-12-21 03:33:40,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bae292e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:33:40, skipping insertion in model container [2023-12-21 03:33:40,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:33:40" (3/3) ... [2023-12-21 03:33:40,903 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2023-12-21 03:33:40,917 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 03:33:40,917 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 03:33:40,950 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 03:33:40,954 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@62eb0691, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 03:33:40,955 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 03:33:40,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 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) [2023-12-21 03:33:40,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-21 03:33:40,963 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:33:40,963 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:33:40,964 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:33:40,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:33:40,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1280970562, now seen corresponding path program 1 times [2023-12-21 03:33:40,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:33:40,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312916189] [2023-12-21 03:33:40,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:33:40,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:33:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:41,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:33:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:41,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:33:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:41,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:33:41,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:33:41,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312916189] [2023-12-21 03:33:41,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312916189] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:33:41,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:33:41,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 03:33:41,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418882059] [2023-12-21 03:33:41,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:33:41,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 03:33:41,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:33:41,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 03:33:41,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:33:41,287 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 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 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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) [2023-12-21 03:33:41,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:33:41,359 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2023-12-21 03:33:41,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 03:33:41,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 19 [2023-12-21 03:33:41,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:33:41,366 INFO L225 Difference]: With dead ends: 66 [2023-12-21 03:33:41,366 INFO L226 Difference]: Without dead ends: 30 [2023-12-21 03:33:41,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:33:41,372 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:33:41,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:33:41,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-21 03:33:41,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-21 03:33:41,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 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) [2023-12-21 03:33:41,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2023-12-21 03:33:41,400 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 19 [2023-12-21 03:33:41,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:33:41,400 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2023-12-21 03:33:41,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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) [2023-12-21 03:33:41,401 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2023-12-21 03:33:41,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-21 03:33:41,402 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:33:41,402 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:33:41,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 03:33:41,402 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:33:41,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:33:41,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1761698767, now seen corresponding path program 1 times [2023-12-21 03:33:41,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:33:41,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644809793] [2023-12-21 03:33:41,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:33:41,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:33:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:41,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:33:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:41,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:33:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:41,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:33:41,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:33:41,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644809793] [2023-12-21 03:33:41,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644809793] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:33:41,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:33:41,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 03:33:41,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371350438] [2023-12-21 03:33:41,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:33:41,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:33:41,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:33:41,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:33:41,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:33:41,615 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:33:41,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:33:41,679 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2023-12-21 03:33:41,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:33:41,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-12-21 03:33:41,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:33:41,680 INFO L225 Difference]: With dead ends: 45 [2023-12-21 03:33:41,681 INFO L226 Difference]: Without dead ends: 33 [2023-12-21 03:33:41,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:33:41,682 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:33:41,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 84 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:33:41,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-21 03:33:41,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2023-12-21 03:33:41,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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) [2023-12-21 03:33:41,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2023-12-21 03:33:41,692 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 19 [2023-12-21 03:33:41,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:33:41,693 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2023-12-21 03:33:41,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:33:41,693 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2023-12-21 03:33:41,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-21 03:33:41,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:33:41,694 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:33:41,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 03:33:41,695 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:33:41,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:33:41,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1537362706, now seen corresponding path program 1 times [2023-12-21 03:33:41,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:33:41,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982180926] [2023-12-21 03:33:41,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:33:41,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:33:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:41,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:33:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:41,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:33:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:41,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 03:33:41,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:33:41,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982180926] [2023-12-21 03:33:41,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982180926] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:33:41,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:33:41,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 03:33:41,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404462024] [2023-12-21 03:33:41,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:33:41,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:33:41,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:33:41,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:33:41,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:33:41,852 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2023-12-21 03:33:41,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:33:41,905 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2023-12-21 03:33:41,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:33:41,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 20 [2023-12-21 03:33:41,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:33:41,907 INFO L225 Difference]: With dead ends: 57 [2023-12-21 03:33:41,907 INFO L226 Difference]: Without dead ends: 33 [2023-12-21 03:33:41,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:33:41,910 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:33:41,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 79 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:33:41,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-21 03:33:41,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-21 03:33:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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) [2023-12-21 03:33:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2023-12-21 03:33:41,921 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 20 [2023-12-21 03:33:41,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:33:41,922 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2023-12-21 03:33:41,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2023-12-21 03:33:41,922 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2023-12-21 03:33:41,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 03:33:41,923 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:33:41,923 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:33:41,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 03:33:41,923 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:33:41,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:33:41,923 INFO L85 PathProgramCache]: Analyzing trace with hash 434779626, now seen corresponding path program 1 times [2023-12-21 03:33:41,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:33:41,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100417770] [2023-12-21 03:33:41,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:33:41,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:33:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:43,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:33:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:43,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:33:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:43,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 03:33:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:33:43,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:33:43,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100417770] [2023-12-21 03:33:43,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100417770] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:33:43,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033016893] [2023-12-21 03:33:43,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:33:43,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:33:43,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:33:43,836 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) [2023-12-21 03:33:43,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 03:33:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:44,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 120 conjunts are in the unsatisfiable core [2023-12-21 03:33:44,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:33:44,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-21 03:33:44,603 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 [2023-12-21 03:33:44,709 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-21 03:33:44,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-21 03:33:44,774 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 [2023-12-21 03:33:44,785 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 [2023-12-21 03:33:44,879 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-21 03:33:44,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2023-12-21 03:33:44,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-21 03:33:45,066 INFO L349 Elim1Store]: treesize reduction 80, result has 22.3 percent of original size [2023-12-21 03:33:45,067 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 162 treesize of output 72 [2023-12-21 03:33:45,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:33:45,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2023-12-21 03:33:45,086 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 26 treesize of output 15 [2023-12-21 03:33:45,192 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-21 03:33:45,193 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 [2023-12-21 03:33:45,215 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 [2023-12-21 03:33:45,224 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 11 treesize of output 3 [2023-12-21 03:33:45,382 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-21 03:33:45,383 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 20 treesize of output 23 [2023-12-21 03:33:45,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:33:45,405 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-21 03:33:45,405 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 [2023-12-21 03:33:45,418 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-21 03:33:45,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-21 03:33:45,600 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-21 03:33:45,601 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 [2023-12-21 03:33:45,732 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 41 treesize of output 39 [2023-12-21 03:33:45,738 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 [2023-12-21 03:33:45,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-21 03:33:45,873 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:33:45,873 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:34:08,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033016893] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:34:08,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:34:08,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 43 [2023-12-21 03:34:08,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088306699] [2023-12-21 03:34:08,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:34:08,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-21 03:34:08,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:34:08,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-21 03:34:08,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2155, Unknown=37, NotChecked=0, Total=2352 [2023-12-21 03:34:08,888 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 43 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 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) [2023-12-21 03:34:10,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:34:10,728 INFO L93 Difference]: Finished difference Result 74 states and 102 transitions. [2023-12-21 03:34:10,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-21 03:34:10,729 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 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 28 [2023-12-21 03:34:10,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:34:10,730 INFO L225 Difference]: With dead ends: 74 [2023-12-21 03:34:10,730 INFO L226 Difference]: Without dead ends: 72 [2023-12-21 03:34:10,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=296, Invalid=3699, Unknown=37, NotChecked=0, Total=4032 [2023-12-21 03:34:10,732 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 78 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-21 03:34:10,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 435 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-21 03:34:10,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-21 03:34:10,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2023-12-21 03:34:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 03:34:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2023-12-21 03:34:10,745 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 28 [2023-12-21 03:34:10,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:34:10,746 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2023-12-21 03:34:10,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 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) [2023-12-21 03:34:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2023-12-21 03:34:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-21 03:34:10,748 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:34:10,748 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-21 03:34:10,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-21 03:34:10,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:34:10,952 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:34:10,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:34:10,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1828890171, now seen corresponding path program 1 times [2023-12-21 03:34:10,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:34:10,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946313853] [2023-12-21 03:34:10,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:34:10,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:34:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:11,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:34:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:11,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:34:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:11,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 03:34:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:11,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 03:34:11,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:34:11,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946313853] [2023-12-21 03:34:11,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946313853] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:34:11,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:34:11,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 03:34:11,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308922927] [2023-12-21 03:34:11,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:34:11,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 03:34:11,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:34:11,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 03:34:11,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 03:34:11,103 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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) [2023-12-21 03:34:11,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:34:11,159 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2023-12-21 03:34:11,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 03:34:11,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 29 [2023-12-21 03:34:11,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:34:11,162 INFO L225 Difference]: With dead ends: 64 [2023-12-21 03:34:11,162 INFO L226 Difference]: Without dead ends: 49 [2023-12-21 03:34:11,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:34:11,162 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 27 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:34:11,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 86 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:34:11,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-21 03:34:11,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-21 03:34:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 03:34:11,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2023-12-21 03:34:11,174 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 29 [2023-12-21 03:34:11,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:34:11,175 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2023-12-21 03:34:11,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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) [2023-12-21 03:34:11,175 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2023-12-21 03:34:11,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-21 03:34:11,176 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:34:11,176 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:34:11,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 03:34:11,176 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:34:11,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:34:11,177 INFO L85 PathProgramCache]: Analyzing trace with hash 2128958037, now seen corresponding path program 2 times [2023-12-21 03:34:11,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:34:11,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667164787] [2023-12-21 03:34:11,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:34:11,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:34:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:11,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:34:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:11,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:34:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:11,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 03:34:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:11,340 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 03:34:11,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:34:11,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667164787] [2023-12-21 03:34:11,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667164787] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:34:11,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:34:11,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 03:34:11,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889955766] [2023-12-21 03:34:11,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:34:11,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 03:34:11,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:34:11,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 03:34:11,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:34:11,342 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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) [2023-12-21 03:34:11,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:34:11,408 INFO L93 Difference]: Finished difference Result 65 states and 88 transitions. [2023-12-21 03:34:11,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 03:34:11,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 29 [2023-12-21 03:34:11,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:34:11,410 INFO L225 Difference]: With dead ends: 65 [2023-12-21 03:34:11,410 INFO L226 Difference]: Without dead ends: 49 [2023-12-21 03:34:11,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-21 03:34:11,412 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:34:11,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 80 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:34:11,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-21 03:34:11,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-21 03:34:11,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 03:34:11,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2023-12-21 03:34:11,423 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 29 [2023-12-21 03:34:11,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:34:11,423 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2023-12-21 03:34:11,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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) [2023-12-21 03:34:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2023-12-21 03:34:11,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-21 03:34:11,428 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:34:11,428 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-21 03:34:11,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 03:34:11,428 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:34:11,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:34:11,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1486153936, now seen corresponding path program 1 times [2023-12-21 03:34:11,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:34:11,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448033392] [2023-12-21 03:34:11,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:34:11,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:34:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:11,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:34:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:11,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:34:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:11,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 03:34:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:11,664 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 03:34:11,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:34:11,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448033392] [2023-12-21 03:34:11,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448033392] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:34:11,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102133419] [2023-12-21 03:34:11,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:34:11,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:34:11,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:34:11,666 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) [2023-12-21 03:34:11,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 03:34:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:11,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-21 03:34:11,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:34:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 03:34:11,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:34:11,984 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 03:34:11,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102133419] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:34:11,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:34:11,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2023-12-21 03:34:11,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379772831] [2023-12-21 03:34:11,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:34:11,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 03:34:11,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:34:11,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 03:34:11,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2023-12-21 03:34:11,987 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 03:34:12,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:34:12,219 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2023-12-21 03:34:12,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 03:34:12,220 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 30 [2023-12-21 03:34:12,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:34:12,220 INFO L225 Difference]: With dead ends: 75 [2023-12-21 03:34:12,220 INFO L226 Difference]: Without dead ends: 47 [2023-12-21 03:34:12,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2023-12-21 03:34:12,221 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 03:34:12,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 347 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 03:34:12,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-21 03:34:12,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-12-21 03:34:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 03:34:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2023-12-21 03:34:12,226 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 30 [2023-12-21 03:34:12,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:34:12,226 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2023-12-21 03:34:12,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 03:34:12,227 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2023-12-21 03:34:12,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-21 03:34:12,227 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:34:12,227 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-21 03:34:12,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 03:34:12,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-21 03:34:12,433 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:34:12,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:34:12,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1022802718, now seen corresponding path program 1 times [2023-12-21 03:34:12,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:34:12,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776525099] [2023-12-21 03:34:12,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:34:12,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:34:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:13,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:34:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:13,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:34:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:13,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 03:34:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:34:14,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:34:14,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776525099] [2023-12-21 03:34:14,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776525099] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:34:14,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284440464] [2023-12-21 03:34:14,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:34:14,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:34:14,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:34:14,093 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) [2023-12-21 03:34:14,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 03:34:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:14,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 140 conjunts are in the unsatisfiable core [2023-12-21 03:34:14,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:34:14,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-21 03:34:14,893 WARN L854 $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|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~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)) is different from false [2023-12-21 03:34:14,894 WARN L876 $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|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~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)) is different from true [2023-12-21 03:34:14,903 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 [2023-12-21 03:34:14,919 WARN L854 $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_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~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_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from false [2023-12-21 03:34:14,920 WARN L876 $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_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~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_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from true [2023-12-21 03:34:14,935 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-21 03:34:14,935 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 [2023-12-21 03:34:14,942 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 [2023-12-21 03:34:14,956 WARN L854 $PredicateComparison]: unable to prove that (and (or (= |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_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |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_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) is different from false [2023-12-21 03:34:14,985 WARN L876 $PredicateComparison]: unable to prove that (and (or (= |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_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |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_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) is different from true [2023-12-21 03:34:15,006 WARN L854 $PredicateComparison]: unable to prove that (and (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$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2023-12-21 03:34:15,007 WARN L876 $PredicateComparison]: unable to prove that (and (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$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2023-12-21 03:34:15,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:15,048 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 71 treesize of output 34 [2023-12-21 03:34:15,072 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) .cse0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 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) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2023-12-21 03:34:15,074 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) .cse0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 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) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2023-12-21 03:34:15,088 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-21 03:34:15,088 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 [2023-12-21 03:34:15,103 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_29 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_29) 1)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-21 03:34:15,105 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_29 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_29) 1)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-21 03:34:15,133 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_29) 1)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-21 03:34:15,134 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_29) 1)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-21 03:34:15,149 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 [2023-12-21 03:34:15,167 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (exists ((v_arrayElimCell_29 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_29) 1)))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-21 03:34:15,180 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (exists ((v_arrayElimCell_29 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_29) 1)))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-21 03:34:15,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:15,238 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-21 03:34:15,239 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 [2023-12-21 03:34:15,276 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (and (exists ((v_arrayElimCell_29 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_29) 1)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_10| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse3) 0))) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |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) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2023-12-21 03:34:15,280 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (and (exists ((v_arrayElimCell_29 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_29) 1)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_10| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse3) 0))) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |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) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2023-12-21 03:34:15,365 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (and (exists ((v_arrayElimCell_29 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_29) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse3) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse2) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_10| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse3) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)))) is different from false [2023-12-21 03:34:15,368 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (and (exists ((v_arrayElimCell_29 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_29) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse3) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse2) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_10| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse3) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)))) is different from true [2023-12-21 03:34:15,451 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (and (exists ((v_arrayElimCell_29 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_29) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse3) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse2) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_10| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse3) 0))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= .cse3 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2023-12-21 03:34:15,454 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (and (exists ((v_arrayElimCell_29 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_29) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse3) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse2) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_10| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse3) 0))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= .cse3 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2023-12-21 03:34:15,595 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 03:34:15,597 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-21 03:34:15,615 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-12-21 03:34:15,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 167 treesize of output 96 [2023-12-21 03:34:15,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:15,635 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2023-12-21 03:34:15,635 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 211 treesize of output 134 [2023-12-21 03:34:15,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:15,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:15,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:15,683 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 58 treesize of output 34 [2023-12-21 03:34:15,688 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 0 case distinctions, treesize of input 45 treesize of output 41 [2023-12-21 03:34:15,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:15,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:15,696 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 [2023-12-21 03:34:15,751 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 [2023-12-21 03:34:15,757 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 [2023-12-21 03:34:15,767 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (and (= (select (select |c_#memory_int#2| .cse0) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((v_arrayElimCell_29 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_29) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_10| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse3) 0)))))) is different from false [2023-12-21 03:34:15,770 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (and (= (select (select |c_#memory_int#2| .cse0) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((v_arrayElimCell_29 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_29) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_10| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse3) 0)))))) is different from true [2023-12-21 03:34:15,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:34:15,799 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 83 treesize of output 59 [2023-12-21 03:34:15,899 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| .cse0) 8)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (or (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (and (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0))) (and (exists ((v_arrayElimCell_29 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_8| |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_8| v_arrayElimCell_29) 1))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))))) is different from false [2023-12-21 03:34:15,901 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| .cse0) 8)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (or (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (and (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0))) (and (exists ((v_arrayElimCell_29 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_8| |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_8| v_arrayElimCell_29) 1))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))))) is different from true [2023-12-21 03:34:15,984 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 28 treesize of output 16 [2023-12-21 03:34:16,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:34:16,004 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 56 treesize of output 68 [2023-12-21 03:34:16,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-21 03:34:16,089 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_31| Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= 0 (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_31|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |v_ULTIMATE.start_main_~ptr~0#1.base_31|) 1)))) is different from false [2023-12-21 03:34:16,100 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_31| Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= 0 (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_31|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |v_ULTIMATE.start_main_~ptr~0#1.base_31|) 1)))) is different from true [2023-12-21 03:34:16,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-21 03:34:16,126 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-12-21 03:34:16,127 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:34:16,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:34:16,230 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 [2023-12-21 03:34:16,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:34:16,242 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 [2023-12-21 03:34:16,250 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 [2023-12-21 03:34:16,256 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 [2023-12-21 03:34:16,589 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse4))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.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|))) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse17 (not .cse7))) (let ((.cse0 (or (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse27 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1366))) (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|) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1369) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse4) .cse5)) (+ 8 v_arrayElimCell_50)))) .cse17)) (.cse10 (= .cse4 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse12 (and (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_48 Int) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse20 (select (store (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1366))) (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|) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1369) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 (+ 8 v_arrayElimCell_51))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 (+ 8 v_arrayElimCell_48))) (forall ((v_arrayElimCell_50 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 (+ 8 v_arrayElimCell_50))))))) (or (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_48 Int) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse22 (select (store (let ((.cse23 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1366))) (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|) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1369) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 (+ 8 v_arrayElimCell_51))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 (+ 8 v_arrayElimCell_48)))))) .cse7) (or (and (or (forall ((v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_48 Int) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse24 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1366))) (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|) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1369) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse4) .cse5)) (+ 8 v_arrayElimCell_48)))) .cse7) .cse0 (forall ((v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_48 Int) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1366))) (store .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1369) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 (+ 8 v_arrayElimCell_48))) (forall ((v_arrayElimCell_50 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 (+ 8 v_arrayElimCell_50)))))))) .cse10))) (.cse6 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8))) (and (or (and .cse0 (or (forall ((v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse1 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1366))) (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1369) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse4) .cse5)) .cse6))) .cse7) (forall ((v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse8 (select (store (let ((.cse9 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1366))) (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|) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1369) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 .cse6)) (forall ((v_arrayElimCell_50 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 (+ 8 v_arrayElimCell_50)))))))) .cse10) (or (not .cse10) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse11 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1366))) (store .cse11 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse11 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1369) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse4) .cse5)) (+ 8 v_arrayElimCell_51))))) (or .cse12 (= .cse5 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse13 (select (store (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1366))) (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|) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1369) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 (+ 8 v_arrayElimCell_51))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 .cse6)) (forall ((v_arrayElimCell_50 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 (+ 8 v_arrayElimCell_50))))))) (or (= .cse4 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) .cse12) (or (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse15 (select (store (let ((.cse16 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1366))) (store .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1369) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 (+ 8 v_arrayElimCell_51))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 (+ 8 v_arrayElimCell_50)))))) .cse17) (or .cse7 (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1366))) (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|) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1369) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 (+ 8 v_arrayElimCell_51))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 .cse6)))))))))))) is different from false [2023-12-21 03:34:17,106 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse29 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (.cse0 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse7))) (let ((.cse16 (not .cse0)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse29 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse8 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select .cse29 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (let ((.cse15 (= .cse5 .cse7)) (.cse14 (or .cse16 (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= (select (select (store (let ((.cse28 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366))) (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|) .cse4 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) .cse5 v_ArrVal_1369) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) .cse5 v_ArrVal_1364) .cse7) .cse8)) (+ 8 v_arrayElimCell_50)) |c_ULTIMATE.start_main_~uneq~0#1|))))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8)) (.cse20 (and (or .cse0 (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_48 Int) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366))) (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|) .cse4 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) .cse5 v_ArrVal_1369) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) .cse5 v_ArrVal_1364) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 (+ 8 v_arrayElimCell_51))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 (+ 8 v_arrayElimCell_48))))))) (or .cse15 (and (or .cse0 (forall ((v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_48 Int) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse23 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366))) (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|) .cse4 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) .cse5 v_ArrVal_1369) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) .cse5 v_ArrVal_1364) .cse7) .cse8)) (+ 8 v_arrayElimCell_48))))) (forall ((v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_48 Int) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366))) (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|) .cse4 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) .cse5 v_ArrVal_1369) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) .cse5 v_ArrVal_1364) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_50 Int)) (= (select .cse24 (+ 8 v_arrayElimCell_50)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ 8 v_arrayElimCell_48)))))) .cse14)) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_48 Int) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366))) (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|) .cse4 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) .cse5 v_ArrVal_1369) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) .cse5 v_ArrVal_1364) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ 8 v_arrayElimCell_51))) (forall ((v_arrayElimCell_50 Int)) (= (select .cse26 (+ 8 v_arrayElimCell_50)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ 8 v_arrayElimCell_48))))))))) (and (or .cse0 (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse1 (select (store (let ((.cse3 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366))) (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) .cse5 v_ArrVal_1369) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) .cse5 v_ArrVal_1364) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 (+ 8 v_arrayElimCell_51))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 .cse2)))))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse9 (select (store (let ((.cse10 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366))) (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) .cse5 v_ArrVal_1369) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) .cse5 v_ArrVal_1364) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse9 (+ 8 v_arrayElimCell_51))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse9 .cse2)) (forall ((v_arrayElimCell_50 Int)) (= (select .cse9 (+ 8 v_arrayElimCell_50)) |c_ULTIMATE.start_main_~uneq~0#1|))))) (or (and (forall ((v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366))) (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|) .cse4 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) .cse5 v_ArrVal_1369) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) .cse5 v_ArrVal_1364) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 .cse2)) (forall ((v_arrayElimCell_50 Int)) (= (select .cse11 (+ 8 v_arrayElimCell_50)) |c_ULTIMATE.start_main_~uneq~0#1|))))) (or .cse0 (forall ((v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366))) (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) .cse5 v_ArrVal_1369) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) .cse5 v_ArrVal_1364) .cse7) .cse8)) .cse2)))) .cse14) .cse15) (or .cse16 (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse17 (select (store (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366))) (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|) .cse4 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) .cse5 v_ArrVal_1369) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) .cse5 v_ArrVal_1364) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 (+ 8 v_arrayElimCell_51))) (= (select .cse17 (+ 8 v_arrayElimCell_50)) |c_ULTIMATE.start_main_~uneq~0#1|))))) (or (not .cse15) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse19 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366))) (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|) .cse4 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1374))) .cse5 v_ArrVal_1369) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1372) .cse5 v_ArrVal_1364) .cse7) .cse8)) (+ 8 v_arrayElimCell_51))))) (or .cse20 (= .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (or (= .cse8 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) .cse20))))))) is different from false [2023-12-21 03:34:17,343 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (= .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse31 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse9 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4)) (.cse11 (store |c_#memory_$Pointer$#2.base| .cse3 (store .cse31 .cse2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (.cse10 (select .cse31 .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (not .cse5))) (let ((.cse19 (or (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse30 (store |c_#memory_int#2| .cse3 v_ArrVal_1366))) (store .cse30 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse30 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1374))) .cse10 v_ArrVal_1369) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1372) .cse10 v_ArrVal_1364) .cse4) .cse1)) (+ 8 v_arrayElimCell_50)))) .cse14)) (.cse21 (= .cse10 .cse4))) (let ((.cse0 (and (or (and .cse19 (forall ((v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_48 Int) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int#2| .cse3 v_ArrVal_1366))) (store .cse24 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1374))) .cse10 v_ArrVal_1369) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1372) .cse10 v_ArrVal_1364) .cse4) .cse1)))) (or (forall ((v_arrayElimCell_50 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 (+ 8 v_arrayElimCell_50)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 (+ 8 v_arrayElimCell_48)))))) (or .cse5 (forall ((v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_48 Int) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse25 (store |c_#memory_int#2| .cse3 v_ArrVal_1366))) (store .cse25 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1374))) .cse10 v_ArrVal_1369) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1372) .cse10 v_ArrVal_1364) .cse4) .cse1)) (+ 8 v_arrayElimCell_48)))))) .cse21) (or .cse5 (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_48 Int) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int#2| .cse3 v_ArrVal_1366))) (store .cse27 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse27 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1374))) .cse10 v_ArrVal_1369) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1372) .cse10 v_ArrVal_1364) .cse4) .cse1)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ 8 v_arrayElimCell_48))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ 8 v_arrayElimCell_51))))))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_48 Int) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int#2| .cse3 v_ArrVal_1366))) (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|) .cse9 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1374))) .cse10 v_ArrVal_1369) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1372) .cse10 v_ArrVal_1364) .cse4) .cse1)))) (or (forall ((v_arrayElimCell_50 Int)) (= |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_48))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ 8 v_arrayElimCell_51)))))))) (.cse7 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 8))) (and (or .cse0 (= .cse1 .cse2)) (or (= .cse3 .cse4) .cse0) (or .cse5 (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse6 (select (store (let ((.cse8 (store |c_#memory_int#2| .cse3 v_ArrVal_1366))) (store .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1374))) .cse10 v_ArrVal_1369) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1372) .cse10 v_ArrVal_1364) .cse4) .cse1)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse6 (+ 8 v_arrayElimCell_51))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse6 .cse7)))))) (or (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_int#2| .cse3 v_ArrVal_1366))) (store .cse13 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse13 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1374))) .cse10 v_ArrVal_1369) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1372) .cse10 v_ArrVal_1364) .cse4) .cse1)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 (+ 8 v_arrayElimCell_51))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 (+ 8 v_arrayElimCell_50)))))) .cse14) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse15 (select (store (let ((.cse16 (store |c_#memory_int#2| .cse3 v_ArrVal_1366))) (store .cse16 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse16 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1374))) .cse10 v_ArrVal_1369) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1372) .cse10 v_ArrVal_1364) .cse4) .cse1)))) (or (forall ((v_arrayElimCell_50 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 (+ 8 v_arrayElimCell_50)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 (+ 8 v_arrayElimCell_51))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 .cse7))))) (or (and (forall ((v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse17 (select (store (let ((.cse18 (store |c_#memory_int#2| .cse3 v_ArrVal_1366))) (store .cse18 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse18 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1374))) .cse10 v_ArrVal_1369) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1372) .cse10 v_ArrVal_1364) .cse4) .cse1)))) (or (forall ((v_arrayElimCell_50 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 (+ 8 v_arrayElimCell_50)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 .cse7))))) .cse19 (or .cse5 (forall ((v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse20 (store |c_#memory_int#2| .cse3 v_ArrVal_1366))) (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|) .cse9 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1374))) .cse10 v_ArrVal_1369) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1372) .cse10 v_ArrVal_1364) .cse4) .cse1)) .cse7))))) .cse21) (or (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1374 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse22 (store |c_#memory_int#2| .cse3 v_ArrVal_1366))) (store .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse9 v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1374))) .cse10 v_ArrVal_1369) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1372) .cse10 v_ArrVal_1364) .cse4) .cse1)) (+ 8 v_arrayElimCell_51)))) (not .cse21)))))))) is different from false [2023-12-21 03:38:47,036 WARN L293 SmtUtils]: Spent 4.49m on a formula simplification. DAG size of input: 2320 DAG size of output: 1814 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-21 03:38:47,037 INFO L349 Elim1Store]: treesize reduction 17017, result has 71.4 percent of original size [2023-12-21 03:38:47,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 30 select indices, 30 select index equivalence classes, 0 disjoint index pairs (out of 435 index pairs), introduced 31 new quantified variables, introduced 466 case distinctions, treesize of input 185407 treesize of output 215798 [2023-12-21 03:38:50,389 INFO L224 Elim1Store]: Index analysis took 707 ms [2023-12-21 03:39:05,930 WARN L293 SmtUtils]: Spent 15.53s on a formula simplification that was a NOOP. DAG size: 755 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-21 03:39:05,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:39:05,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 153 case distinctions, treesize of input 35804 treesize of output 51350 [2023-12-21 03:39:09,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:39:09,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32167 treesize of output 32152 [2023-12-21 03:39:13,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:39:13,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32075 treesize of output 32052 [2023-12-21 03:39:16,081 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 32133 treesize of output 32121 [2023-12-21 03:39:20,802 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 32177 treesize of output 32165 [2023-12-21 03:39:25,735 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 32131 treesize of output 32115 [2023-12-21 03:39:28,605 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 32115 treesize of output 32099 [2023-12-21 03:39:32,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:39:32,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32801 treesize of output 32766 [2023-12-21 03:39:37,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:39:37,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32231 treesize of output 32208 [2023-12-21 03:39:40,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:39:40,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32507 treesize of output 32484 [2023-12-21 03:39:45,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:39:45,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32271 treesize of output 32248 [2023-12-21 03:39:48,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:39:48,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32473 treesize of output 32456 [2023-12-21 03:39:53,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:39:53,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32457 treesize of output 32442 [2023-12-21 03:39:59,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:39:59,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32365 treesize of output 32342 [2023-12-21 03:40:02,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:40:02,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32333 treesize of output 32318 [2023-12-21 03:40:05,581 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 32543 treesize of output 32523 [2023-12-21 03:40:09,461 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 32353 treesize of output 32337 [2023-12-21 03:40:13,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:40:13,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32805 treesize of output 32784 [2023-12-21 03:40:17,723 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 32653 treesize of output 32633 [2023-12-21 03:40:22,816 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 32463 treesize of output 32447 [2023-12-21 03:40:26,079 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 32447 treesize of output 32441 [2023-12-21 03:40:29,257 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 32441 treesize of output 32433 [2023-12-21 03:40:32,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:40:32,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32757 treesize of output 32734 [2023-12-21 03:40:37,831 WARN L293 SmtUtils]: Spent 5.13s on a formula simplification. DAG size of input: 3532 DAG size of output: 3519 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 03:40:38,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:40:38,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32521 treesize of output 32506 [2023-12-21 03:40:42,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:40:42,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32715 treesize of output 32698 [2023-12-21 03:40:46,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:40:46,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32519 treesize of output 32496 [2023-12-21 03:40:49,442 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 32577 treesize of output 32565 [2023-12-21 03:40:54,659 WARN L293 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 3550 DAG size of output: 3548 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 03:40:55,277 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 32531 treesize of output 32515 [2023-12-21 03:40:58,813 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 32605 treesize of output 32593 [2023-12-21 03:41:02,609 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 32559 treesize of output 32543 [2023-12-21 03:41:06,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:41:06,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33011 treesize of output 32980 [2023-12-21 03:41:11,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:41:11,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32631 treesize of output 32608 [2023-12-21 03:41:15,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:41:15,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33157 treesize of output 33130 [2023-12-21 03:41:21,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:41:21,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32731 treesize of output 32708 [2023-12-21 03:41:25,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:41:25,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32683 treesize of output 32668 [2023-12-21 03:47:28,484 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-21 03:47:28,486 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-21 03:47:28,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-21 03:47:28,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2023-12-21 03:47:28,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:47:28,687 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:364) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 84 more [2023-12-21 03:47:28,690 INFO L158 Benchmark]: Toolchain (without parser) took 828677.19ms. Allocated memory was 175.1MB in the beginning and 1.0GB in the end (delta: 836.8MB). Free memory was 118.3MB in the beginning and 381.6MB in the end (delta: -263.3MB). Peak memory consumption was 603.3MB. Max. memory is 8.0GB. [2023-12-21 03:47:28,690 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 175.1MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 03:47:28,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.34ms. Allocated memory is still 175.1MB. Free memory was 118.3MB in the beginning and 99.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-21 03:47:28,691 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.33ms. Allocated memory is still 175.1MB. Free memory was 99.1MB in the beginning and 97.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 03:47:28,691 INFO L158 Benchmark]: Boogie Preprocessor took 57.73ms. Allocated memory is still 175.1MB. Free memory was 96.6MB in the beginning and 93.1MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 03:47:28,691 INFO L158 Benchmark]: RCFGBuilder took 438.71ms. Allocated memory was 175.1MB in the beginning and 256.9MB in the end (delta: 81.8MB). Free memory was 92.8MB in the beginning and 225.0MB in the end (delta: -132.3MB). Peak memory consumption was 29.6MB. Max. memory is 8.0GB. [2023-12-21 03:47:28,691 INFO L158 Benchmark]: TraceAbstraction took 827791.30ms. Allocated memory was 256.9MB in the beginning and 1.0GB in the end (delta: 755.0MB). Free memory was 224.5MB in the beginning and 381.6MB in the end (delta: -157.1MB). Peak memory consumption was 626.2MB. Max. memory is 8.0GB. [2023-12-21 03:47:28,692 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 175.1MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 346.34ms. Allocated memory is still 175.1MB. Free memory was 118.3MB in the beginning and 99.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.33ms. Allocated memory is still 175.1MB. Free memory was 99.1MB in the beginning and 97.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.73ms. Allocated memory is still 175.1MB. Free memory was 96.6MB in the beginning and 93.1MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 438.71ms. Allocated memory was 175.1MB in the beginning and 256.9MB in the end (delta: 81.8MB). Free memory was 92.8MB in the beginning and 225.0MB in the end (delta: -132.3MB). Peak memory consumption was 29.6MB. Max. memory is 8.0GB. * TraceAbstraction took 827791.30ms. Allocated memory was 256.9MB in the beginning and 1.0GB in the end (delta: 755.0MB). Free memory was 224.5MB in the beginning and 381.6MB in the end (delta: -157.1MB). Peak memory consumption was 626.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...