./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i --full-output --preprocessor.use.memory.slicer false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 23:39:15,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 23:39:15,506 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 23:39:15,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 23:39:15,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 23:39:15,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 23:39:15,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 23:39:15,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 23:39:15,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 23:39:15,535 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 23:39:15,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 23:39:15,536 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 23:39:15,536 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 23:39:15,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 23:39:15,537 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 23:39:15,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 23:39:15,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 23:39:15,537 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 23:39:15,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 23:39:15,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 23:39:15,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 23:39:15,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 23:39:15,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 23:39:15,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 23:39:15,539 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 23:39:15,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 23:39:15,539 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 23:39:15,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 23:39:15,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 23:39:15,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 23:39:15,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 23:39:15,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:39:15,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 23:39:15,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 23:39:15,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 23:39:15,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 23:39:15,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 23:39:15,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 23:39:15,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 23:39:15,542 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 23:39:15,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 23:39:15,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 23:39:15,543 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 23:39:15,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 23:39:15,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 23:39:15,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 23:39:15,751 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 23:39:15,752 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 23:39:15,753 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-11-22 23:39:16,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 23:39:16,903 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 23:39:16,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i [2023-11-22 23:39:16,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6915be3da/d0d5043680c142bd803608cf86e39878/FLAG0015fc171 [2023-11-22 23:39:16,931 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6915be3da/d0d5043680c142bd803608cf86e39878 [2023-11-22 23:39:16,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 23:39:16,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 23:39:16,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 23:39:16,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 23:39:16,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 23:39:16,939 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:39:16" (1/1) ... [2023-11-22 23:39:16,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45c6aab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:16, skipping insertion in model container [2023-11-22 23:39:16,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:39:16" (1/1) ... [2023-11-22 23:39:16,967 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 23:39:17,225 WARN L240 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-11-22 23:39:17,228 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:39:17,236 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 23:39:17,285 WARN L240 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-11-22 23:39:17,286 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:39:17,307 INFO L206 MainTranslator]: Completed translation [2023-11-22 23:39:17,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:17 WrapperNode [2023-11-22 23:39:17,308 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 23:39:17,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 23:39:17,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 23:39:17,310 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 23:39:17,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:17" (1/1) ... [2023-11-22 23:39:17,327 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:17" (1/1) ... [2023-11-22 23:39:17,347 INFO L138 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 187 [2023-11-22 23:39:17,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 23:39:17,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 23:39:17,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 23:39:17,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 23:39:17,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:17" (1/1) ... [2023-11-22 23:39:17,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:17" (1/1) ... [2023-11-22 23:39:17,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:17" (1/1) ... [2023-11-22 23:39:17,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:17" (1/1) ... [2023-11-22 23:39:17,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:17" (1/1) ... [2023-11-22 23:39:17,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:17" (1/1) ... [2023-11-22 23:39:17,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:17" (1/1) ... [2023-11-22 23:39:17,385 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:17" (1/1) ... [2023-11-22 23:39:17,387 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 23:39:17,388 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 23:39:17,388 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 23:39:17,388 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 23:39:17,389 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:17" (1/1) ... [2023-11-22 23:39:17,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:39:17,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:39:17,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 23:39:17,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 23:39:17,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-22 23:39:17,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-22 23:39:17,519 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-22 23:39:17,519 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-22 23:39:17,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 23:39:17,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 23:39:17,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 23:39:17,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-22 23:39:17,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-22 23:39:17,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 23:39:17,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-22 23:39:17,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 23:39:17,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 23:39:17,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 23:39:17,607 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 23:39:17,609 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 23:39:17,836 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 23:39:17,863 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 23:39:17,864 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-22 23:39:17,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:39:17 BoogieIcfgContainer [2023-11-22 23:39:17,865 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 23:39:17,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 23:39:17,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 23:39:17,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 23:39:17,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:39:16" (1/3) ... [2023-11-22 23:39:17,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9084c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:39:17, skipping insertion in model container [2023-11-22 23:39:17,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:17" (2/3) ... [2023-11-22 23:39:17,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9084c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:39:17, skipping insertion in model container [2023-11-22 23:39:17,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:39:17" (3/3) ... [2023-11-22 23:39:17,873 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2023-11-22 23:39:17,886 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 23:39:17,887 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 23:39:17,929 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 23:39:17,935 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;@729a98b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 23:39:17,935 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 23:39:17,939 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-11-22 23:39:17,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 23:39:17,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:39:17,947 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:39:17,948 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:39:17,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:39:17,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1280970562, now seen corresponding path program 1 times [2023-11-22 23:39:17,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:39:17,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612086207] [2023-11-22 23:39:17,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:17,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:39:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:18,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:39:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:18,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 23:39:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:18,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 23:39:18,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:39:18,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612086207] [2023-11-22 23:39:18,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612086207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:39:18,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:39:18,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 23:39:18,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932719854] [2023-11-22 23:39:18,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:39:18,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 23:39:18,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:39:18,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 23:39:18,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 23:39:18,281 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-11-22 23:39:18,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:39:18,363 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2023-11-22 23:39:18,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 23:39:18,365 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-11-22 23:39:18,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:39:18,370 INFO L225 Difference]: With dead ends: 66 [2023-11-22 23:39:18,371 INFO L226 Difference]: Without dead ends: 30 [2023-11-22 23:39:18,373 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-11-22 23:39:18,377 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:39:18,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:39:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-22 23:39:18,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-22 23:39:18,458 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-11-22 23:39:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2023-11-22 23:39:18,460 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 19 [2023-11-22 23:39:18,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:39:18,461 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2023-11-22 23:39:18,462 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-11-22 23:39:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2023-11-22 23:39:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 23:39:18,463 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:39:18,464 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:39:18,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 23:39:18,464 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:39:18,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:39:18,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1761698767, now seen corresponding path program 1 times [2023-11-22 23:39:18,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:39:18,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591667604] [2023-11-22 23:39:18,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:18,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:39:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:18,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:39:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:18,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 23:39:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 23:39:18,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:39:18,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591667604] [2023-11-22 23:39:18,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591667604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:39:18,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:39:18,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 23:39:18,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678997998] [2023-11-22 23:39:18,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:39:18,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 23:39:18,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:39:18,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 23:39:18,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 23:39:18,628 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-11-22 23:39:18,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:39:18,703 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2023-11-22 23:39:18,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 23:39:18,704 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-11-22 23:39:18,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:39:18,705 INFO L225 Difference]: With dead ends: 45 [2023-11-22 23:39:18,705 INFO L226 Difference]: Without dead ends: 33 [2023-11-22 23:39:18,708 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-11-22 23:39:18,710 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:39:18,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 80 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:39:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-22 23:39:18,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2023-11-22 23:39:18,719 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-11-22 23:39:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2023-11-22 23:39:18,720 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 19 [2023-11-22 23:39:18,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:39:18,720 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2023-11-22 23:39:18,720 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-11-22 23:39:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2023-11-22 23:39:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-22 23:39:18,722 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:39:18,722 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:39:18,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 23:39:18,722 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:39:18,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:39:18,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1537362706, now seen corresponding path program 1 times [2023-11-22 23:39:18,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:39:18,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502979108] [2023-11-22 23:39:18,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:18,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:39:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:18,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:39:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:18,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 23:39:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:18,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 23:39:18,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:39:18,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502979108] [2023-11-22 23:39:18,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502979108] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:39:18,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:39:18,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 23:39:18,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287927670] [2023-11-22 23:39:18,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:39:18,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 23:39:18,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:39:18,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 23:39:18,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 23:39:18,890 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-11-22 23:39:18,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:39:18,959 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2023-11-22 23:39:18,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 23:39:18,959 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-11-22 23:39:18,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:39:18,960 INFO L225 Difference]: With dead ends: 57 [2023-11-22 23:39:18,960 INFO L226 Difference]: Without dead ends: 33 [2023-11-22 23:39:18,960 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-11-22 23:39:18,961 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:39:18,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 75 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:39:18,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-22 23:39:18,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-22 23:39:18,964 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-11-22 23:39:18,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2023-11-22 23:39:18,965 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 20 [2023-11-22 23:39:18,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:39:18,965 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2023-11-22 23:39:18,965 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-11-22 23:39:18,965 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2023-11-22 23:39:18,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-22 23:39:18,966 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:39:18,966 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-11-22 23:39:18,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 23:39:18,966 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:39:18,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:39:18,967 INFO L85 PathProgramCache]: Analyzing trace with hash 434779626, now seen corresponding path program 1 times [2023-11-22 23:39:18,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:39:18,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729827844] [2023-11-22 23:39:18,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:18,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:39:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:20,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:39:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:20,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 23:39:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:21,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 23:39:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 23:39:21,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:39:21,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729827844] [2023-11-22 23:39:21,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729827844] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:39:21,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703946995] [2023-11-22 23:39:21,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:21,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:39:21,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:39:21,377 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-11-22 23:39:21,405 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-11-22 23:39:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:21,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 131 conjunts are in the unsatisfiable core [2023-11-22 23:39:21,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:39:21,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-22 23:39:21,897 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-11-22 23:39:21,986 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-11-22 23:39:22,069 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-22 23:39:22,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-22 23:39:22,149 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-11-22 23:39:22,157 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-11-22 23:39:22,252 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 23:39:22,253 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 66 treesize of output 57 [2023-11-22 23:39:22,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-22 23:39:22,499 INFO L349 Elim1Store]: treesize reduction 92, result has 10.7 percent of original size [2023-11-22 23:39:22,500 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 191 treesize of output 66 [2023-11-22 23:39:22,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:22,511 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-11-22 23:39:22,516 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-11-22 23:39:22,623 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 23:39:22,624 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 72 treesize of output 35 [2023-11-22 23:39:22,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-22 23:39:22,633 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 11 treesize of output 7 [2023-11-22 23:39:22,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-22 23:39:22,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:22,765 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 16 treesize of output 11 [2023-11-22 23:39:22,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:22,791 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-22 23:39:22,792 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 80 treesize of output 61 [2023-11-22 23:39:22,807 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-22 23:39:22,808 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-11-22 23:39:22,832 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-22 23:39:22,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-22 23:39:23,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:23,158 INFO L349 Elim1Store]: treesize reduction 106, result has 4.5 percent of original size [2023-11-22 23:39:23,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 210 treesize of output 132 [2023-11-22 23:39:23,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:23,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:23,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:23,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 11 [2023-11-22 23:39:23,174 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 39 treesize of output 15 [2023-11-22 23:39:23,179 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 29 treesize of output 15 [2023-11-22 23:39:23,198 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 18 treesize of output 14 [2023-11-22 23:39:23,249 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-11-22 23:39:23,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-22 23:39:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:39:23,325 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:39:23,426 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_ArrVal_569 (Array Int Int)) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_561) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_568) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_562) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_570) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_569) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= v_ArrVal_565 (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_565 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)))))) is different from false [2023-11-22 23:39:23,449 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_ArrVal_569 (Array Int Int)) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (or (not (= v_ArrVal_565 (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select v_ArrVal_565 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_567) .cse0 v_ArrVal_561) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_563) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_568) .cse0 v_ArrVal_562) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_570) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_564) .cse0 v_ArrVal_569) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) is different from false [2023-11-22 23:39:23,465 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_ArrVal_569 (Array Int Int)) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (= v_ArrVal_565 (store (select |c_#memory_int| .cse0) .cse1 (select v_ArrVal_565 .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) (select (select (store (store (store |c_#memory_int| .cse0 v_ArrVal_565) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_567) .cse2 v_ArrVal_561) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_563) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_568) .cse2 v_ArrVal_562) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_570) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_564) .cse2 v_ArrVal_569) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))) is different from false [2023-11-22 23:39:23,572 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_580 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| Int) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_565 (Array Int Int)) (v_ArrVal_568 (Array Int Int)) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_ArrVal_569 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| v_ArrVal_581))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse3 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select .cse2 .cse0) .cse3))) (select (select (store (store (store |c_#memory_int| .cse0 v_ArrVal_565) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| v_ArrVal_567) .cse1 v_ArrVal_561) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_563) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| v_ArrVal_568) .cse1 v_ArrVal_562) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_570) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| v_ArrVal_564) .cse1 v_ArrVal_569) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) (not (= v_ArrVal_565 (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| v_ArrVal_580) .cse0) .cse3 (select v_ArrVal_565 .cse3)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| 1)))))) is different from false [2023-11-22 23:39:23,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703946995] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:39:23,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:39:23,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 42 [2023-11-22 23:39:23,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604776079] [2023-11-22 23:39:23,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:39:23,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-22 23:39:23,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:39:23,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-22 23:39:23,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1759, Unknown=4, NotChecked=348, Total=2256 [2023-11-22 23:39:23,579 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 42 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 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-11-22 23:39:26,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:39:26,260 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2023-11-22 23:39:26,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-22 23:39:26,268 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 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-11-22 23:39:26,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:39:26,271 INFO L225 Difference]: With dead ends: 94 [2023-11-22 23:39:26,272 INFO L226 Difference]: Without dead ends: 92 [2023-11-22 23:39:26,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=363, Invalid=4341, Unknown=4, NotChecked=548, Total=5256 [2023-11-22 23:39:26,277 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 146 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-22 23:39:26,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 405 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-22 23:39:26,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-22 23:39:26,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 38. [2023-11-22 23:39:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 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-11-22 23:39:26,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2023-11-22 23:39:26,298 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 28 [2023-11-22 23:39:26,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:39:26,299 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2023-11-22 23:39:26,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 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-11-22 23:39:26,299 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2023-11-22 23:39:26,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-22 23:39:26,304 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:39:26,304 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-11-22 23:39:26,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-22 23:39:26,516 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-11-22 23:39:26,516 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:39:26,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:39:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1828890171, now seen corresponding path program 1 times [2023-11-22 23:39:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:39:26,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183340264] [2023-11-22 23:39:26,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:26,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:39:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:26,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:39:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:26,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 23:39:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:26,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 23:39:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-22 23:39:26,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:39:26,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183340264] [2023-11-22 23:39:26,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183340264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:39:26,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:39:26,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 23:39:26,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113918972] [2023-11-22 23:39:26,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:39:26,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 23:39:26,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:39:26,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 23:39:26,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 23:39:26,617 INFO L87 Difference]: Start difference. First operand 38 states and 52 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-11-22 23:39:26,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:39:26,662 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2023-11-22 23:39:26,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 23:39:26,663 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-11-22 23:39:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:39:26,664 INFO L225 Difference]: With dead ends: 52 [2023-11-22 23:39:26,664 INFO L226 Difference]: Without dead ends: 37 [2023-11-22 23:39:26,664 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-11-22 23:39:26,665 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 27 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:39:26,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 82 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:39:26,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-22 23:39:26,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-22 23:39:26,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 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-11-22 23:39:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2023-11-22 23:39:26,674 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 29 [2023-11-22 23:39:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:39:26,674 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2023-11-22 23:39:26,674 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-11-22 23:39:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2023-11-22 23:39:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-22 23:39:26,675 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:39:26,676 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-11-22 23:39:26,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 23:39:26,676 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:39:26,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:39:26,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2128958037, now seen corresponding path program 2 times [2023-11-22 23:39:26,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:39:26,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874856435] [2023-11-22 23:39:26,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:26,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:39:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:26,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:39:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:26,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 23:39:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:26,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 23:39:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-22 23:39:26,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:39:26,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874856435] [2023-11-22 23:39:26,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874856435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:39:26,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:39:26,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 23:39:26,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517045205] [2023-11-22 23:39:26,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:39:26,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 23:39:26,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:39:26,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 23:39:26,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 23:39:26,808 INFO L87 Difference]: Start difference. First operand 37 states and 50 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-11-22 23:39:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:39:26,872 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2023-11-22 23:39:26,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 23:39:26,873 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-11-22 23:39:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:39:26,873 INFO L225 Difference]: With dead ends: 51 [2023-11-22 23:39:26,873 INFO L226 Difference]: Without dead ends: 35 [2023-11-22 23:39:26,874 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-11-22 23:39:26,875 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 32 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:39:26,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 100 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:39:26,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-22 23:39:26,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-22 23:39:26,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 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-11-22 23:39:26,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2023-11-22 23:39:26,883 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 29 [2023-11-22 23:39:26,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:39:26,884 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2023-11-22 23:39:26,884 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-11-22 23:39:26,884 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2023-11-22 23:39:26,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-22 23:39:26,886 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:39:26,886 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-11-22 23:39:26,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-22 23:39:26,886 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:39:26,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:39:26,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1486153936, now seen corresponding path program 1 times [2023-11-22 23:39:26,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:39:26,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146383400] [2023-11-22 23:39:26,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:26,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:39:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:27,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:39:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:27,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 23:39:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:27,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 23:39:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-22 23:39:27,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:39:27,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146383400] [2023-11-22 23:39:27,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146383400] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:39:27,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815755791] [2023-11-22 23:39:27,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:27,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:39:27,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:39:27,024 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-11-22 23:39:27,051 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-11-22 23:39:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:27,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-22 23:39:27,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:39:27,202 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-22 23:39:27,202 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:39:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-22 23:39:27,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815755791] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:39:27,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 23:39:27,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2023-11-22 23:39:27,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034485223] [2023-11-22 23:39:27,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 23:39:27,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 23:39:27,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:39:27,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 23:39:27,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-22 23:39:27,250 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-22 23:39:27,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:39:27,349 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2023-11-22 23:39:27,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 23:39:27,351 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2023-11-22 23:39:27,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:39:27,352 INFO L225 Difference]: With dead ends: 48 [2023-11-22 23:39:27,352 INFO L226 Difference]: Without dead ends: 35 [2023-11-22 23:39:27,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-22 23:39:27,353 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:39:27,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 146 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:39:27,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-22 23:39:27,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-22 23:39:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 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-11-22 23:39:27,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2023-11-22 23:39:27,357 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 30 [2023-11-22 23:39:27,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:39:27,357 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2023-11-22 23:39:27,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-22 23:39:27,357 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2023-11-22 23:39:27,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-22 23:39:27,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:39:27,358 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-11-22 23:39:27,369 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-11-22 23:39:27,569 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-11-22 23:39:27,570 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:39:27,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:39:27,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1428895634, now seen corresponding path program 1 times [2023-11-22 23:39:27,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:39:27,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810364035] [2023-11-22 23:39:27,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:27,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:39:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:27,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:39:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:27,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 23:39:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:27,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 23:39:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:27,862 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 23:39:27,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:39:27,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810364035] [2023-11-22 23:39:27,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810364035] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:39:27,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371176479] [2023-11-22 23:39:27,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:27,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:39:27,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:39:27,868 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-11-22 23:39:27,869 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-11-22 23:39:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:28,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-22 23:39:28,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:39:28,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-22 23:39:28,077 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))))) is different from true [2023-11-22 23:39:28,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:28,083 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 17 treesize of output 12 [2023-11-22 23:39:28,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-22 23:39:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-22 23:39:28,116 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:39:28,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371176479] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:39:28,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:39:28,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2023-11-22 23:39:28,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658306238] [2023-11-22 23:39:28,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:39:28,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-22 23:39:28,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:39:28,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-22 23:39:28,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=359, Unknown=6, NotChecked=38, Total=462 [2023-11-22 23:39:28,172 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 21 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-22 23:39:28,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:39:28,464 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2023-11-22 23:39:28,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-22 23:39:28,465 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2023-11-22 23:39:28,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:39:28,465 INFO L225 Difference]: With dead ends: 67 [2023-11-22 23:39:28,465 INFO L226 Difference]: Without dead ends: 36 [2023-11-22 23:39:28,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=648, Unknown=6, NotChecked=52, Total=812 [2023-11-22 23:39:28,466 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 23:39:28,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 297 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 301 Invalid, 0 Unknown, 42 Unchecked, 0.2s Time] [2023-11-22 23:39:28,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-22 23:39:28,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2023-11-22 23:39:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 23:39:28,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2023-11-22 23:39:28,471 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 30 [2023-11-22 23:39:28,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:39:28,471 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2023-11-22 23:39:28,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-22 23:39:28,471 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2023-11-22 23:39:28,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-22 23:39:28,471 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:39:28,471 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-11-22 23:39:28,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-22 23:39:28,671 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-11-22 23:39:28,672 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:39:28,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:39:28,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1022802718, now seen corresponding path program 1 times [2023-11-22 23:39:28,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:39:28,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922011046] [2023-11-22 23:39:28,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:28,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:39:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:30,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:39:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:30,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 23:39:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:30,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 23:39:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:30,736 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 23:39:30,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:39:30,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922011046] [2023-11-22 23:39:30,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922011046] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:39:30,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098892656] [2023-11-22 23:39:30,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:30,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:39:30,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:39:30,738 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:39:30,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-22 23:39:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:31,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 164 conjunts are in the unsatisfiable core [2023-11-22 23:39:31,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:39:31,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-22 23:39:31,136 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-11-22 23:39:31,237 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-22 23:39:31,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-22 23:39:31,342 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 11 treesize of output 7 [2023-11-22 23:39:31,411 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|) (<= (+ 1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |c_#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |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) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2023-11-22 23:39:31,412 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|) (<= (+ 1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |c_#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |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) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2023-11-22 23:39:31,425 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-11-22 23:39:31,445 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) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |c_#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2023-11-22 23:39:31,447 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) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |c_#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2023-11-22 23:39:31,476 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-22 23:39:31,477 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-22 23:39:31,483 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-11-22 23:39:31,491 WARN L854 $PredicateComparison]: unable to prove that (and (or (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |c_#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |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) (<= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2023-11-22 23:39:31,493 WARN L876 $PredicateComparison]: unable to prove that (and (or (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |c_#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |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) (<= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2023-11-22 23:39:31,531 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|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |c_#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2023-11-22 23:39:31,532 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|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |c_#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2023-11-22 23:39:31,653 INFO L349 Elim1Store]: treesize reduction 33, result has 45.0 percent of original size [2023-11-22 23:39:31,653 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 1 case distinctions, treesize of input 119 treesize of output 74 [2023-11-22 23:39:31,690 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse1 (select .cse3 4))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_8| |c_#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= (select |c_#valid| .cse0) 1) (= .cse1 (select .cse3 0)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2023-11-22 23:39:31,692 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse1 (select .cse3 4))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_8| |c_#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= (select |c_#valid| .cse0) 1) (= .cse1 (select .cse3 0)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2023-11-22 23:39:31,718 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-22 23:39:31,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 37 [2023-11-22 23:39:31,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-22 23:39:31,747 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= (+ v_arrayElimIndex_8 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from false [2023-11-22 23:39:31,749 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= (+ v_arrayElimIndex_8 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from true [2023-11-22 23:39:31,787 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= (+ v_arrayElimIndex_8 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from false [2023-11-22 23:39:31,789 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= (+ v_arrayElimIndex_8 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from true [2023-11-22 23:39:31,827 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-11-22 23:39:31,836 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= (+ v_arrayElimIndex_8 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|)))) is different from false [2023-11-22 23:39:31,837 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= (+ v_arrayElimIndex_8 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|)))) is different from true [2023-11-22 23:39:31,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:31,906 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-11-22 23:39:31,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 81 [2023-11-22 23:39:31,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:31,966 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 16 treesize of output 11 [2023-11-22 23:39:31,985 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (+ .cse0 2)) (.cse4 (+ 2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse1 (select .cse7 4))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (let ((.cse3 (+ v_arrayElimIndex_8 2))) (and (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse5 (select |v_#valid_BEFORE_CALL_9| .cse5))) |v_#valid_BEFORE_CALL_9|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= .cse1 (select .cse7 0)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0))))) is different from false [2023-11-22 23:39:31,988 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (+ .cse0 2)) (.cse4 (+ 2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse1 (select .cse7 4))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (let ((.cse3 (+ v_arrayElimIndex_8 2))) (and (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse5 (select |v_#valid_BEFORE_CALL_9| .cse5))) |v_#valid_BEFORE_CALL_9|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= .cse1 (select .cse7 0)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0))))) is different from true [2023-11-22 23:39:32,082 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (+ .cse0 2)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse1 (select .cse7 4))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (let ((.cse3 (+ v_arrayElimIndex_8 2))) (and (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse5 (select |v_#valid_BEFORE_CALL_9| .cse5))) |v_#valid_BEFORE_CALL_9|)))) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|))) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= .cse1 (select .cse7 0)) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2023-11-22 23:39:32,086 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (+ .cse0 2)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse1 (select .cse7 4))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (let ((.cse3 (+ v_arrayElimIndex_8 2))) (and (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse5 (select |v_#valid_BEFORE_CALL_9| .cse5))) |v_#valid_BEFORE_CALL_9|)))) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|))) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= .cse1 (select .cse7 0)) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2023-11-22 23:39:32,191 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (+ .cse0 2)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse7 (select .cse8 0)) (.cse1 (select .cse8 4))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (let ((.cse3 (+ v_arrayElimIndex_8 2))) (and (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse5 (select |v_#valid_BEFORE_CALL_9| .cse5))) |v_#valid_BEFORE_CALL_9|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|))) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= .cse1 .cse7) (= .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2023-11-22 23:39:32,193 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (+ .cse0 2)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse7 (select .cse8 0)) (.cse1 (select .cse8 4))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (let ((.cse3 (+ v_arrayElimIndex_8 2))) (and (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse5 (select |v_#valid_BEFORE_CALL_9| .cse5))) |v_#valid_BEFORE_CALL_9|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|))) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= .cse1 .cse7) (= .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2023-11-22 23:39:32,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:32,368 INFO L349 Elim1Store]: treesize reduction 106, result has 21.5 percent of original size [2023-11-22 23:39:32,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 336 treesize of output 169 [2023-11-22 23:39:32,414 INFO L349 Elim1Store]: treesize reduction 102, result has 13.6 percent of original size [2023-11-22 23:39:32,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 389 treesize of output 257 [2023-11-22 23:39:32,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:32,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 37 [2023-11-22 23:39:32,448 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 37 treesize of output 15 [2023-11-22 23:39:32,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:32,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2023-11-22 23:39:32,471 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 13 treesize of output 11 [2023-11-22 23:39:32,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:32,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:32,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 29 [2023-11-22 23:39:32,598 INFO L349 Elim1Store]: treesize reduction 70, result has 1.4 percent of original size [2023-11-22 23:39:32,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 331 treesize of output 139 [2023-11-22 23:39:32,606 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:39:32,610 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-22 23:39:32,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:32,653 INFO L349 Elim1Store]: treesize reduction 134, result has 0.7 percent of original size [2023-11-22 23:39:32,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 308 treesize of output 129 [2023-11-22 23:39:32,670 INFO L349 Elim1Store]: treesize reduction 70, result has 1.4 percent of original size [2023-11-22 23:39:32,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 311 treesize of output 131 [2023-11-22 23:39:32,688 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimIndex_11 Int) (v_arrayElimCell_44 Int)) (let ((.cse9 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_11))) (let ((.cse3 (select .cse9 0))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse0 (select .cse5 4))) (let ((.cse2 (+ 2 .cse0)) (.cse1 (+ v_arrayElimIndex_8 2)) (.cse4 (select .cse9 4)) (.cse6 (+ 2 .cse3))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| .cse3) 8)) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= .cse0 v_arrayElimIndex_11) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (not (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse5 0) .cse4) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (<= .cse6 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse7 (select |v_#valid_BEFORE_CALL_9| .cse7))) |v_#valid_BEFORE_CALL_9|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse8 (select |v_old(#valid)_AFTER_CALL_12| .cse8))) |v_old(#valid)_AFTER_CALL_12|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) .cse0)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) is different from false [2023-11-22 23:39:32,692 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimIndex_11 Int) (v_arrayElimCell_44 Int)) (let ((.cse9 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_11))) (let ((.cse3 (select .cse9 0))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse0 (select .cse5 4))) (let ((.cse2 (+ 2 .cse0)) (.cse1 (+ v_arrayElimIndex_8 2)) (.cse4 (select .cse9 4)) (.cse6 (+ 2 .cse3))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| .cse3) 8)) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= .cse0 v_arrayElimIndex_11) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (not (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse5 0) .cse4) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (<= .cse6 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse7 (select |v_#valid_BEFORE_CALL_9| .cse7))) |v_#valid_BEFORE_CALL_9|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse8 (select |v_old(#valid)_AFTER_CALL_12| .cse8))) |v_old(#valid)_AFTER_CALL_12|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) .cse0)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) is different from true [2023-11-22 23:39:32,823 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimIndex_11 Int) (v_arrayElimCell_44 Int)) (let ((.cse10 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_11))) (let ((.cse4 (select .cse10 0))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse1 (select .cse6 4))) (let ((.cse3 (+ 2 .cse1)) (.cse2 (+ v_arrayElimIndex_8 2)) (.cse5 (select .cse10 4)) (.cse7 (+ 2 .cse4))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse1) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| .cse4) 8)) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= .cse1 v_arrayElimIndex_11) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (not (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse6 0) .cse5) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (<= .cse7 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse8 (select |v_#valid_BEFORE_CALL_9| .cse8))) |v_#valid_BEFORE_CALL_9|) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse9 (select |v_old(#valid)_AFTER_CALL_12| .cse9))) |v_old(#valid)_AFTER_CALL_12|) (= .cse0 .cse1)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) is different from false [2023-11-22 23:39:32,826 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimIndex_11 Int) (v_arrayElimCell_44 Int)) (let ((.cse10 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_11))) (let ((.cse4 (select .cse10 0))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse1 (select .cse6 4))) (let ((.cse3 (+ 2 .cse1)) (.cse2 (+ v_arrayElimIndex_8 2)) (.cse5 (select .cse10 4)) (.cse7 (+ 2 .cse4))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse1) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| .cse4) 8)) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= .cse1 v_arrayElimIndex_11) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (not (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse6 0) .cse5) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (<= .cse7 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse8 (select |v_#valid_BEFORE_CALL_9| .cse8))) |v_#valid_BEFORE_CALL_9|) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse9 (select |v_old(#valid)_AFTER_CALL_12| .cse9))) |v_old(#valid)_AFTER_CALL_12|) (= .cse0 .cse1)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) is different from true [2023-11-22 23:39:32,980 INFO L349 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2023-11-22 23:39:32,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 186 treesize of output 87 [2023-11-22 23:39:32,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:32,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-22 23:39:33,070 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_78 Int) (v_arrayElimCell_44 Int) (v_arrayElimIndex_22 Int)) (let ((.cse0 (+ v_arrayElimIndex_8 2)) (.cse2 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse1 (+ 2 v_arrayElimIndex_22))) (and (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_old(#valid)_AFTER_CALL_12| v_arrayElimIndex_22) 1) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_11| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_78) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimIndex_22) 0) (not (= v_arrayElimCell_78 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse3 (select |v_#valid_BEFORE_CALL_9| .cse3))) |v_#valid_BEFORE_CALL_9|) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8))) is different from false [2023-11-22 23:39:33,072 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_78 Int) (v_arrayElimCell_44 Int) (v_arrayElimIndex_22 Int)) (let ((.cse0 (+ v_arrayElimIndex_8 2)) (.cse2 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse1 (+ 2 v_arrayElimIndex_22))) (and (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_old(#valid)_AFTER_CALL_12| v_arrayElimIndex_22) 1) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_11| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_78) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimIndex_22) 0) (not (= v_arrayElimCell_78 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse3 (select |v_#valid_BEFORE_CALL_9| .cse3))) |v_#valid_BEFORE_CALL_9|) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8))) is different from true [2023-11-22 23:39:33,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-22 23:39:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2023-11-22 23:39:33,182 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:39:33,216 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int)) (v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1628 (Array Int Int)) (v_ArrVal_1627 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1625)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4))) (or (not (= (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1622 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1622 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1622)) (= (let ((.cse5 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |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.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1624)) (.cse2 (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.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|)))) (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1627))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1622) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1628) (select (select .cse2 .cse3) .cse4)) (+ 8 (select (select .cse5 .cse3) .cse4))))) |c_ULTIMATE.start_main_~uneq~0#1|)))) is different from false [2023-11-22 23:39:33,243 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int)) (v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1628 (Array Int Int)) (v_ArrVal_1627 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1625)) (.cse7 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1623) .cse1 v_ArrVal_1624)) (.cse2 (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse1))) .cse1 v_ArrVal_1627))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1622) .cse1 v_ArrVal_1628) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 8))))))) (not (= (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1622 .cse7)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1622 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1622))))) is different from false [2023-11-22 23:39:33,259 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int)) (v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1628 (Array Int Int)) (v_ArrVal_1627 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse0 (store |c_#memory_int| .cse8 v_ArrVal_1625)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4))) (or (not (= (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 (select v_ArrVal_1622 .cse1)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1622 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1622)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse8)) (.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select .cse9 .cse10))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$.offset| .cse8 (store (select |c_#memory_$Pointer$.offset| .cse8) .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1623) .cse2 v_ArrVal_1624)) (.cse3 (store (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse8 (store .cse9 .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)))) (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 .cse8) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| .cse2))) .cse2 v_ArrVal_1627))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1622) .cse2 v_ArrVal_1628) (select (select .cse3 .cse4) .cse5)) (+ (select (select .cse6 .cse4) .cse5) 8))))))))))) is different from false [2023-11-22 23:39:33,424 INFO L349 Elim1Store]: treesize reduction 1199, result has 50.2 percent of original size [2023-11-22 23:39:33,425 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 2 case distinctions, treesize of input 63452 treesize of output 59878 [2023-11-22 23:39:33,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:39:33,476 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 5026 treesize of output 5026 [2023-11-22 23:39:33,507 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 7021 treesize of output 6229 [2023-11-22 23:39:33,524 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 3468 treesize of output 2412 [2023-11-22 23:39:33,559 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 268 treesize of output 4 [2023-11-22 23:39:34,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:39:34,644 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 21159 treesize of output 19047 [2023-11-22 23:39:35,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098892656] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:39:35,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:39:35,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 42 [2023-11-22 23:39:35,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523465085] [2023-11-22 23:39:35,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:39:35,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-22 23:39:35,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:39:35,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-22 23:39:35,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=805, Unknown=31, NotChecked=1224, Total=2162 [2023-11-22 23:39:35,917 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 43 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 33 states have internal predecessors, (46), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-22 23:39:36,277 WARN L854 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (<= (+ 1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |c_#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |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) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2023-11-22 23:39:36,279 WARN L876 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (<= (+ 1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |c_#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |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) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2023-11-22 23:39:36,282 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (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 |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_8| |c_#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2023-11-22 23:39:36,284 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (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 |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_8| |c_#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from true [2023-11-22 23:39:36,287 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_8| |c_#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (not .cse1))) is different from false [2023-11-22 23:39:36,288 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_8| |c_#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (not .cse1))) is different from true [2023-11-22 23:39:36,292 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_8| |c_#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (not .cse0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1))) is different from false [2023-11-22 23:39:36,293 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_8| |c_#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (not .cse0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1))) is different from true [2023-11-22 23:39:36,302 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select .cse8 0))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse0)) (.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (.cse1 (select .cse6 4))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select |c_#valid| .cse2) 1) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_8| |c_#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= (select |c_#valid| .cse0) 1) (not (= .cse2 .cse3)) (= .cse1 (select .cse6 0)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse3) 1) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| .cse2)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse7 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2023-11-22 23:39:36,303 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select .cse8 0))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse0)) (.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (.cse1 (select .cse6 4))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select |c_#valid| .cse2) 1) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_8| |c_#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= (select |c_#valid| .cse0) 1) (not (= .cse2 .cse3)) (= .cse1 (select .cse6 0)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse3) 1) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| .cse2)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse7 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from true [2023-11-22 23:39:36,334 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= (+ v_arrayElimIndex_8 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|)) is different from false [2023-11-22 23:39:36,336 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= (+ v_arrayElimIndex_8 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|)) is different from true [2023-11-22 23:39:36,359 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= (+ v_arrayElimIndex_8 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from false [2023-11-22 23:39:36,361 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= (+ v_arrayElimIndex_8 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from true [2023-11-22 23:39:36,368 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (and (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= (+ v_arrayElimIndex_8 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse2 (select |v_#valid_BEFORE_CALL_9| .cse2))) |v_#valid_BEFORE_CALL_9|))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|))) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse1 |c_node_create_#res#1.base|)))) is different from false [2023-11-22 23:39:36,371 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (and (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= (+ v_arrayElimIndex_8 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse2 (select |v_#valid_BEFORE_CALL_9| .cse2))) |v_#valid_BEFORE_CALL_9|))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|))) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse1 |c_node_create_#res#1.base|)))) is different from true [2023-11-22 23:39:36,390 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse0)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (+ .cse0 2)) (.cse6 (+ 2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse4) .cse3)) (.cse1 (select .cse10 4))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse3 |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) (not (= .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (let ((.cse5 (+ v_arrayElimIndex_8 2))) (and (<= .cse5 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse6 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse7 (select |v_#valid_BEFORE_CALL_9| .cse7))) |v_#valid_BEFORE_CALL_9|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (not (= .cse4 .cse8)) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse9 (select |v_old(#valid)_AFTER_CALL_12| .cse9))) |v_old(#valid)_AFTER_CALL_12|))) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse3) 0) (not (= .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= .cse1 (select .cse10 0)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| .cse8)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0))))) is different from false [2023-11-22 23:39:36,393 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse0)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (+ .cse0 2)) (.cse6 (+ 2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse4) .cse3)) (.cse1 (select .cse10 4))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse3 |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) (not (= .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (let ((.cse5 (+ v_arrayElimIndex_8 2))) (and (<= .cse5 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse6 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse7 (select |v_#valid_BEFORE_CALL_9| .cse7))) |v_#valid_BEFORE_CALL_9|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (not (= .cse4 .cse8)) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse9 (select |v_old(#valid)_AFTER_CALL_12| .cse9))) |v_old(#valid)_AFTER_CALL_12|))) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse3) 0) (not (= .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= .cse1 (select .cse10 0)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| .cse8)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0))))) is different from true [2023-11-22 23:39:36,405 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse8 0))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (+ .cse0 2)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse1 (select .cse9 4)) (.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (let ((.cse4 (+ v_arrayElimIndex_8 2))) (and (<= .cse4 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse6 (select |v_#valid_BEFORE_CALL_9| .cse6))) |v_#valid_BEFORE_CALL_9|)))) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (not (= .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse7 (select |v_old(#valid)_AFTER_CALL_12| .cse7))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= .cse1 (select .cse9 0)) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse10 0) 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))))))) is different from false [2023-11-22 23:39:36,408 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse8 0))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (+ .cse0 2)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse1 (select .cse9 4)) (.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (let ((.cse4 (+ v_arrayElimIndex_8 2))) (and (<= .cse4 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse6 (select |v_#valid_BEFORE_CALL_9| .cse6))) |v_#valid_BEFORE_CALL_9|)))) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (not (= .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse7 (select |v_old(#valid)_AFTER_CALL_12| .cse7))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= .cse1 (select .cse9 0)) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse10 0) 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))))))) is different from true [2023-11-22 23:39:36,419 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse9 0))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (+ .cse0 2)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse7 (select .cse10 0)) (.cse1 (select .cse10 4)) (.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (let ((.cse3 (+ v_arrayElimIndex_8 2))) (and (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse5 (select |v_#valid_BEFORE_CALL_9| .cse5))) |v_#valid_BEFORE_CALL_9|)))) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|))) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= .cse1 .cse7) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse8 0) 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))))))) is different from false [2023-11-22 23:39:36,422 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse9 0))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (+ .cse0 2)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse7 (select .cse10 0)) (.cse1 (select .cse10 4)) (.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_44 Int)) (let ((.cse3 (+ v_arrayElimIndex_8 2))) (and (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse5 (select |v_#valid_BEFORE_CALL_9| .cse5))) |v_#valid_BEFORE_CALL_9|)))) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|))) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= .cse1 .cse7) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse8 0) 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))))))) is different from true [2023-11-22 23:39:36,434 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (+ (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) 8)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimIndex_11 Int) (v_arrayElimCell_44 Int)) (let ((.cse13 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_11))) (let ((.cse7 (select .cse13 0))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse4 (select .cse9 4))) (let ((.cse6 (+ 2 .cse4)) (.cse5 (+ v_arrayElimIndex_8 2)) (.cse8 (select .cse13 4)) (.cse10 (+ 2 .cse7))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (<= .cse6 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse7) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| .cse7) 8)) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 0) 0) (= .cse4 v_arrayElimIndex_11) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (not (= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse9 0) .cse8) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_11| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (<= .cse10 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse11 (select |v_#valid_BEFORE_CALL_9| .cse11))) |v_#valid_BEFORE_CALL_9|) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse12 (select |v_old(#valid)_AFTER_CALL_12| .cse12))) |v_old(#valid)_AFTER_CALL_12|) (= (select .cse3 0) .cse4)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse2 0) 0))) is different from false [2023-11-22 23:39:36,437 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (+ (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) 8)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimIndex_11 Int) (v_arrayElimCell_44 Int)) (let ((.cse13 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_11))) (let ((.cse7 (select .cse13 0))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse4 (select .cse9 4))) (let ((.cse6 (+ 2 .cse4)) (.cse5 (+ v_arrayElimIndex_8 2)) (.cse8 (select .cse13 4)) (.cse10 (+ 2 .cse7))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (<= .cse6 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse7) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| .cse7) 8)) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 0) 0) (= .cse4 v_arrayElimIndex_11) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (not (= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse9 0) .cse8) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_11| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (<= .cse10 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse11 (select |v_#valid_BEFORE_CALL_9| .cse11))) |v_#valid_BEFORE_CALL_9|) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse12 (select |v_old(#valid)_AFTER_CALL_12| .cse12))) |v_old(#valid)_AFTER_CALL_12|) (= (select .cse3 0) .cse4)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse2 0) 0))) is different from true [2023-11-22 23:39:36,446 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimIndex_11 Int) (v_arrayElimCell_44 Int)) (let ((.cse10 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_11))) (let ((.cse4 (select .cse10 0))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse1 (select .cse6 4))) (let ((.cse3 (+ 2 .cse1)) (.cse2 (+ v_arrayElimIndex_8 2)) (.cse5 (select .cse10 4)) (.cse7 (+ 2 .cse4))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse1) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| .cse4) 8)) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= .cse1 v_arrayElimIndex_11) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (not (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse6 0) .cse5) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (<= .cse7 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse8 (select |v_#valid_BEFORE_CALL_9| .cse8))) |v_#valid_BEFORE_CALL_9|) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse9 (select |v_old(#valid)_AFTER_CALL_12| .cse9))) |v_old(#valid)_AFTER_CALL_12|) (= .cse0 .cse1)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) 8))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) is different from false [2023-11-22 23:39:36,449 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimIndex_11 Int) (v_arrayElimCell_44 Int)) (let ((.cse10 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_11))) (let ((.cse4 (select .cse10 0))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse1 (select .cse6 4))) (let ((.cse3 (+ 2 .cse1)) (.cse2 (+ v_arrayElimIndex_8 2)) (.cse5 (select .cse10 4)) (.cse7 (+ 2 .cse4))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse1) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| .cse4) 8)) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= .cse1 v_arrayElimIndex_11) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (not (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse6 0) .cse5) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (<= .cse7 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse8 (select |v_#valid_BEFORE_CALL_9| .cse8))) |v_#valid_BEFORE_CALL_9|) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse9 (select |v_old(#valid)_AFTER_CALL_12| .cse9))) |v_old(#valid)_AFTER_CALL_12|) (= .cse0 .cse1)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) 8))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) is different from true [2023-11-22 23:39:36,461 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_78 Int) (v_arrayElimCell_44 Int) (v_arrayElimIndex_22 Int)) (let ((.cse0 (+ v_arrayElimIndex_8 2)) (.cse2 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse1 (+ 2 v_arrayElimIndex_22))) (and (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_old(#valid)_AFTER_CALL_12| v_arrayElimIndex_22) 1) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_11| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_78) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimIndex_22) 0) (not (= v_arrayElimCell_78 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse3 (select |v_#valid_BEFORE_CALL_9| .cse3))) |v_#valid_BEFORE_CALL_9|) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse5 8)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse5 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 8))))) is different from false [2023-11-22 23:39:36,464 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimIndex_8 Int) (v_arrayElimCell_78 Int) (v_arrayElimCell_44 Int) (v_arrayElimIndex_22 Int)) (let ((.cse0 (+ v_arrayElimIndex_8 2)) (.cse2 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse1 (+ 2 v_arrayElimIndex_22))) (and (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_old(#valid)_AFTER_CALL_12| v_arrayElimIndex_22) 1) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_11| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_78) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimIndex_22) 0) (not (= v_arrayElimCell_78 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse3 (select |v_#valid_BEFORE_CALL_9| .cse3))) |v_#valid_BEFORE_CALL_9|) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse5 8)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse5 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 8))))) is different from true [2023-11-22 23:39:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:39:36,651 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2023-11-22 23:39:36,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-22 23:39:36,652 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 33 states have internal predecessors, (46), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 31 [2023-11-22 23:39:36,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:39:36,652 INFO L225 Difference]: With dead ends: 54 [2023-11-22 23:39:36,652 INFO L226 Difference]: Without dead ends: 52 [2023-11-22 23:39:36,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 31 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=150, Invalid=971, Unknown=59, NotChecked=2852, Total=4032 [2023-11-22 23:39:36,653 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1402 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 23:39:36,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 482 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 434 Invalid, 0 Unknown, 1402 Unchecked, 0.3s Time] [2023-11-22 23:39:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-22 23:39:36,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-22 23:39:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 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-11-22 23:39:36,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2023-11-22 23:39:36,661 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 31 [2023-11-22 23:39:36,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:39:36,662 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2023-11-22 23:39:36,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 33 states have internal predecessors, (46), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-22 23:39:36,662 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2023-11-22 23:39:36,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-22 23:39:36,662 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:39:36,663 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, 1, 1] [2023-11-22 23:39:36,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-22 23:39:36,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:39:36,876 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:39:36,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:39:36,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1022759008, now seen corresponding path program 1 times [2023-11-22 23:39:36,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:39:36,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941420048] [2023-11-22 23:39:36,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:36,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:39:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:37,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:39:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:37,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 23:39:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:37,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 23:39:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:37,059 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-22 23:39:37,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:39:37,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941420048] [2023-11-22 23:39:37,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941420048] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:39:37,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222189850] [2023-11-22 23:39:37,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:37,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:39:37,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:39:37,061 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:39:37,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-22 23:39:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:37,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-22 23:39:37,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:39:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-22 23:39:37,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:39:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-22 23:39:37,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222189850] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:39:37,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 23:39:37,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2023-11-22 23:39:37,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053110538] [2023-11-22 23:39:37,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 23:39:37,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-22 23:39:37,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:39:37,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-22 23:39:37,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-11-22 23:39:37,331 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-22 23:39:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:39:37,457 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2023-11-22 23:39:37,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 23:39:37,458 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 31 [2023-11-22 23:39:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:39:37,458 INFO L225 Difference]: With dead ends: 63 [2023-11-22 23:39:37,458 INFO L226 Difference]: Without dead ends: 52 [2023-11-22 23:39:37,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2023-11-22 23:39:37,460 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 61 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:39:37,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 166 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:39:37,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-22 23:39:37,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2023-11-22 23:39:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 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-11-22 23:39:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2023-11-22 23:39:37,470 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 31 [2023-11-22 23:39:37,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:39:37,472 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2023-11-22 23:39:37,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-22 23:39:37,472 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2023-11-22 23:39:37,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-22 23:39:37,474 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:39:37,474 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-11-22 23:39:37,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-22 23:39:37,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-22 23:39:37,687 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:39:37,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:39:37,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1583220836, now seen corresponding path program 1 times [2023-11-22 23:39:37,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:39:37,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459570421] [2023-11-22 23:39:37,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:37,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:39:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:37,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:39:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:37,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 23:39:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:37,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 23:39:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-22 23:39:37,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:39:37,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459570421] [2023-11-22 23:39:37,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459570421] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:39:37,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35329618] [2023-11-22 23:39:37,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:37,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:39:37,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:39:37,821 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:39:37,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-22 23:39:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:38,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-22 23:39:38,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:39:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-22 23:39:38,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:39:38,055 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-22 23:39:38,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35329618] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:39:38,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 23:39:38,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-11-22 23:39:38,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441589074] [2023-11-22 23:39:38,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 23:39:38,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 23:39:38,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:39:38,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 23:39:38,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-22 23:39:38,059 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-22 23:39:38,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:39:38,122 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2023-11-22 23:39:38,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 23:39:38,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2023-11-22 23:39:38,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:39:38,123 INFO L225 Difference]: With dead ends: 76 [2023-11-22 23:39:38,123 INFO L226 Difference]: Without dead ends: 50 [2023-11-22 23:39:38,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-22 23:39:38,124 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:39:38,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 137 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:39:38,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-22 23:39:38,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-22 23:39:38,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 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-11-22 23:39:38,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2023-11-22 23:39:38,136 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 31 [2023-11-22 23:39:38,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:39:38,136 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2023-11-22 23:39:38,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-22 23:39:38,136 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2023-11-22 23:39:38,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-22 23:39:38,137 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:39:38,137 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, 1, 1] [2023-11-22 23:39:38,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-22 23:39:38,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:39:38,348 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:39:38,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:39:38,349 INFO L85 PathProgramCache]: Analyzing trace with hash 634120861, now seen corresponding path program 1 times [2023-11-22 23:39:38,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:39:38,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739261307] [2023-11-22 23:39:38,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:38,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:39:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:40,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:39:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:40,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 23:39:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:40,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 23:39:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 23:39:40,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:39:40,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739261307] [2023-11-22 23:39:40,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739261307] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:39:40,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167850917] [2023-11-22 23:39:40,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:40,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:39:40,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:39:40,695 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:39:40,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-22 23:39:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:41,192 WARN L260 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 214 conjunts are in the unsatisfiable core [2023-11-22 23:39:41,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:39:41,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-22 23:39:41,255 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-11-22 23:39:41,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-22 23:39:41,422 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-11-22 23:39:41,557 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-22 23:39:41,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-22 23:39:41,578 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 16 treesize of output 11 [2023-11-22 23:39:41,656 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 16 treesize of output 11 [2023-11-22 23:39:41,673 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-11-22 23:39:41,692 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-11-22 23:39:41,785 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 23:39:41,786 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 104 treesize of output 87 [2023-11-22 23:39:41,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-22 23:39:41,802 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 39 treesize of output 15 [2023-11-22 23:39:42,040 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-22 23:39:42,040 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 1 case distinctions, treesize of input 256 treesize of output 129 [2023-11-22 23:39:42,047 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2023-11-22 23:39:42,050 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 32 treesize of output 19 [2023-11-22 23:39:42,060 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 87 treesize of output 30 [2023-11-22 23:39:42,176 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-22 23:39:42,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 58 [2023-11-22 23:39:42,181 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 11 treesize of output 7 [2023-11-22 23:39:42,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:42,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:42,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-22 23:39:42,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-22 23:39:42,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-22 23:39:42,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:42,405 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 24 treesize of output 19 [2023-11-22 23:39:42,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:42,431 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-11-22 23:39:42,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 148 treesize of output 103 [2023-11-22 23:39:42,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:42,456 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-22 23:39:42,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2023-11-22 23:39:42,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:42,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:42,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:42,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:42,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2023-11-22 23:39:43,052 INFO L349 Elim1Store]: treesize reduction 174, result has 18.7 percent of original size [2023-11-22 23:39:43,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 719 treesize of output 291 [2023-11-22 23:39:43,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:43,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 119 [2023-11-22 23:39:43,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:43,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:43,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 52 [2023-11-22 23:39:43,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-22 23:39:43,117 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-11-22 23:39:43,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:43,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:43,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:43,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:43,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 88 [2023-11-22 23:39:44,209 INFO L349 Elim1Store]: treesize reduction 190, result has 5.5 percent of original size [2023-11-22 23:39:44,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 14 new quantified variables, introduced 36 case distinctions, treesize of input 310 treesize of output 143 [2023-11-22 23:39:44,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:44,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:44,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:44,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:44,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:44,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2023-11-22 23:39:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:39:44,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:39:49,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:39:49,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 6747 treesize of output 6735 [2023-11-22 23:39:49,693 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2405 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_33| Int) (v_ArrVal_2403 (Array Int Int)) (v_ArrVal_2387 (Array Int Int)) (v_ArrVal_2391 Int) (v_ArrVal_2382 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_33| v_ArrVal_2405))) (let ((.cse20 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_33| v_ArrVal_2403)) (.cse11 (select (select .cse15 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse22 (select .cse20 .cse11)) (.cse17 (select (select .cse20 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse21 (select .cse22 .cse17)) (.cse16 (select .cse15 .cse11))) (let ((.cse4 (select .cse16 .cse17)) (.cse5 (+ .cse21 4)) (.cse10 (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_33| v_arrayElimArr_10))) (let ((.cse12 (store (select .cse10 .cse11) .cse17 v_ArrVal_2391)) (.cse9 (let ((.cse18 (let ((.cse19 (store .cse22 .cse17 0))) (store (store |c_#memory_$Pointer$.offset| .cse11 .cse19) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_33| (store (store (select (store .cse20 .cse11 .cse19) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_33|) 4 .cse17) 0 .cse21))))) (store .cse18 .cse4 (store (select .cse18 .cse4) .cse5 0)))) (.cse6 (let ((.cse13 (let ((.cse14 (store .cse16 .cse17 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_33|))) (store (store |c_#memory_$Pointer$.base| .cse11 .cse14) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_33| (store (store (select (store .cse15 .cse11 .cse14) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_33|) 4 .cse11) 0 .cse4))))) (store .cse13 .cse4 (store (select .cse13 .cse4) .cse5 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_33|))))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (store (store |c_#memory_int| .cse11 .cse12) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_33| v_ArrVal_2382))) (let ((.cse0 (store .cse3 .cse4 v_ArrVal_2387)) (.cse7 (select (select .cse6 .cse1) .cse2)) (.cse8 (select (select .cse9 .cse1) .cse2))) (or (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse1) (+ 8 .cse2)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_33| 1)) (not (= v_ArrVal_2387 (store (select .cse3 .cse4) .cse5 (select v_ArrVal_2387 .cse5)))) (not (= (select v_arrayElimArr_10 8) |c_ULTIMATE.start_dll_circular_insert_~data#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 (select (select .cse6 .cse7) .cse8)) (+ (select (select .cse9 .cse7) .cse8) 8))) (not (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse0 .cse7) (+ 8 .cse8)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_33|) 0)) (not (= v_ArrVal_2382 (store (store (select (store .cse10 .cse11 .cse12) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_33|) 4 (select v_ArrVal_2382 4)) 0 (select v_ArrVal_2382 0)))))))))))))) is different from false [2023-11-22 23:39:49,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167850917] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:39:49,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:39:49,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 49 [2023-11-22 23:39:49,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840744248] [2023-11-22 23:39:49,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:39:49,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-22 23:39:49,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:39:49,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-22 23:39:49,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3116, Unknown=5, NotChecked=112, Total=3422 [2023-11-22 23:39:49,749 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 49 states, 40 states have (on average 1.3) internal successors, (52), 39 states have internal predecessors, (52), 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-11-22 23:39:52,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:39:52,792 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2023-11-22 23:39:52,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-22 23:39:52,792 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 40 states have (on average 1.3) internal successors, (52), 39 states have internal predecessors, (52), 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 33 [2023-11-22 23:39:52,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:39:52,794 INFO L225 Difference]: With dead ends: 68 [2023-11-22 23:39:52,794 INFO L226 Difference]: Without dead ends: 66 [2023-11-22 23:39:52,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=363, Invalid=5336, Unknown=5, NotChecked=148, Total=5852 [2023-11-22 23:39:52,796 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 82 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:39:52,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 238 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-22 23:39:52,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-22 23:39:52,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2023-11-22 23:39:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 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-11-22 23:39:52,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2023-11-22 23:39:52,809 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 33 [2023-11-22 23:39:52,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:39:52,809 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2023-11-22 23:39:52,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 40 states have (on average 1.3) internal successors, (52), 39 states have internal predecessors, (52), 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-11-22 23:39:52,809 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2023-11-22 23:39:52,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-22 23:39:52,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:39:52,810 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, 1, 1, 1, 1] [2023-11-22 23:39:52,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-22 23:39:53,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:39:53,012 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:39:53,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:39:53,013 INFO L85 PathProgramCache]: Analyzing trace with hash -493299628, now seen corresponding path program 1 times [2023-11-22 23:39:53,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:39:53,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253592771] [2023-11-22 23:39:53,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:53,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:39:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:53,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:39:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:53,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 23:39:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:53,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 23:39:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:53,129 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-22 23:39:53,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:39:53,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253592771] [2023-11-22 23:39:53,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253592771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:39:53,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:39:53,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-22 23:39:53,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736971616] [2023-11-22 23:39:53,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:39:53,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 23:39:53,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:39:53,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 23:39:53,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-22 23:39:53,131 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-22 23:39:53,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:39:53,210 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2023-11-22 23:39:53,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 23:39:53,211 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2023-11-22 23:39:53,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:39:53,211 INFO L225 Difference]: With dead ends: 69 [2023-11-22 23:39:53,211 INFO L226 Difference]: Without dead ends: 66 [2023-11-22 23:39:53,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-22 23:39:53,213 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 26 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:39:53,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 147 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:39:53,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-22 23:39:53,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2023-11-22 23:39:53,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 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-11-22 23:39:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2023-11-22 23:39:53,222 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 35 [2023-11-22 23:39:53,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:39:53,222 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2023-11-22 23:39:53,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-22 23:39:53,222 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2023-11-22 23:39:53,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-22 23:39:53,223 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:39:53,223 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:39:53,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-22 23:39:53,224 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:39:53,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:39:53,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1530373269, now seen corresponding path program 1 times [2023-11-22 23:39:53,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:39:53,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458966041] [2023-11-22 23:39:53,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:53,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:39:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:54,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:39:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:54,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 23:39:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:54,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 23:39:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 23:39:55,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:39:55,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458966041] [2023-11-22 23:39:55,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458966041] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:39:55,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782161642] [2023-11-22 23:39:55,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:55,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:39:55,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:39:55,169 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:39:55,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-22 23:39:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:55,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 158 conjunts are in the unsatisfiable core [2023-11-22 23:39:55,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:39:55,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-22 23:39:55,665 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-11-22 23:39:55,781 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-22 23:39:55,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-22 23:39:55,860 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-11-22 23:39:55,871 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-11-22 23:39:55,952 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 23:39:55,953 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 66 treesize of output 57 [2023-11-22 23:39:55,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-22 23:39:56,146 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-22 23:39:56,147 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 1 case distinctions, treesize of input 201 treesize of output 87 [2023-11-22 23:39:56,158 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 87 treesize of output 30 [2023-11-22 23:39:56,240 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-22 23:39:56,240 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 48 [2023-11-22 23:39:56,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:56,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:56,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-22 23:39:56,254 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 11 treesize of output 7 [2023-11-22 23:39:56,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:56,424 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-11-22 23:39:56,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 87 [2023-11-22 23:39:56,442 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-22 23:39:56,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-22 23:39:56,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:56,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:56,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:56,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2023-11-22 23:39:56,860 INFO L349 Elim1Store]: treesize reduction 151, result has 14.7 percent of original size [2023-11-22 23:39:56,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 602 treesize of output 205 [2023-11-22 23:39:56,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:56,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:56,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:56,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 69 [2023-11-22 23:39:57,579 INFO L349 Elim1Store]: treesize reduction 138, result has 9.8 percent of original size [2023-11-22 23:39:57,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 225 treesize of output 114 [2023-11-22 23:39:57,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:57,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:57,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:57,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2023-11-22 23:39:57,631 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:39:57,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:40:17,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782161642] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:40:17,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:40:17,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 47 [2023-11-22 23:40:17,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784041528] [2023-11-22 23:40:17,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:40:17,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-22 23:40:17,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:40:17,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-22 23:40:17,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2385, Unknown=8, NotChecked=0, Total=2550 [2023-11-22 23:40:17,630 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 47 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 37 states have internal predecessors, (58), 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-11-22 23:40:20,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:40:20,489 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2023-11-22 23:40:20,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-22 23:40:20,489 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 37 states have internal predecessors, (58), 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 38 [2023-11-22 23:40:20,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:40:20,490 INFO L225 Difference]: With dead ends: 66 [2023-11-22 23:40:20,490 INFO L226 Difference]: Without dead ends: 40 [2023-11-22 23:40:20,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=296, Invalid=4118, Unknown=8, NotChecked=0, Total=4422 [2023-11-22 23:40:20,491 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 95 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-22 23:40:20,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 311 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-22 23:40:20,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-22 23:40:20,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2023-11-22 23:40:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 23:40:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2023-11-22 23:40:20,496 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 38 [2023-11-22 23:40:20,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:40:20,496 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2023-11-22 23:40:20,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 37 states have internal predecessors, (58), 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-11-22 23:40:20,496 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2023-11-22 23:40:20,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-22 23:40:20,496 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:40:20,496 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:40:20,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-22 23:40:20,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-22 23:40:20,708 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:40:20,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:40:20,709 INFO L85 PathProgramCache]: Analyzing trace with hash 59477606, now seen corresponding path program 2 times [2023-11-22 23:40:20,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:40:20,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131837328] [2023-11-22 23:40:20,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:40:20,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:40:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:40:20,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:40:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:40:20,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 23:40:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:40:20,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-22 23:40:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:40:20,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 23:40:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:40:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-22 23:40:20,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:40:20,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131837328] [2023-11-22 23:40:20,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131837328] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:40:20,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:40:20,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 23:40:20,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169806779] [2023-11-22 23:40:20,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:40:20,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 23:40:20,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:40:20,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 23:40:20,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-22 23:40:20,812 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-22 23:40:20,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:40:20,836 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2023-11-22 23:40:20,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 23:40:20,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2023-11-22 23:40:20,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:40:20,836 INFO L225 Difference]: With dead ends: 41 [2023-11-22 23:40:20,836 INFO L226 Difference]: Without dead ends: 0 [2023-11-22 23:40:20,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-22 23:40:20,841 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:40:20,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:40:20,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-22 23:40:20,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-22 23:40:20,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 23:40:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-22 23:40:20,842 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2023-11-22 23:40:20,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:40:20,842 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-22 23:40:20,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-22 23:40:20,843 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-22 23:40:20,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-22 23:40:20,845 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 23:40:20,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-22 23:40:20,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-22 23:40:27,294 WARN L293 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 200 DAG size of output: 111 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-22 23:40:32,444 INFO L899 garLoopResultBuilder]: For program point L655(lines 655 657) no Hoare annotation was computed. [2023-11-22 23:40:32,444 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1)) [2023-11-22 23:40:32,444 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2023-11-22 23:40:32,444 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 639 674) no Hoare annotation was computed. [2023-11-22 23:40:32,444 INFO L899 garLoopResultBuilder]: For program point L648-2(lines 648 654) no Hoare annotation was computed. [2023-11-22 23:40:32,445 INFO L895 garLoopResultBuilder]: At program point L648-4(lines 648 654) the Hoare annotation is: (let ((.cse5 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |ULTIMATE.start_main_~mid_index~0#1| 1) (exists ((v_arrayElimIndex_31 Int)) (let ((.cse2 (select |#memory_$Pointer$.base| v_arrayElimIndex_31))) (let ((.cse0 (select .cse2 4))) (let ((.cse4 (select |#memory_$Pointer$.base| .cse0))) (let ((.cse1 (select .cse4 4))) (let ((.cse8 (select |#memory_$Pointer$.base| .cse1))) (let ((.cse7 (select |#memory_$Pointer$.offset| .cse1)) (.cse3 (select .cse8 4)) (.cse6 (select |#memory_$Pointer$.offset| .cse0))) (and (= (select (select |#memory_int| .cse0) 8) 1) (= .cse1 (select .cse2 0)) (<= (+ 2 .cse0) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse3) 0) 0) (<= (+ .cse1 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse4 0) .cse3) (= (select (select |#memory_int| .cse1) 8) 5) (= .cse5 .cse3) (= (select .cse6 4) 0) (= 0 (select .cse7 4)) (= .cse3 v_arrayElimIndex_31) (= (select .cse7 0) 0) (= (select .cse8 0) .cse0) (<= (+ 2 .cse3) |ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse6 0) 0))))))))) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_8 Int) (v_arrayElimIndex_11 Int) (v_arrayElimCell_44 Int)) (let ((.cse18 (select |#memory_$Pointer$.base| v_arrayElimIndex_11))) (let ((.cse12 (select .cse18 0))) (let ((.cse17 (select |#memory_$Pointer$.base| .cse12))) (let ((.cse13 (select .cse17 4))) (let ((.cse9 (+ v_arrayElimIndex_8 2)) (.cse11 (+ .cse13 2)) (.cse10 (+ .cse12 2)) (.cse14 (select .cse18 4))) (and (<= .cse9 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse9 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (<= .cse10 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (<= .cse11 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| v_arrayElimCell_44)) (= (select |v_old(#valid)_AFTER_CALL_12| .cse12) 0) (<= .cse11 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_11| .cse13) 0) (not (= .cse14 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_11| .cse14) 1) (= (select (select |#memory_int| .cse12) 8) 5) (= (select (select |#memory_$Pointer$.offset| .cse13) 0) 0) (= (select |v_#valid_BEFORE_CALL_11| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse13) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_8) 0) (= .cse13 v_arrayElimIndex_11) (<= .cse10 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_8) 1) (= 1 (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_44)) (= (let ((.cse15 (@diff |v_#valid_BEFORE_CALL_8| |v_#valid_BEFORE_CALL_9|))) (store |v_#valid_BEFORE_CALL_8| .cse15 (select |v_#valid_BEFORE_CALL_9| .cse15))) |v_#valid_BEFORE_CALL_9|) (= (let ((.cse16 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse16 (select |v_old(#valid)_AFTER_CALL_12| .cse16))) |v_old(#valid)_AFTER_CALL_12|) (= .cse14 (select .cse17 0)) (= .cse13 .cse5)))))))) (= |ULTIMATE.start_main_~len~0#1| 2) (= .cse5 |ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) 8) 1))) [2023-11-22 23:40:32,445 INFO L899 garLoopResultBuilder]: For program point L648-5(lines 648 654) no Hoare annotation was computed. [2023-11-22 23:40:32,445 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 593) no Hoare annotation was computed. [2023-11-22 23:40:32,445 INFO L899 garLoopResultBuilder]: For program point L591-2(lines 591 593) no Hoare annotation was computed. [2023-11-22 23:40:32,445 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-22 23:40:32,445 INFO L899 garLoopResultBuilder]: For program point L649(lines 649 651) no Hoare annotation was computed. [2023-11-22 23:40:32,445 INFO L895 garLoopResultBuilder]: At program point L616-2(lines 616 620) the Hoare annotation is: (let ((.cse12 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse32 (select |#memory_$Pointer$.base| .cse12))) (let ((.cse4 (select .cse32 0)) (.cse30 (select .cse32 4))) (let ((.cse0 (= 5 |ULTIMATE.start_dll_circular_insert_~data#1|)) (.cse1 (= |ULTIMATE.start_main_~mid_index~0#1| 1)) (.cse2 (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0)) (.cse3 (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)) (.cse5 (= (select |#valid| .cse12) 1)) (.cse6 (= |ULTIMATE.start_main_~uneq~0#1| 5)) (.cse7 (= .cse4 .cse30)) (.cse8 (= (select (select |#memory_int| .cse12) 8) 1)) (.cse9 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse10 (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0)) (.cse11 (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0)) (.cse13 (= (select (select |#memory_$Pointer$.offset| .cse12) 0) 0)) (.cse14 (= (select (select |#memory_int| .cse30) 8) 1)) (.cse15 (= 5 (select (select |#memory_int| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8))) (.cse16 (<= (+ .cse12 1) |#StackHeapBarrier|)) (.cse17 (<= (+ 2 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse19 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse18 (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 0)) (.cse20 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (.cse21 (= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0)) (.cse22 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse23 (= .cse12 (select (select |#memory_$Pointer$.base| .cse30) 0))) (.cse24 (= (select |#valid| .cse30) 1)) (.cse25 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse26 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse12) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse30) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse12) 0) (= (select |v_#valid_BEFORE_CALL_11| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse31 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse31 (select |v_old(#valid)_AFTER_CALL_12| .cse31))) |v_old(#valid)_AFTER_CALL_12|)))) (.cse27 (= (select (select |#memory_$Pointer$.offset| .cse30) 0) 0)) (.cse28 (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse29 (<= (+ .cse4 1) |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 (= .cse4 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= .cse12 |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) .cse13 .cse14 .cse15 .cse16 .cse17 (not .cse18) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (= |ULTIMATE.start_dll_circular_insert_~index#1| 0)) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_dll_circular_insert_~index#1| 1) .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 0) |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| 0)) .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29)))))) [2023-11-22 23:40:32,445 INFO L899 garLoopResultBuilder]: For program point L616-3(lines 612 638) no Hoare annotation was computed. [2023-11-22 23:40:32,445 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2023-11-22 23:40:32,445 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2023-11-22 23:40:32,445 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 672) no Hoare annotation was computed. [2023-11-22 23:40:32,445 INFO L899 garLoopResultBuilder]: For program point L627(lines 627 635) no Hoare annotation was computed. [2023-11-22 23:40:32,445 INFO L899 garLoopResultBuilder]: For program point L660-2(lines 660 666) no Hoare annotation was computed. [2023-11-22 23:40:32,445 INFO L899 garLoopResultBuilder]: For program point L627-2(lines 627 635) no Hoare annotation was computed. [2023-11-22 23:40:32,446 INFO L895 garLoopResultBuilder]: At program point L660-4(lines 660 666) the Hoare annotation is: (let ((.cse5 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |ULTIMATE.start_main_~mid_index~0#1| 1) (exists ((v_arrayElimIndex_31 Int)) (let ((.cse2 (select |#memory_$Pointer$.base| v_arrayElimIndex_31))) (let ((.cse0 (select .cse2 4))) (let ((.cse4 (select |#memory_$Pointer$.base| .cse0))) (let ((.cse1 (select .cse4 4))) (let ((.cse8 (select |#memory_$Pointer$.base| .cse1))) (let ((.cse7 (select |#memory_$Pointer$.offset| .cse1)) (.cse3 (select .cse8 4)) (.cse6 (select |#memory_$Pointer$.offset| .cse0))) (and (= (select (select |#memory_int| .cse0) 8) 1) (= .cse1 (select .cse2 0)) (<= (+ 2 .cse0) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse3) 0) 0) (<= (+ .cse1 2) |ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse4 0) .cse3) (= (select (select |#memory_int| .cse1) 8) 5) (= .cse5 .cse3) (= (select .cse6 4) 0) (= 0 (select .cse7 4)) (= .cse3 v_arrayElimIndex_31) (= (select .cse7 0) 0) (= (select .cse8 0) .cse0) (<= (+ 2 .cse3) |ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse6 0) 0))))))))) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| .cse5) 0)) 0)) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) 0)) 8) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_main_~count~0#1|))) [2023-11-22 23:40:32,446 INFO L899 garLoopResultBuilder]: For program point L660-5(lines 639 674) no Hoare annotation was computed. [2023-11-22 23:40:32,446 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~data#1| 1)) [2023-11-22 23:40:32,446 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-11-22 23:40:32,446 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-22 23:40:32,446 INFO L899 garLoopResultBuilder]: For program point L661(lines 661 663) no Hoare annotation was computed. [2023-11-22 23:40:32,446 INFO L899 garLoopResultBuilder]: For program point L612(lines 612 638) no Hoare annotation was computed. [2023-11-22 23:40:32,446 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2023-11-22 23:40:32,446 INFO L899 garLoopResultBuilder]: For program point L604-3(lines 604 608) no Hoare annotation was computed. [2023-11-22 23:40:32,446 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 639 674) no Hoare annotation was computed. [2023-11-22 23:40:32,447 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse1 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (.cse2 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)) (.cse4 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse5 (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|)) (.cse6 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse8 (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse9 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))) (.cse10 (= |ULTIMATE.start_dll_circular_create_~data#1| 1))) (or (and .cse0 (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10) (let ((.cse11 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and .cse0 (<= (+ .cse11 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) (= (select (select |#memory_int| .cse11) 8) 1) .cse1 .cse2 .cse3 (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= 1 (select |v_#valid_BEFORE_CALL_8| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_8| |#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse12 (select |#valid| .cse12))) |#valid|) (= (select |v_#valid_BEFORE_CALL_8| |ULTIMATE.start_main_~#s~0#1.base|) 1))) .cse4 (= .cse11 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 .cse6 .cse7 .cse8 .cse9 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) .cse10)))) [2023-11-22 23:40:32,447 INFO L899 garLoopResultBuilder]: For program point L588-3(lines 588 596) no Hoare annotation was computed. [2023-11-22 23:40:32,447 INFO L895 garLoopResultBuilder]: At program point L613(line 613) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select |#memory_$Pointer$.base| .cse0))) (let ((.cse1 (select .cse4 0)) (.cse2 (select .cse4 4))) (and (= 5 |ULTIMATE.start_dll_circular_insert_~data#1|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (= |ULTIMATE.start_dll_circular_insert_~index#1| 1) (= (select |#valid| .cse0) 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= .cse1 .cse2) (= (select (select |#memory_int| .cse0) 8) 1) (not (= .cse0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |#memory_int| .cse2) 8) 1) (<= (+ .cse0 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 (select (select |#memory_$Pointer$.base| .cse2) 0)) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.offset| .cse2) 0) 0) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse1 1) |#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_8| |#valid|))) (store |v_#valid_BEFORE_CALL_8| .cse3 (select |#valid| .cse3))) |#valid|) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_8| |ULTIMATE.start_main_~#s~0#1.base|) 1))))))) [2023-11-22 23:40:32,447 INFO L899 garLoopResultBuilder]: For program point L613-1(line 613) no Hoare annotation was computed. [2023-11-22 23:40:32,447 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2023-11-22 23:40:32,447 INFO L899 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2023-11-22 23:40:32,447 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 575 584) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2023-11-22 23:40:32,447 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2023-11-22 23:40:32,450 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:40:32,451 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 23:40:32,456 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:587) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:347) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:480) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:165) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:101) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContextToString(ModelTranslationContainer.java:91) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContextToString(BacktranslationService.java:98) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.(InvariantResult.java:47) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-11-22 23:40:32,470 INFO L158 Benchmark]: Toolchain (without parser) took 75536.06ms. Allocated memory was 134.2MB in the beginning and 612.4MB in the end (delta: 478.2MB). Free memory was 61.9MB in the beginning and 266.8MB in the end (delta: -204.8MB). Peak memory consumption was 277.5MB. Max. memory is 16.1GB. [2023-11-22 23:40:32,470 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 134.2MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 23:40:32,470 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.28ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 61.8MB in the beginning and 148.6MB in the end (delta: -86.8MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2023-11-22 23:40:32,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.96ms. Allocated memory is still 186.6MB. Free memory was 148.6MB in the beginning and 145.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-22 23:40:32,471 INFO L158 Benchmark]: Boogie Preprocessor took 39.07ms. Allocated memory is still 186.6MB. Free memory was 145.6MB in the beginning and 143.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 23:40:32,474 INFO L158 Benchmark]: RCFGBuilder took 476.86ms. Allocated memory is still 186.6MB. Free memory was 143.5MB in the beginning and 119.5MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-22 23:40:32,475 INFO L158 Benchmark]: TraceAbstraction took 74603.11ms. Allocated memory was 186.6MB in the beginning and 612.4MB in the end (delta: 425.7MB). Free memory was 119.5MB in the beginning and 266.8MB in the end (delta: -147.3MB). Peak memory consumption was 280.3MB. Max. memory is 16.1GB. [2023-11-22 23:40:32,478 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.15ms. Allocated memory is still 134.2MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.28ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 61.8MB in the beginning and 148.6MB in the end (delta: -86.8MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.96ms. Allocated memory is still 186.6MB. Free memory was 148.6MB in the beginning and 145.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.07ms. Allocated memory is still 186.6MB. Free memory was 145.6MB in the beginning and 143.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 476.86ms. Allocated memory is still 186.6MB. Free memory was 143.5MB in the beginning and 119.5MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 74603.11ms. Allocated memory was 186.6MB in the beginning and 612.4MB in the end (delta: 425.7MB). Free memory was 119.5MB in the beginning and 266.8MB in the end (delta: -147.3MB). Peak memory consumption was 280.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 672]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 74.5s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 519 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 517 mSDsluCounter, 2749 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1444 IncrementalHoareTripleChecker+Unchecked, 2364 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4206 IncrementalHoareTripleChecker+Invalid, 5776 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 385 mSDtfsCounter, 4206 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 707 GetRequests, 348 SyntacticMatches, 2 SemanticMatches, 357 ConstructedPredicates, 37 IntricatePredicates, 0 DeprecatedPredicates, 3323 ImplicationChecksByTransitivity, 38.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=13, InterpolantAutomatonStates: 173, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 79 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 19 PreInvPairs, 28 NumberOfFragments, 1828 HoareAnnotationTreeSize, 19 FomulaSimplifications, 1073 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1277 FormulaSimplificationTreeSizeReductionInter, 11.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 47.5s InterpolantComputationTime, 694 NumberOfCodeBlocks, 694 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 760 ConstructedInterpolants, 34 QuantifiedInterpolants, 16645 SizeOfPredicates, 141 NumberOfNonLiveVariables, 3343 ConjunctsInSsa, 737 ConjunctsInUnsatCore, 26 InterpolantComputations, 7 PerfectInterpolantSequences, 213/291 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:587) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-22 23:40:32,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 23:40:34,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 23:40:34,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-22 23:40:34,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 23:40:34,695 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 23:40:34,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 23:40:34,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 23:40:34,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 23:40:34,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 23:40:34,727 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 23:40:34,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 23:40:34,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 23:40:34,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 23:40:34,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 23:40:34,730 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 23:40:34,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 23:40:34,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 23:40:34,730 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 23:40:34,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 23:40:34,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 23:40:34,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 23:40:34,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 23:40:34,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 23:40:34,732 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 23:40:34,732 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-22 23:40:34,732 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-22 23:40:34,733 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 23:40:34,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 23:40:34,733 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 23:40:34,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 23:40:34,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 23:40:34,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 23:40:34,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 23:40:34,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:40:34,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 23:40:34,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 23:40:34,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 23:40:34,736 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-22 23:40:34,736 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-22 23:40:34,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 23:40:34,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 23:40:34,737 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 23:40:34,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 23:40:34,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 23:40:34,737 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-22 23:40:34,737 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 23:40:35,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 23:40:35,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 23:40:35,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 23:40:35,060 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 23:40:35,061 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 23:40:35,063 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-11-22 23:40:36,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 23:40:36,373 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 23:40:36,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i [2023-11-22 23:40:36,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f6f587ee/5a1e7d6fa83f421c8856d8f9b4d0e818/FLAG1e37231c8 [2023-11-22 23:40:36,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f6f587ee/5a1e7d6fa83f421c8856d8f9b4d0e818 [2023-11-22 23:40:36,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 23:40:36,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 23:40:36,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 23:40:36,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 23:40:36,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 23:40:36,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:40:36" (1/1) ... [2023-11-22 23:40:36,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c0c0362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:40:36, skipping insertion in model container [2023-11-22 23:40:36,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:40:36" (1/1) ... [2023-11-22 23:40:36,781 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 23:40:37,052 WARN L240 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-11-22 23:40:37,056 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:40:37,069 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 23:40:37,110 WARN L240 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-11-22 23:40:37,110 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:40:37,139 INFO L206 MainTranslator]: Completed translation [2023-11-22 23:40:37,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:40:37 WrapperNode [2023-11-22 23:40:37,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 23:40:37,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 23:40:37,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 23:40:37,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 23:40:37,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:40:37" (1/1) ... [2023-11-22 23:40:37,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:40:37" (1/1) ... [2023-11-22 23:40:37,210 INFO L138 Inliner]: procedures = 130, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 188 [2023-11-22 23:40:37,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 23:40:37,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 23:40:37,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 23:40:37,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 23:40:37,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:40:37" (1/1) ... [2023-11-22 23:40:37,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:40:37" (1/1) ... [2023-11-22 23:40:37,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:40:37" (1/1) ... [2023-11-22 23:40:37,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:40:37" (1/1) ... [2023-11-22 23:40:37,249 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:40:37" (1/1) ... [2023-11-22 23:40:37,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:40:37" (1/1) ... [2023-11-22 23:40:37,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:40:37" (1/1) ... [2023-11-22 23:40:37,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:40:37" (1/1) ... [2023-11-22 23:40:37,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 23:40:37,279 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 23:40:37,279 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 23:40:37,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 23:40:37,280 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:40:37" (1/1) ... [2023-11-22 23:40:37,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:40:37,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:40:37,309 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 23:40:37,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 23:40:37,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-22 23:40:37,356 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-22 23:40:37,357 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-22 23:40:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 23:40:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 23:40:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 23:40:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-22 23:40:37,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-22 23:40:37,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 23:40:37,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-22 23:40:37,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-22 23:40:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-22 23:40:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 23:40:37,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 23:40:37,496 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 23:40:37,498 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 23:40:38,052 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 23:40:38,077 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 23:40:38,077 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-22 23:40:38,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:40:38 BoogieIcfgContainer [2023-11-22 23:40:38,078 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 23:40:38,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 23:40:38,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 23:40:38,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 23:40:38,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:40:36" (1/3) ... [2023-11-22 23:40:38,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719f7464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:40:38, skipping insertion in model container [2023-11-22 23:40:38,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:40:37" (2/3) ... [2023-11-22 23:40:38,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719f7464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:40:38, skipping insertion in model container [2023-11-22 23:40:38,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:40:38" (3/3) ... [2023-11-22 23:40:38,084 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2023-11-22 23:40:38,097 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 23:40:38,098 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 23:40:38,130 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 23:40:38,135 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;@58c48947, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 23:40:38,135 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 23:40:38,140 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-11-22 23:40:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 23:40:38,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:40:38,148 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:40:38,149 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:40:38,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:40:38,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1280970562, now seen corresponding path program 1 times [2023-11-22 23:40:38,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 23:40:38,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132527848] [2023-11-22 23:40:38,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:40:38,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 23:40:38,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 23:40:38,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 23:40:38,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-22 23:40:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:40:38,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-22 23:40:38,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:40:38,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:40:38,380 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:40:38,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 23:40:38,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132527848] [2023-11-22 23:40:38,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132527848] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:40:38,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:40:38,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 23:40:38,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084532450] [2023-11-22 23:40:38,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:40:38,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 23:40:38,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 23:40:38,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 23:40:38,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 23:40:38,418 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 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 23:40:38,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:40:38,512 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2023-11-22 23:40:38,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 23:40:38,515 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-11-22 23:40:38,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:40:38,520 INFO L225 Difference]: With dead ends: 66 [2023-11-22 23:40:38,521 INFO L226 Difference]: Without dead ends: 30 [2023-11-22 23:40:38,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 23:40:38,526 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:40:38,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:40:38,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-22 23:40:38,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-22 23:40:38,556 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-11-22 23:40:38,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2023-11-22 23:40:38,559 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 19 [2023-11-22 23:40:38,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:40:38,560 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2023-11-22 23:40:38,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 23:40:38,560 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2023-11-22 23:40:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 23:40:38,562 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:40:38,563 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:40:38,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-22 23:40:38,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 23:40:38,768 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:40:38,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:40:38,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1761698767, now seen corresponding path program 1 times [2023-11-22 23:40:38,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 23:40:38,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792769085] [2023-11-22 23:40:38,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:40:38,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 23:40:38,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 23:40:38,770 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 23:40:38,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-22 23:40:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:40:38,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 23:40:38,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:40:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:40:38,980 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:40:38,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 23:40:38,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792769085] [2023-11-22 23:40:38,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792769085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:40:38,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:40:38,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 23:40:38,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570412971] [2023-11-22 23:40:38,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:40:38,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 23:40:38,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 23:40:38,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 23:40:38,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 23:40:38,983 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 23:40:39,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:40:39,103 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2023-11-22 23:40:39,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 23:40:39,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-11-22 23:40:39,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:40:39,105 INFO L225 Difference]: With dead ends: 57 [2023-11-22 23:40:39,105 INFO L226 Difference]: Without dead ends: 35 [2023-11-22 23:40:39,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 23:40:39,106 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:40:39,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 65 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:40:39,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-22 23:40:39,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2023-11-22 23:40:39,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 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-11-22 23:40:39,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2023-11-22 23:40:39,112 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 19 [2023-11-22 23:40:39,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:40:39,113 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2023-11-22 23:40:39,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 23:40:39,114 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2023-11-22 23:40:39,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-22 23:40:39,116 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:40:39,116 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] [2023-11-22 23:40:39,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-22 23:40:39,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 23:40:39,328 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:40:39,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:40:39,328 INFO L85 PathProgramCache]: Analyzing trace with hash -174060619, now seen corresponding path program 1 times [2023-11-22 23:40:39,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 23:40:39,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564501273] [2023-11-22 23:40:39,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:40:39,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 23:40:39,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 23:40:39,330 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 23:40:39,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-22 23:40:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:40:39,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 23:40:39,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:40:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-22 23:40:39,585 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:40:39,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 23:40:39,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564501273] [2023-11-22 23:40:39,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564501273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:40:39,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:40:39,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 23:40:39,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741684014] [2023-11-22 23:40:39,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:40:39,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 23:40:39,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 23:40:39,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 23:40:39,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 23:40:39,596 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-11-22 23:40:39,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:40:39,732 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2023-11-22 23:40:39,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 23:40:39,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 27 [2023-11-22 23:40:39,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:40:39,733 INFO L225 Difference]: With dead ends: 47 [2023-11-22 23:40:39,733 INFO L226 Difference]: Without dead ends: 32 [2023-11-22 23:40:39,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 23:40:39,734 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:40:39,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 68 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:40:39,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-22 23:40:39,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-22 23:40:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 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-11-22 23:40:39,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2023-11-22 23:40:39,746 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 27 [2023-11-22 23:40:39,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:40:39,747 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2023-11-22 23:40:39,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-11-22 23:40:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2023-11-22 23:40:39,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-22 23:40:39,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:40:39,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] [2023-11-22 23:40:39,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-22 23:40:39,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 23:40:39,953 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:40:39,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:40:39,953 INFO L85 PathProgramCache]: Analyzing trace with hash 434779626, now seen corresponding path program 1 times [2023-11-22 23:40:39,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 23:40:39,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666370112] [2023-11-22 23:40:39,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:40:39,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 23:40:39,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 23:40:39,955 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 23:40:39,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-22 23:40:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:40:40,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 88 conjunts are in the unsatisfiable core [2023-11-22 23:40:40,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:40:40,382 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 7 [2023-11-22 23:40:40,423 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 7 treesize of output 5 [2023-11-22 23:40:40,594 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-22 23:40:40,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-22 23:40:40,786 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 11 [2023-11-22 23:40:40,854 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-11-22 23:40:40,958 INFO L349 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-11-22 23:40:40,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-11-22 23:40:41,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 23:40:41,117 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 23 treesize of output 11 [2023-11-22 23:40:41,248 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 16 treesize of output 11 [2023-11-22 23:40:41,300 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 16 treesize of output 11 [2023-11-22 23:40:41,698 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-11-22 23:40:41,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 197 treesize of output 159 [2023-11-22 23:40:41,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:40:41,714 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 44 treesize of output 33 [2023-11-22 23:40:41,720 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-11-22 23:40:41,752 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 100 treesize of output 84 [2023-11-22 23:40:41,975 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-11-22 23:40:41,976 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 91 [2023-11-22 23:40:41,991 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 33 treesize of output 25 [2023-11-22 23:40:42,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-22 23:40:42,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2023-11-22 23:40:42,021 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 14 treesize of output 8 [2023-11-22 23:40:42,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-22 23:40:42,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:40:42,310 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-11-22 23:40:42,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 163 treesize of output 102 [2023-11-22 23:40:42,356 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-22 23:40:42,357 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-11-22 23:40:42,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:40:42,417 INFO L349 Elim1Store]: treesize reduction 18, result has 58.1 percent of original size [2023-11-22 23:40:42,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 43 [2023-11-22 23:40:42,468 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 16 treesize of output 11 [2023-11-22 23:40:43,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:40:43,307 INFO L349 Elim1Store]: treesize reduction 101, result has 9.0 percent of original size [2023-11-22 23:40:43,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 208 treesize of output 126 [2023-11-22 23:40:43,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2023-11-22 23:40:43,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:40:43,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 11 [2023-11-22 23:40:43,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2023-11-22 23:40:43,369 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 30 treesize of output 20 [2023-11-22 23:40:43,541 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 35 treesize of output 19 [2023-11-22 23:40:43,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-22 23:40:43,742 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 23:40:43,743 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:40:51,819 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_356 (_ BitVec 32)) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) (select (select (store (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_356)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_348) .cse2 v_ArrVal_355) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_347) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_349) .cse2 v_ArrVal_351) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_354) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_353) .cse2 v_ArrVal_350) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv8 32))))))) is different from false [2023-11-22 23:40:52,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 23:40:52,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666370112] [2023-11-22 23:40:52,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666370112] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:40:52,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [936742507] [2023-11-22 23:40:52,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:40:52,631 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-22 23:40:52,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-11-22 23:40:52,633 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-22 23:40:52,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-11-22 23:40:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:40:53,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 99 conjunts are in the unsatisfiable core [2023-11-22 23:40:53,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:40:53,379 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 7 [2023-11-22 23:40:53,992 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-11-22 23:40:54,215 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-22 23:40:54,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-22 23:40:54,427 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-11-22 23:40:54,456 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-11-22 23:40:54,695 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 16 treesize of output 11 [2023-11-22 23:40:54,723 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 16 treesize of output 11 [2023-11-22 23:40:55,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:40:55,202 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 42 treesize of output 31 [2023-11-22 23:40:55,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:40:55,212 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 42 treesize of output 31 [2023-11-22 23:40:55,230 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-11-22 23:40:55,246 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-11-22 23:40:55,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 29 [2023-11-22 23:40:55,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:40:55,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-22 23:40:55,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-22 23:40:55,542 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 11 [2023-11-22 23:40:56,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:40:56,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 50 [2023-11-22 23:40:56,281 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2023-11-22 23:40:56,281 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 49 [2023-11-22 23:40:56,417 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-22 23:40:56,418 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-11-22 23:40:56,465 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-22 23:40:56,465 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 24 treesize of output 26 [2023-11-22 23:40:57,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:41:05,201 WARN L293 SmtUtils]: Spent 7.44s on a formula simplification. DAG size of input: 100 DAG size of output: 47 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-22 23:41:05,201 INFO L349 Elim1Store]: treesize reduction 301, result has 22.6 percent of original size [2023-11-22 23:41:05,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 722 treesize of output 477 [2023-11-22 23:41:05,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:41:05,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:41:05,492 INFO L224 Elim1Store]: Index analysis took 153 ms [2023-11-22 23:41:23,242 WARN L293 SmtUtils]: Spent 17.75s on a formula simplification. DAG size of input: 75 DAG size of output: 46 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-22 23:41:23,242 INFO L349 Elim1Store]: treesize reduction 169, result has 39.9 percent of original size [2023-11-22 23:41:23,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 143 treesize of output 288 [2023-11-22 23:41:23,368 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2023-11-22 23:41:23,722 INFO L224 Elim1Store]: Index analysis took 162 ms [2023-11-22 23:41:28,450 INFO L349 Elim1Store]: treesize reduction 107, result has 31.8 percent of original size [2023-11-22 23:41:28,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 124 [2023-11-22 23:41:29,535 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 16 treesize of output 15 [2023-11-22 23:41:31,747 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-22 23:41:33,238 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:41:33,239 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 16 treesize of output 1 [2023-11-22 23:41:34,245 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 10 treesize of output 9 [2023-11-22 23:41:36,602 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 10 treesize of output 9 [2023-11-22 23:41:37,634 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:41:37,635 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 22 treesize of output 13 [2023-11-22 23:41:38,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2023-11-22 23:41:38,143 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 11 treesize of output 9 [2023-11-22 23:41:39,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2023-11-22 23:41:40,773 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 25 treesize of output 31 [2023-11-22 23:41:41,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 22 [2023-11-22 23:41:44,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:41:44,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:41:44,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 136 [2023-11-22 23:41:44,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:41:44,466 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:41:44,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:41:44,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:41:44,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 104 [2023-11-22 23:41:44,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:41:44,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:41:44,873 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:41:44,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:41:44,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:41:44,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 142 [2023-11-22 23:41:44,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:41:44,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:41:44,983 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:41:44,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 113 [2023-11-22 23:41:45,077 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 17 treesize of output 13 [2023-11-22 23:41:45,106 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 701 treesize of output 611 [2023-11-22 23:41:47,006 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 287 treesize of output 230 [2023-11-22 23:41:47,977 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-22 23:41:47,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-22 23:41:48,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2023-11-22 23:41:48,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-11-22 23:41:48,385 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) 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$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.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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) 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:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-11-22 23:41:48,391 INFO L158 Benchmark]: Toolchain (without parser) took 71658.28ms. Allocated memory was 62.9MB in the beginning and 144.7MB in the end (delta: 81.8MB). Free memory was 37.5MB in the beginning and 60.9MB in the end (delta: -23.4MB). Peak memory consumption was 88.3MB. Max. memory is 16.1GB. [2023-11-22 23:41:48,391 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 62.9MB. Free memory was 43.5MB in the beginning and 43.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 23:41:48,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.12ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 37.3MB in the beginning and 53.7MB in the end (delta: -16.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-22 23:41:48,391 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.99ms. Allocated memory is still 81.8MB. Free memory was 53.7MB in the beginning and 51.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 23:41:48,391 INFO L158 Benchmark]: Boogie Preprocessor took 67.03ms. Allocated memory is still 81.8MB. Free memory was 51.1MB in the beginning and 48.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-22 23:41:48,392 INFO L158 Benchmark]: RCFGBuilder took 798.83ms. Allocated memory is still 81.8MB. Free memory was 48.6MB in the beginning and 44.0MB in the end (delta: 4.6MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2023-11-22 23:41:48,392 INFO L158 Benchmark]: TraceAbstraction took 70311.24ms. Allocated memory was 81.8MB in the beginning and 144.7MB in the end (delta: 62.9MB). Free memory was 43.5MB in the beginning and 60.9MB in the end (delta: -17.4MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. [2023-11-22 23:41:48,393 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.21ms. Allocated memory is still 62.9MB. Free memory was 43.5MB in the beginning and 43.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.12ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 37.3MB in the beginning and 53.7MB in the end (delta: -16.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.99ms. Allocated memory is still 81.8MB. Free memory was 53.7MB in the beginning and 51.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.03ms. Allocated memory is still 81.8MB. Free memory was 51.1MB in the beginning and 48.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 798.83ms. Allocated memory is still 81.8MB. Free memory was 48.6MB in the beginning and 44.0MB in the end (delta: 4.6MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * TraceAbstraction took 70311.24ms. Allocated memory was 81.8MB in the beginning and 144.7MB in the end (delta: 62.9MB). Free memory was 43.5MB in the beginning and 60.9MB in the end (delta: -17.4MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-22 23:41:48,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no need to replace index