/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/sll2n_prepend_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 03:49:22,158 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 03:49:22,228 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 03:49:22,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 03:49:22,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 03:49:22,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 03:49:22,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 03:49:22,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 03:49:22,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 03:49:22,250 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 03:49:22,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 03:49:22,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 03:49:22,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 03:49:22,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 03:49:22,252 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 03:49:22,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 03:49:22,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 03:49:22,252 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 03:49:22,252 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 03:49:22,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 03:49:22,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 03:49:22,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 03:49:22,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 03:49:22,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 03:49:22,259 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 03:49:22,259 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 03:49:22,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 03:49:22,259 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 03:49:22,260 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 03:49:22,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 03:49:22,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 03:49:22,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 03:49:22,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:49:22,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 03:49:22,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 03:49:22,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 03:49:22,261 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 03:49:22,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 03:49:22,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 03:49:22,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 03:49:22,262 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 03:49:22,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 03:49:22,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 03:49:22,262 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 03:49:22,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 03:49:22,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 03:49:22,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 03:49:22,506 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 03:49:22,509 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 03:49:22,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_prepend_equal.i [2023-12-21 03:49:23,596 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 03:49:23,778 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 03:49:23,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_prepend_equal.i [2023-12-21 03:49:23,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a0ccfbc9/b71805e59412480998f159e748ebbd46/FLAGcaee2c368 [2023-12-21 03:49:23,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a0ccfbc9/b71805e59412480998f159e748ebbd46 [2023-12-21 03:49:23,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 03:49:23,799 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 03:49:23,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 03:49:23,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 03:49:23,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 03:49:23,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:49:23" (1/1) ... [2023-12-21 03:49:23,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@475fbb01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:23, skipping insertion in model container [2023-12-21 03:49:23,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:49:23" (1/1) ... [2023-12-21 03:49:23,857 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 03:49:24,105 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_prepend_equal.i[24076,24089] [2023-12-21 03:49:24,108 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:49:24,115 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 03:49:24,145 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_prepend_equal.i[24076,24089] [2023-12-21 03:49:24,146 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:49:24,165 INFO L206 MainTranslator]: Completed translation [2023-12-21 03:49:24,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:24 WrapperNode [2023-12-21 03:49:24,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 03:49:24,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 03:49:24,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 03:49:24,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 03:49:24,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:24" (1/1) ... [2023-12-21 03:49:24,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:24" (1/1) ... [2023-12-21 03:49:24,211 INFO L138 Inliner]: procedures = 127, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 105 [2023-12-21 03:49:24,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 03:49:24,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 03:49:24,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 03:49:24,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 03:49:24,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:24" (1/1) ... [2023-12-21 03:49:24,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:24" (1/1) ... [2023-12-21 03:49:24,223 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:24" (1/1) ... [2023-12-21 03:49:24,235 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2023-12-21 03:49:24,235 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:24" (1/1) ... [2023-12-21 03:49:24,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:24" (1/1) ... [2023-12-21 03:49:24,240 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:24" (1/1) ... [2023-12-21 03:49:24,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:24" (1/1) ... [2023-12-21 03:49:24,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:24" (1/1) ... [2023-12-21 03:49:24,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:24" (1/1) ... [2023-12-21 03:49:24,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 03:49:24,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 03:49:24,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 03:49:24,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 03:49:24,252 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:24" (1/1) ... [2023-12-21 03:49:24,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:49:24,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:49:24,305 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 03:49:24,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 03:49:24,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 03:49:24,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 03:49:24,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 03:49:24,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 03:49:24,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 03:49:24,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 03:49:24,341 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-21 03:49:24,341 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-21 03:49:24,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 03:49:24,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 03:49:24,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 03:49:24,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-21 03:49:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-21 03:49:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-21 03:49:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-21 03:49:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-21 03:49:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-21 03:49:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 03:49:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-21 03:49:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-21 03:49:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-21 03:49:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 03:49:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 03:49:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 03:49:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 03:49:24,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 03:49:24,434 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 03:49:24,435 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 03:49:24,613 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 03:49:24,653 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 03:49:24,653 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 03:49:24,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:49:24 BoogieIcfgContainer [2023-12-21 03:49:24,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 03:49:24,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 03:49:24,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 03:49:24,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 03:49:24,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:49:23" (1/3) ... [2023-12-21 03:49:24,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bbab9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:49:24, skipping insertion in model container [2023-12-21 03:49:24,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:24" (2/3) ... [2023-12-21 03:49:24,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bbab9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:49:24, skipping insertion in model container [2023-12-21 03:49:24,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:49:24" (3/3) ... [2023-12-21 03:49:24,659 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2023-12-21 03:49:24,671 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 03:49:24,671 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 03:49:24,701 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 03:49:24,706 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;@30eecf0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 03:49:24,706 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 03:49:24,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:49:24,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-21 03:49:24,713 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:49:24,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:49:24,714 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:49:24,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:49:24,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2095146488, now seen corresponding path program 1 times [2023-12-21 03:49:24,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:49:24,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486595637] [2023-12-21 03:49:24,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:24,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:49:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:24,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 03:49:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:49:24,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:49:24,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486595637] [2023-12-21 03:49:24,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486595637] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:49:24,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:49:24,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 03:49:24,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676497212] [2023-12-21 03:49:24,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:49:24,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 03:49:24,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:49:25,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 03:49:25,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:49:25,028 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 03:49:25,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:49:25,066 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2023-12-21 03:49:25,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 03:49:25,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-12-21 03:49:25,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:49:25,072 INFO L225 Difference]: With dead ends: 36 [2023-12-21 03:49:25,072 INFO L226 Difference]: Without dead ends: 15 [2023-12-21 03:49:25,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:49:25,077 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:49:25,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:49:25,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-21 03:49:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-21 03:49:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:49:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-12-21 03:49:25,102 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 11 [2023-12-21 03:49:25,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:49:25,102 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-12-21 03:49:25,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 03:49:25,103 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-12-21 03:49:25,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-21 03:49:25,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:49:25,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:49:25,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 03:49:25,105 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:49:25,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:49:25,105 INFO L85 PathProgramCache]: Analyzing trace with hash -523038448, now seen corresponding path program 1 times [2023-12-21 03:49:25,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:49:25,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222315024] [2023-12-21 03:49:25,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:25,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:49:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:25,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 03:49:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:25,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:49:25,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:49:25,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222315024] [2023-12-21 03:49:25,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222315024] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:49:25,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:49:25,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 03:49:25,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293558066] [2023-12-21 03:49:25,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:49:25,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:49:25,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:49:25,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:49:25,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:49:25,235 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 03:49:25,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:49:25,287 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2023-12-21 03:49:25,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:49:25,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-12-21 03:49:25,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:49:25,289 INFO L225 Difference]: With dead ends: 29 [2023-12-21 03:49:25,289 INFO L226 Difference]: Without dead ends: 18 [2023-12-21 03:49:25,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:49:25,290 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:49:25,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:49:25,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-21 03:49:25,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2023-12-21 03:49:25,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:49:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-12-21 03:49:25,294 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2023-12-21 03:49:25,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:49:25,294 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-12-21 03:49:25,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 03:49:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2023-12-21 03:49:25,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 03:49:25,295 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:49:25,295 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:49:25,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 03:49:25,295 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:49:25,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:49:25,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1472129899, now seen corresponding path program 1 times [2023-12-21 03:49:25,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:49:25,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638766538] [2023-12-21 03:49:25,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:25,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:49:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:25,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:49:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:25,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 03:49:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:49:25,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:49:25,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638766538] [2023-12-21 03:49:25,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638766538] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:49:25,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385750127] [2023-12-21 03:49:25,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:25,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:25,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:49:25,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:49:25,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 03:49:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:25,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 03:49:25,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:49:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:49:25,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:49:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:49:25,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385750127] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:49:25,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:49:25,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-12-21 03:49:25,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743685946] [2023-12-21 03:49:25,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:49:25,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 03:49:25,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:49:25,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 03:49:25,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:49:25,704 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-21 03:49:25,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:49:25,738 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2023-12-21 03:49:25,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 03:49:25,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 17 [2023-12-21 03:49:25,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:49:25,739 INFO L225 Difference]: With dead ends: 30 [2023-12-21 03:49:25,739 INFO L226 Difference]: Without dead ends: 19 [2023-12-21 03:49:25,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:49:25,742 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:49:25,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 37 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:49:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-21 03:49:25,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-21 03:49:25,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:49:25,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-12-21 03:49:25,750 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 17 [2023-12-21 03:49:25,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:49:25,750 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-12-21 03:49:25,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-21 03:49:25,751 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-12-21 03:49:25,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-21 03:49:25,751 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:49:25,751 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:49:25,779 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-12-21 03:49:25,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:25,958 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:49:25,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:49:25,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1900653178, now seen corresponding path program 2 times [2023-12-21 03:49:25,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:49:25,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846636614] [2023-12-21 03:49:25,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:25,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:49:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:26,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:49:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:26,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:49:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:26,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:49:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:26,514 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 03:49:26,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:49:26,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846636614] [2023-12-21 03:49:26,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846636614] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:49:26,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:49:26,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 03:49:26,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622603911] [2023-12-21 03:49:26,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:49:26,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 03:49:26,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:49:26,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 03:49:26,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-21 03:49:26,520 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:49:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:49:26,604 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-12-21 03:49:26,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 03:49:26,604 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 1 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 23 [2023-12-21 03:49:26,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:49:26,605 INFO L225 Difference]: With dead ends: 26 [2023-12-21 03:49:26,605 INFO L226 Difference]: Without dead ends: 24 [2023-12-21 03:49:26,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-21 03:49:26,610 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:49:26,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 46 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:49:26,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-21 03:49:26,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2023-12-21 03:49:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:49:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-12-21 03:49:26,617 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 23 [2023-12-21 03:49:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:49:26,617 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-12-21 03:49:26,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:49:26,618 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-12-21 03:49:26,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-21 03:49:26,618 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:49:26,618 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:49:26,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 03:49:26,618 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:49:26,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:49:26,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1900654852, now seen corresponding path program 1 times [2023-12-21 03:49:26,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:49:26,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799420312] [2023-12-21 03:49:26,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:26,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:49:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:26,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:49:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:26,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:49:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:26,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:49:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 03:49:26,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:49:26,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799420312] [2023-12-21 03:49:26,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799420312] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:49:26,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:49:26,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 03:49:26,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807748197] [2023-12-21 03:49:26,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:49:26,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 03:49:26,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:49:26,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 03:49:26,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-21 03:49:26,849 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:49:26,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:49:26,884 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2023-12-21 03:49:26,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 03:49:26,884 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (2), 1 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 23 [2023-12-21 03:49:26,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:49:26,885 INFO L225 Difference]: With dead ends: 24 [2023-12-21 03:49:26,885 INFO L226 Difference]: Without dead ends: 21 [2023-12-21 03:49:26,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-21 03:49:26,885 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:49:26,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 71 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:49:26,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-21 03:49:26,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-21 03:49:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:49:26,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-12-21 03:49:26,889 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 23 [2023-12-21 03:49:26,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:49:26,889 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-12-21 03:49:26,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:49:26,889 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-12-21 03:49:26,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-21 03:49:26,889 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:49:26,889 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:49:26,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 03:49:26,890 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:49:26,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:49:26,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1166569407, now seen corresponding path program 1 times [2023-12-21 03:49:26,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:49:26,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304034832] [2023-12-21 03:49:26,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:26,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:49:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:27,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:49:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:27,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:49:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:27,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:49:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 03:49:27,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:49:27,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304034832] [2023-12-21 03:49:27,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304034832] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:49:27,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872272832] [2023-12-21 03:49:27,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:27,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:27,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:49:27,837 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:49:27,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 03:49:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:27,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 112 conjunts are in the unsatisfiable core [2023-12-21 03:49:27,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:49:28,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-21 03:49:28,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:49:28,120 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 23 treesize of output 11 [2023-12-21 03:49:28,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-21 03:49:28,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-21 03:49:28,320 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 18 treesize of output 7 [2023-12-21 03:49:28,325 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 18 treesize of output 7 [2023-12-21 03:49:28,395 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-21 03:49:28,396 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 15 treesize of output 15 [2023-12-21 03:49:28,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-21 03:49:28,505 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 23 treesize of output 15 [2023-12-21 03:49:28,509 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 31 treesize of output 19 [2023-12-21 03:49:28,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-21 03:49:28,519 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 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-21 03:49:28,558 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 27 treesize of output 15 [2023-12-21 03:49:28,562 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-12-21 03:49:28,648 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:49:28,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:49:28,925 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 746 treesize of output 686 [2023-12-21 03:49:28,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:49:28,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 970 treesize of output 920 [2023-12-21 03:49:38,662 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse190 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse191 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse190 |c_ULTIMATE.start_sll_prepend_~head#1.offset| 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (= (+ .cse191 4) 0)) (.cse21 (= .cse191 0)) (.cse5 (select .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse6 (select .cse190 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse85 (forall ((|v_node_create_~temp~0#1.base_17| Int) (v_ArrVal_562 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) .cse5) .cse6)) (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))) (.cse19 (= .cse6 0)) (.cse20 (not .cse21)) (.cse165 (forall ((|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse188 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse189 (select .cse188 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse188 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse189 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse189 v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= v_arrayElimCell_14 0)))))) (.cse8 (not .cse9))) (let ((.cse10 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse187 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse187 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse187 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse187 v_arrayElimCell_13) v_arrayElimCell_14))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))) (.cse18 (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse186 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse186 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse186 v_ArrVal_572) v_DerPreprocessor_2)) (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))))) (.cse13 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse184 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse185 (select .cse184 v_arrayElimCell_13))) (or (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse184 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse184 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse185 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse185 v_DerPreprocessor_2)))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))) (.cse53 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (forall ((v_arrayElimCell_13 Int)) (or (forall ((v_ArrVal_572 Int)) (or (forall ((v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse182 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse183 (select .cse182 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse182 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse182 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse183 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse183 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse183 v_DerPreprocessor_2)))))) (= v_ArrVal_572 0))) (= v_arrayElimCell_13 0)))))) (.cse76 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_arrayElimCell_13 Int)) (or (= v_arrayElimCell_13 0) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse180 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse181 (select .cse180 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse180 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse180 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse181 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse181 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse181 v_DerPreprocessor_2)))))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))) (.cse81 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_arrayElimCell_13 Int)) (or (forall ((v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) v_arrayElimCell_13) v_arrayElimCell_14))) (= v_arrayElimCell_13 0))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))) (.cse82 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_arrayElimCell_13 Int)) (or (= v_arrayElimCell_13 0) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse178 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse179 (select .cse178 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse178 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse179 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse179 v_DerPreprocessor_2)))))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))) (.cse83 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_arrayElimCell_13 Int)) (or (= v_arrayElimCell_13 0) (forall ((v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse177 (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse177 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse177 v_DerPreprocessor_2))))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))) (.cse79 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_arrayElimCell_13 Int)) (or (= v_arrayElimCell_13 0) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse175 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse176 (select .cse175 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse175 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse175 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse176 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse176 v_arrayElimCell_14)))))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))) (.cse60 (or (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) v_ArrVal_572) v_DerPreprocessor_2)) (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= v_ArrVal_572 0))) .cse8)) (.cse72 (or .cse9 (forall ((|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse174 (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) v_arrayElimCell_13))) (or (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse174 v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse174 v_DerPreprocessor_2))))))) (.cse73 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse173 (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) v_arrayElimCell_13))) (or (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse173 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse173 v_DerPreprocessor_2))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))) (.cse55 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (forall ((v_arrayElimCell_13 Int)) (or (= v_arrayElimCell_13 0) (forall ((v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse171 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse172 (select .cse171 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse171 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse172 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse172 v_arrayElimCell_14))))))))))) (.cse74 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_arrayElimCell_13 Int)) (or (= v_arrayElimCell_13 0) (forall ((v_ArrVal_572 Int)) (or (forall ((v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse169 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse170 (select .cse169 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse169 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse170 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse170 v_DerPreprocessor_2)))))) (= v_ArrVal_572 0))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))) (.cse75 (or .cse9 (forall ((|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (or (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) v_arrayElimCell_13) v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))))) (.cse71 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_arrayElimCell_13 Int)) (or (forall ((v_ArrVal_572 Int)) (or (forall ((v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse167 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse168 (select .cse167 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse167 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse167 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse168 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse168 v_arrayElimCell_14)))))) (= v_ArrVal_572 0))) (= v_arrayElimCell_13 0))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))) (.cse24 (or .cse165 .cse21)) (.cse25 (or .cse85 .cse19 .cse20)) (.cse27 (or .cse21 (forall ((|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse166 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse166 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse166 v_arrayElimCell_13) v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= v_arrayElimCell_14 0)))))) (.cse35 (or .cse165 .cse19)) (.cse39 (forall ((v_arrayElimCell_14 Int)) (or (forall ((|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse163 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse164 (select .cse163 v_arrayElimCell_13))) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse163 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse164 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse164 v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))))) (= v_arrayElimCell_14 0)))) (.cse61 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_ArrVal_572 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse162 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse162 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse162 v_ArrVal_572) v_DerPreprocessor_2))))) (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))) (.cse62 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse160 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse161 (select .cse160 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse160 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse160 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse161 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse161 v_arrayElimCell_14)))))) (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))) (.cse3 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_arrayElimCell_14 Int) (v_DerPreprocessor_2 Int)) (or (= v_DerPreprocessor_2 0) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse158 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse159 (select .cse158 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse158 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse158 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse159 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse159 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse159 v_DerPreprocessor_2)))))))) (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))) (.cse66 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (forall ((v_ArrVal_562 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) .cse5) .cse6)))))) (.cse68 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse156 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse157 (select .cse156 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse156 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse157 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse157 v_arrayElimCell_14)))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))) (.cse69 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse154 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse155 (select .cse154 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse154 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse154 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse155 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse155 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse155 v_DerPreprocessor_2))))))))) (.cse63 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_13 Int)) (or (forall ((v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse152 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse153 (select .cse152 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse152 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse152 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse153 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse153 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse153 v_DerPreprocessor_2)))))) (= v_ArrVal_572 0)))))) (.cse110 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_13 Int)) (or (= v_arrayElimCell_13 0) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse150 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse151 (select .cse150 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse150 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse151 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse151 v_DerPreprocessor_2)))))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))) (.cse111 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_13 Int)) (or (= v_arrayElimCell_13 0) (forall ((v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse149 (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse149 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse149 v_DerPreprocessor_2))))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))) (.cse127 (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse147 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse148 (select .cse147 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse147 .cse5) .cse6)) (= v_DerPreprocessor_2 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse147 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse148 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse148 v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse148 v_DerPreprocessor_2)) (= v_arrayElimCell_14 0))))))) (and (or (and (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (forall ((v_arrayElimCell_14 Int) (v_DerPreprocessor_2 Int)) (or (forall ((v_ArrVal_572 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse1 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse2 (select .cse1 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse1 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 v_DerPreprocessor_2)))))) (= v_DerPreprocessor_2 0))))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_ArrVal_572 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (or (= v_DerPreprocessor_2 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) v_ArrVal_572) v_DerPreprocessor_2)))) (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) .cse3 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse4 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse7 (select .cse4 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse4 .cse5) .cse6)) (= v_DerPreprocessor_2 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse4 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 v_DerPreprocessor_2))))))))) .cse8) (or .cse9 (and .cse10 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (forall ((v_arrayElimCell_13 Int)) (or (= v_arrayElimCell_13 0) (forall ((v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse12 (select .cse11 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse11 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 v_arrayElimCell_14)))))))))) .cse13 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_13 Int)) (or (= v_arrayElimCell_13 0) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse14 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse15 (select .cse14 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse14 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse14 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 v_arrayElimCell_14)))))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse16 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse17 (select .cse16 v_arrayElimCell_13))) (or (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 v_arrayElimCell_14)) (= v_ArrVal_572 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 v_DerPreprocessor_2)))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) (or .cse9 (let ((.cse26 (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse44 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse45 (select .cse44 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 v_DerPreprocessor_2)) (= v_arrayElimCell_14 0)))))) (.cse38 (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse42 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse43 (select .cse42 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse42 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse42 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse43 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse43 v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= v_arrayElimCell_14 0))))))) (and (or .cse18 .cse19 .cse20) (or .cse21 (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse22 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse23 (select .cse22 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse22 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse22 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 v_DerPreprocessor_2)) (= v_arrayElimCell_14 0)))))) .cse24 .cse25 (or .cse21 .cse26) .cse27 (or .cse21 (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse28 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse28 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse28 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse28 v_arrayElimCell_13) v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= v_arrayElimCell_14 0))))) (or .cse21 (and (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_arrayElimCell_14 Int)) (or (forall ((v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse29 (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 v_DerPreprocessor_2))))) (= v_arrayElimCell_14 0))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_arrayElimCell_14 Int)) (or (forall ((v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) v_arrayElimCell_13) v_arrayElimCell_14))) (= v_arrayElimCell_14 0))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_arrayElimCell_14 Int)) (or (forall ((v_ArrVal_572 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse30 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse31 (select .cse30 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse30 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 v_DerPreprocessor_2)))))) (= v_arrayElimCell_14 0))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse32 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse33 (select .cse32 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse32 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse32 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 v_DerPreprocessor_2)) (= v_arrayElimCell_14 0))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse34 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse34 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse34 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse34 v_arrayElimCell_13) v_arrayElimCell_14)) (= v_arrayElimCell_14 0)))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) .cse35 (forall ((v_arrayElimCell_14 Int)) (or (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse36 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse37 (select .cse36 v_arrayElimCell_13))) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse36 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse36 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse37 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse37 v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))))) (= v_arrayElimCell_14 0))) (or .cse19 .cse26) (or .cse21 .cse38) (or .cse19 .cse38) .cse39 (forall ((v_arrayElimCell_14 Int)) (or (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse40 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse41 (select .cse40 v_arrayElimCell_13))) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse40 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse40 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse41 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse41 v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse41 v_DerPreprocessor_2)))))) (= v_arrayElimCell_14 0)))))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_14 Int)) (or (forall ((v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) v_arrayElimCell_13) v_arrayElimCell_14))) (= v_arrayElimCell_14 0))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) (forall ((v_DerPreprocessor_2 Int)) (or (forall ((v_arrayElimCell_14 Int)) (or (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse46 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse47 (select .cse46 v_arrayElimCell_13))) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse46 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse46 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse47 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse47 v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse47 v_DerPreprocessor_2)))))) (= v_arrayElimCell_14 0))) (= v_DerPreprocessor_2 0))) (or .cse9 (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse48 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse49 (select .cse48 v_arrayElimCell_13))) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse48 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse48 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse49 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse49 v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= v_arrayElimCell_14 0)))))) (or .cse9 (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse50 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse51 (select .cse50 v_arrayElimCell_13))) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse50 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse50 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse51 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse51 v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= v_ArrVal_572 0)))))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_13 Int)) (or (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse52 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse52 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse52 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse52 v_arrayElimCell_13) v_arrayElimCell_14))))) (= v_arrayElimCell_13 0))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) (or (= .cse5 0) (let ((.cse54 (or .cse85 .cse20)) (.cse56 (or .cse21 (forall ((|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse84 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse84 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse84 v_arrayElimCell_13) v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))))))) (and .cse53 (or .cse9 (and .cse54 .cse55 .cse56)) (or .cse21 (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse57 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse58 (select .cse57 v_arrayElimCell_13))) (or (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse57 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse57 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= v_ArrVal_572 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 v_DerPreprocessor_2))))))) (or .cse20 (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse59 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse59 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse59 v_ArrVal_572) v_DerPreprocessor_2)) (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= v_ArrVal_572 0))))) .cse60 (or .cse20 (and .cse61 .cse62 .cse63 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_ArrVal_572 Int) (v_arrayElimCell_13 Int)) (or (forall ((v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse64 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse65 (select .cse64 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse64 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse64 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse65 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse65 v_arrayElimCell_14)))))) (= v_ArrVal_572 0))) (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) .cse66 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (forall ((v_ArrVal_572 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse67 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse67 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse67 v_ArrVal_572) v_DerPreprocessor_2)) (= v_ArrVal_572 0)))))) .cse68 .cse69)) (or .cse9 (and (or .cse21 (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse70 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse70 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse70 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse70 v_arrayElimCell_13) v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= v_ArrVal_572 0))))) .cse71)) (or .cse21 (and .cse72 .cse73 .cse74 .cse75)) (or .cse9 (and .cse54 .cse76 .cse10 (or .cse21 (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse77 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse78 (select .cse77 v_arrayElimCell_13))) (or (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse77 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse77 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse78 v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse78 v_DerPreprocessor_2))))))) (or .cse18 .cse20) .cse55 .cse56 .cse79 (or .cse21 (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse80 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse80 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse80 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse80 v_arrayElimCell_13) v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))))) .cse13 (or .cse21 (and .cse81 .cse82 .cse83))))))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_14 Int)) (or (forall ((v_ArrVal_572 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse86 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse86 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse86 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse86 v_arrayElimCell_13) v_arrayElimCell_14))))) (= v_arrayElimCell_14 0))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) (or .cse9 (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse87 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse88 (select .cse87 v_arrayElimCell_13))) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse87 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse87 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse88 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse88 v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_13 Int)) (or (forall ((v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse89 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse89 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse89 v_arrayElimCell_13) v_arrayElimCell_14))))) (= v_arrayElimCell_13 0))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse90 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse91 (select .cse90 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse90 .cse5) .cse6)) (= v_DerPreprocessor_2 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse90 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse91 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse91 v_DerPreprocessor_2)) (= v_arrayElimCell_14 0))))))) (or .cse21 (and (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_13 Int)) (or (= v_arrayElimCell_13 0) (forall ((v_ArrVal_572 Int)) (or (forall ((v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse92 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse93 (select .cse92 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse92 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse93 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse93 v_DerPreprocessor_2)))))) (= v_ArrVal_572 0))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) .cse73)) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse94 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse94 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse94 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse94 v_arrayElimCell_13) v_arrayElimCell_14)) (= v_ArrVal_572 0)))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (forall ((v_arrayElimCell_13 Int)) (or (forall ((v_ArrVal_572 Int)) (or (forall ((v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse95 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse96 (select .cse95 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse95 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse95 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse96 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse96 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse96 v_DerPreprocessor_2)))))) (= v_ArrVal_572 0))) (= v_arrayElimCell_13 0))))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_arrayElimCell_14 Int)) (or (forall ((v_ArrVal_572 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse97 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse98 (select .cse97 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse97 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse97 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse98 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse98 v_DerPreprocessor_2)))))) (= v_arrayElimCell_14 0))) (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) (or .cse19 .cse20 (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse99 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse99 .cse5) .cse6)) (= v_DerPreprocessor_2 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse99 v_ArrVal_572) v_DerPreprocessor_2)) (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))))) (or .cse21 (and (or .cse9 (forall ((|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse100 (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) v_arrayElimCell_13))) (or (= v_DerPreprocessor_2 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse100 v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse100 v_DerPreprocessor_2)) (= v_arrayElimCell_14 0))))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse101 (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) v_arrayElimCell_13))) (or (= v_DerPreprocessor_2 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse101 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse101 v_DerPreprocessor_2)) (= v_arrayElimCell_14 0)))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_arrayElimCell_14 Int)) (or (= v_arrayElimCell_14 0) (forall ((v_DerPreprocessor_2 Int)) (or (forall ((v_ArrVal_572 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse102 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse103 (select .cse102 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse102 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse103 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse103 v_DerPreprocessor_2)))))) (= v_DerPreprocessor_2 0))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) (or .cse9 (forall ((|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) v_arrayElimCell_13) v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= v_arrayElimCell_14 0)))))) (or .cse21 (let ((.cse106 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse113 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse113 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse113 v_arrayElimCell_13) v_arrayElimCell_14))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))))) (and (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse104 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse105 (select .cse104 v_arrayElimCell_13))) (or (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse104 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse104 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse105 v_arrayElimCell_14)) (= v_ArrVal_572 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse105 v_DerPreprocessor_2)))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) .cse53 (or (and .cse76 .cse106 .cse81 .cse55 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse107 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse107 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse107 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse107 v_arrayElimCell_13) v_arrayElimCell_14))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) .cse82 .cse83 .cse79 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse108 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse109 (select .cse108 v_arrayElimCell_13))) (or (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse108 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse108 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse109 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse109 v_DerPreprocessor_2)))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))) .cse9) .cse60 .cse72 .cse110 .cse73 .cse111 (or .cse9 (and .cse106 .cse55)) .cse74 .cse75 (or .cse9 (and .cse71 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse112 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse112 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse112 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse112 v_arrayElimCell_13) v_arrayElimCell_14)) (= v_ArrVal_572 0)))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))))))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse114 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse114 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse114 v_arrayElimCell_13) v_arrayElimCell_14)) (= v_arrayElimCell_14 0)))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) (or (let ((.cse115 (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse119 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse120 (select .cse119 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse119 .cse5) .cse6)) (= v_DerPreprocessor_2 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse119 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse120 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse120 v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= v_arrayElimCell_14 0))))))) (and (or .cse21 .cse115) (forall ((v_DerPreprocessor_2 Int)) (or (= v_DerPreprocessor_2 0) (forall ((v_arrayElimCell_14 Int)) (or (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse116 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse117 (select .cse116 v_arrayElimCell_13))) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse116 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse116 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse117 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse117 v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))))) (= v_arrayElimCell_14 0))))) (or .cse21 (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse118 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse118 .cse5) .cse6)) (= v_DerPreprocessor_2 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse118 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse118 v_arrayElimCell_13) v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= v_arrayElimCell_14 0))))) (or .cse19 .cse115))) .cse9) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_13 Int)) (or (forall ((v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) v_arrayElimCell_13) v_arrayElimCell_14))) (= v_arrayElimCell_13 0))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) (or .cse21 (and (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_14 Int)) (or (forall ((v_ArrVal_572 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse121 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse122 (select .cse121 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse121 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse122 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse122 v_DerPreprocessor_2)))))) (= v_arrayElimCell_14 0))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_14 Int)) (or (forall ((v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse123 (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse123 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse123 v_DerPreprocessor_2))))) (= v_arrayElimCell_14 0))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))))) (or (and .cse24 .cse25 .cse27 .cse35 .cse39) .cse9) (or .cse19 .cse20 (and .cse61 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_arrayElimCell_14 Int) (v_DerPreprocessor_2 Int)) (or (= v_DerPreprocessor_2 0) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse124 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse125 (select .cse124 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse124 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse124 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse125 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse125 v_arrayElimCell_14)))))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) .cse62 .cse3 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_ArrVal_572 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse126 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse126 .cse5) .cse6)) (= v_DerPreprocessor_2 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse126 v_ArrVal_572) v_DerPreprocessor_2))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) .cse66 .cse68 .cse69)) (or .cse21 .cse127) (or .cse21 (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse128 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse129 (select .cse128 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse128 .cse5) .cse6)) (= v_DerPreprocessor_2 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse128 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse129 v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse129 v_DerPreprocessor_2)) (= v_arrayElimCell_14 0)))))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse130 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse130 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse130 v_arrayElimCell_13) v_arrayElimCell_14))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse131 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse131 .cse5) .cse6)) (= v_DerPreprocessor_2 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse131 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse131 v_arrayElimCell_13) v_arrayElimCell_14)) (= v_arrayElimCell_14 0)))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_13 Int)) (or (= v_arrayElimCell_13 0) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse132 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse133 (select .cse132 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse132 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse132 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse133 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse133 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse133 v_DerPreprocessor_2)))))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) (or .cse9 (forall ((|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse134 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse135 (select .cse134 v_arrayElimCell_13))) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse134 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse135 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse135 v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (= v_arrayElimCell_14 0)))))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (or (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) v_arrayElimCell_13) v_arrayElimCell_14)))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) v_arrayElimCell_13) v_arrayElimCell_14)) (= v_arrayElimCell_14 0))))) (or (and (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_13 Int)) (or (forall ((v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse136 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse137 (select .cse136 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse136 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse137 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse137 v_DerPreprocessor_2)))))) (= v_ArrVal_572 0))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) .cse63 (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_ArrVal_572 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) v_ArrVal_572) v_DerPreprocessor_2)) (= v_ArrVal_572 0))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse138 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse139 (select .cse138 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse138 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse138 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse139 v_arrayElimCell_14)) (= v_ArrVal_572 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse139 v_DerPreprocessor_2)))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))) .cse8) (or .cse21 (and .cse110 .cse111)) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)) (forall ((v_arrayElimCell_14 Int)) (or (forall ((v_ArrVal_572 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse140 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse141 (select .cse140 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse140 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse140 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse141 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse141 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse141 v_DerPreprocessor_2)))))) (= v_arrayElimCell_14 0))))) (or (forall ((v_ArrVal_572 Int) (|v_node_create_~temp~0#1.base_17| Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (or (= v_DerPreprocessor_2 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562) v_ArrVal_572) v_DerPreprocessor_2)) (not (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) .cse8) (or .cse9 (forall ((|v_node_create_~temp~0#1.base_17| Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse142 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse143 (select .cse142 v_arrayElimCell_13))) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= v_arrayElimCell_13 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse142 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse143 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse143 v_arrayElimCell_14)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0))))))) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_14 Int)) (or (forall ((v_arrayElimCell_13 Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse144 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse144 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse144 v_arrayElimCell_13) v_arrayElimCell_14))))) (= v_arrayElimCell_14 0))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))) (or .cse127 .cse19) (forall ((|v_node_create_~temp~0#1.base_17| Int)) (or (= |v_node_create_~temp~0#1.base_17| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_17|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_13 Int)) (or (= v_arrayElimCell_13 0) (forall ((v_ArrVal_572 Int) (v_arrayElimCell_14 Int) (v_ArrVal_562 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse145 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_17| v_ArrVal_562))) (let ((.cse146 (select .cse145 v_arrayElimCell_13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse145 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse145 v_ArrVal_572) v_DerPreprocessor_2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse146 v_arrayElimCell_14)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse146 v_DerPreprocessor_2)))))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_17|) 0)))))))))) is different from true [2023-12-21 03:49:38,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872272832] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:49:38,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:49:38,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2023-12-21 03:49:38,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001263385] [2023-12-21 03:49:38,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:49:38,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-21 03:49:38,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:49:38,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-21 03:49:38,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=913, Unknown=1, NotChecked=60, Total=1056 [2023-12-21 03:49:38,696 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 03:49:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:49:39,232 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2023-12-21 03:49:39,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 03:49:39,232 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25 [2023-12-21 03:49:39,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:49:39,233 INFO L225 Difference]: With dead ends: 31 [2023-12-21 03:49:39,233 INFO L226 Difference]: Without dead ends: 29 [2023-12-21 03:49:39,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=135, Invalid=1508, Unknown=1, NotChecked=78, Total=1722 [2023-12-21 03:49:39,234 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 03:49:39,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 151 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 03:49:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-21 03:49:39,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2023-12-21 03:49:39,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:49:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-12-21 03:49:39,238 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 25 [2023-12-21 03:49:39,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:49:39,239 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-12-21 03:49:39,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 03:49:39,239 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-12-21 03:49:39,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-21 03:49:39,239 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:49:39,239 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:49:39,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 03:49:39,445 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,SelfDestructingSolverStorable5 [2023-12-21 03:49:39,446 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:49:39,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:49:39,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1166571081, now seen corresponding path program 1 times [2023-12-21 03:49:39,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:49:39,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529416999] [2023-12-21 03:49:39,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:39,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:49:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:39,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:49:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:39,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:49:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:39,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:49:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 03:49:39,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:49:39,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529416999] [2023-12-21 03:49:39,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529416999] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:49:39,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872298261] [2023-12-21 03:49:39,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:39,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:39,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:49:39,816 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:49:39,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 03:49:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:39,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-21 03:49:39,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:49:40,151 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 15 treesize of output 11 [2023-12-21 03:49:40,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:49:40,158 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 28 treesize of output 24 [2023-12-21 03:49:40,164 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-12-21 03:49:40,166 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:49:40,167 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:49:40,202 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 108 treesize of output 78 [2023-12-21 03:49:40,206 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 26 treesize of output 22 [2023-12-21 03:49:40,216 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 25 treesize of output 21 [2023-12-21 03:49:40,241 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-12-21 03:49:40,256 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:49:40,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872298261] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:49:40,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:49:40,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 10] total 23 [2023-12-21 03:49:40,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881120005] [2023-12-21 03:49:40,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:49:40,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-21 03:49:40,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:49:40,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-21 03:49:40,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2023-12-21 03:49:40,259 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 23 states, 19 states have (on average 1.631578947368421) internal successors, (31), 17 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-21 03:49:44,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:48,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:52,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:56,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:50:00,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:50:04,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:50:08,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:50:12,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:50:16,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:50:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:50:16,526 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2023-12-21 03:50:16,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 03:50:16,527 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.631578947368421) internal successors, (31), 17 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 25 [2023-12-21 03:50:16,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:50:16,527 INFO L225 Difference]: With dead ends: 29 [2023-12-21 03:50:16,527 INFO L226 Difference]: Without dead ends: 26 [2023-12-21 03:50:16,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2023-12-21 03:50:16,528 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:50:16,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 182 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 9 Unknown, 0 Unchecked, 36.1s Time] [2023-12-21 03:50:16,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-21 03:50:16,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-21 03:50:16,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:50:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-21 03:50:16,531 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 25 [2023-12-21 03:50:16,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:50:16,531 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-21 03:50:16,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.631578947368421) internal successors, (31), 17 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-21 03:50:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-21 03:50:16,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-21 03:50:16,532 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:50:16,532 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:50:16,540 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-12-21 03:50:16,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:50:16,738 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:50:16,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:50:16,738 INFO L85 PathProgramCache]: Analyzing trace with hash -86702020, now seen corresponding path program 2 times [2023-12-21 03:50:16,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:50:16,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377106443] [2023-12-21 03:50:16,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:50:16,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:50:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:17,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:50:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:17,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:50:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:17,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:50:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:18,184 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:50:18,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:50:18,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377106443] [2023-12-21 03:50:18,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377106443] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:50:18,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721397137] [2023-12-21 03:50:18,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 03:50:18,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:50:18,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:50:18,186 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-12-21 03:50:18,188 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-12-21 03:50:18,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 03:50:18,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:50:18,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 153 conjunts are in the unsatisfiable core [2023-12-21 03:50:18,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:50:18,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-21 03:50:18,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:50:18,438 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 23 treesize of output 11 [2023-12-21 03:50:18,596 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-21 03:50:18,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-21 03:50:18,609 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-12-21 03:50:18,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-21 03:50:18,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:50:18,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-21 03:50:18,820 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 45 treesize of output 21 [2023-12-21 03:50:18,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-21 03:50:18,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-21 03:50:18,830 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-12-21 03:50:19,015 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-21 03:50:19,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-12-21 03:50:19,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:50:19,028 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 53 treesize of output 36 [2023-12-21 03:50:19,042 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-12-21 03:50:19,043 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 24 treesize of output 31 [2023-12-21 03:50:19,062 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-21 03:50:19,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-21 03:50:19,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 42 [2023-12-21 03:50:19,162 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 74 treesize of output 46 [2023-12-21 03:50:19,165 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-12-21 03:50:19,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:50:19,175 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 23 treesize of output 22 [2023-12-21 03:50:19,390 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-21 03:50:19,390 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 66 treesize of output 33 [2023-12-21 03:50:19,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-21 03:50:19,502 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:50:19,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:50:19,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:50:19,918 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 202 treesize of output 192 [2023-12-21 03:50:19,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:50:19,924 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 181 treesize of output 171 [2023-12-21 03:50:20,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721397137] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:50:20,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:50:20,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2023-12-21 03:50:20,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417091139] [2023-12-21 03:50:20,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:50:20,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-21 03:50:20,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:50:20,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-21 03:50:20,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=2118, Unknown=14, NotChecked=0, Total=2256 [2023-12-21 03:50:20,067 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 41 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 03:50:21,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:50:21,183 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2023-12-21 03:50:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-21 03:50:21,183 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 31 states have internal predecessors, (40), 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 27 [2023-12-21 03:50:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:50:21,184 INFO L225 Difference]: With dead ends: 35 [2023-12-21 03:50:21,184 INFO L226 Difference]: Without dead ends: 33 [2023-12-21 03:50:21,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=239, Invalid=3529, Unknown=14, NotChecked=0, Total=3782 [2023-12-21 03:50:21,186 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 03:50:21,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 219 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 03:50:21,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-21 03:50:21,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2023-12-21 03:50:21,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:50:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-12-21 03:50:21,189 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 27 [2023-12-21 03:50:21,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:50:21,189 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-12-21 03:50:21,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 03:50:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-12-21 03:50:21,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-21 03:50:21,190 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:50:21,190 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:50:21,198 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-12-21 03:50:21,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:50:21,391 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:50:21,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:50:21,391 INFO L85 PathProgramCache]: Analyzing trace with hash -86703694, now seen corresponding path program 2 times [2023-12-21 03:50:21,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:50:21,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087501379] [2023-12-21 03:50:21,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:50:21,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:50:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:22,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:50:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:22,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:50:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:22,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:50:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:50:22,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:50:22,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087501379] [2023-12-21 03:50:22,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087501379] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:50:22,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073394414] [2023-12-21 03:50:22,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 03:50:22,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:50:22,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:50:22,282 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-12-21 03:50:22,325 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-12-21 03:50:22,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 03:50:22,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:50:22,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 99 conjunts are in the unsatisfiable core [2023-12-21 03:50:22,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:50:22,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-21 03:50:22,573 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 15 treesize of output 1 [2023-12-21 03:50:22,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-21 03:50:22,660 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 12 treesize of output 4 [2023-12-21 03:50:22,790 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-21 03:50:22,790 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 21 treesize of output 24 [2023-12-21 03:50:22,802 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-21 03:50:22,802 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 15 treesize of output 15 [2023-12-21 03:50:22,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:50:22,888 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 28 treesize of output 27 [2023-12-21 03:50:22,891 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 32 treesize of output 20 [2023-12-21 03:50:22,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-21 03:50:23,056 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 03:50:23,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2023-12-21 03:50:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 03:50:23,059 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:50:23,160 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 236 treesize of output 206 [2023-12-21 03:50:23,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:50:23,367 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 176 treesize of output 159 [2023-12-21 03:50:23,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073394414] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:50:23,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:50:23,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 33 [2023-12-21 03:50:23,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32603258] [2023-12-21 03:50:23,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:50:23,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-21 03:50:23,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:50:23,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-21 03:50:23,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1302, Unknown=1, NotChecked=0, Total=1406 [2023-12-21 03:50:23,590 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 33 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 25 states have internal predecessors, (36), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 03:50:24,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:50:24,159 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2023-12-21 03:50:24,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 03:50:24,159 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 25 states have internal predecessors, (36), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 27 [2023-12-21 03:50:24,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:50:24,160 INFO L225 Difference]: With dead ends: 32 [2023-12-21 03:50:24,160 INFO L226 Difference]: Without dead ends: 29 [2023-12-21 03:50:24,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=189, Invalid=2260, Unknown=1, NotChecked=0, Total=2450 [2023-12-21 03:50:24,161 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 03:50:24,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 256 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 03:50:24,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-21 03:50:24,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-12-21 03:50:24,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:50:24,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-12-21 03:50:24,165 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 27 [2023-12-21 03:50:24,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:50:24,165 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-12-21 03:50:24,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 25 states have internal predecessors, (36), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 03:50:24,165 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-12-21 03:50:24,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-21 03:50:24,166 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:50:24,166 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:50:24,183 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-12-21 03:50:24,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:50:24,366 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:50:24,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:50:24,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1716228745, now seen corresponding path program 3 times [2023-12-21 03:50:24,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:50:24,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978035664] [2023-12-21 03:50:24,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:50:24,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:50:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:25,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:50:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:25,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:50:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:25,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:50:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:50:25,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:50:25,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978035664] [2023-12-21 03:50:25,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978035664] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:50:25,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519695364] [2023-12-21 03:50:25,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 03:50:25,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:50:25,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:50:25,793 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-12-21 03:50:25,794 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-12-21 03:50:26,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-21 03:50:26,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:50:26,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 153 conjunts are in the unsatisfiable core [2023-12-21 03:50:26,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:50:26,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-21 03:50:26,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:50:26,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:50:26,383 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_create_#t~ret5#1.base|))))) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret5#1.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2023-12-21 03:50:26,386 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_create_#t~ret5#1.base|))))) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret5#1.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from true [2023-12-21 03:50:26,426 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-12-21 03:50:26,426 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 27 treesize of output 23 [2023-12-21 03:50:26,455 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-12-21 03:50:26,456 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 23 treesize of output 22 [2023-12-21 03:50:26,508 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (or (exists ((|v_#memory_$Pointer$#2.base_86| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#2.base| (store |v_#memory_$Pointer$#2.base_86| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.base_86| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse0))) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |v_#memory_$Pointer$#2.base_86|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse1 (select |v_#memory_$Pointer$#2.base_86| .cse1)) |v_#memory_$Pointer$#2.base_86|) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse0) 4) 0)))))) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |c_#valid| .cse2)))))) (or (exists ((|v_#memory_$Pointer$#2.offset_81| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_81| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_81| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0))) (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_81|))) (and (= .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0) 4) 0) (= |v_#memory_$Pointer$#2.offset_81| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse3 (select |v_#memory_$Pointer$#2.offset_81| .cse3)))))))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2023-12-21 03:50:26,512 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (or (exists ((|v_#memory_$Pointer$#2.base_86| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#2.base| (store |v_#memory_$Pointer$#2.base_86| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.base_86| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse0))) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |v_#memory_$Pointer$#2.base_86|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse1 (select |v_#memory_$Pointer$#2.base_86| .cse1)) |v_#memory_$Pointer$#2.base_86|) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse0) 4) 0)))))) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |c_#valid| .cse2)))))) (or (exists ((|v_#memory_$Pointer$#2.offset_81| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_81| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_81| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0))) (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_81|))) (and (= .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0) 4) 0) (= |v_#memory_$Pointer$#2.offset_81| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse3 (select |v_#memory_$Pointer$#2.offset_81| .cse3)))))))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2023-12-21 03:50:26,547 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2023-12-21 03:50:26,549 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2023-12-21 03:50:26,581 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |c_#valid| .cse2)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= .cse0 .cse1))))) is different from false [2023-12-21 03:50:26,583 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |c_#valid| .cse2)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= .cse0 .cse1))))) is different from true [2023-12-21 03:50:26,601 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-21 03:50:26,601 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 60 treesize of output 27 [2023-12-21 03:50:26,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:50:26,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-12-21 03:50:26,621 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-21 03:50:26,623 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-21 03:50:26,645 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-21 03:50:26,647 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-21 03:50:26,671 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) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1))))) is different from false [2023-12-21 03:50:26,673 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) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1))))) is different from true [2023-12-21 03:50:26,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:50:26,712 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-21 03:50:26,712 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 68 treesize of output 51 [2023-12-21 03:50:26,756 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2023-12-21 03:50:26,756 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 35 treesize of output 73 [2023-12-21 03:50:26,802 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.offset| .cse0)) (.cse7 (select |c_#memory_$Pointer$#2.offset| .cse1))) (let ((.cse3 (= (select .cse7 4) 0)) (.cse5 (= (select .cse6 4) 0)) (.cse4 (= .cse1 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))) (or (and (= .cse0 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (or .cse3 .cse4)) (and .cse3 .cse5) (and .cse5 (or (= .cse6 .cse7) .cse4))))) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse8) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse9 (select |v_#valid_BEFORE_CALL_11| .cse9))))))) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= .cse1 .cse0))))) is different from false [2023-12-21 03:50:26,804 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.offset| .cse0)) (.cse7 (select |c_#memory_$Pointer$#2.offset| .cse1))) (let ((.cse3 (= (select .cse7 4) 0)) (.cse5 (= (select .cse6 4) 0)) (.cse4 (= .cse1 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))) (or (and (= .cse0 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (or .cse3 .cse4)) (and .cse3 .cse5) (and .cse5 (or (= .cse6 .cse7) .cse4))))) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse8) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse9 (select |v_#valid_BEFORE_CALL_11| .cse9))))))) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= .cse1 .cse0))))) is different from true [2023-12-21 03:50:26,878 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-12-21 03:50:26,878 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 2 case distinctions, treesize of input 237 treesize of output 169 [2023-12-21 03:50:26,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:50:26,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 330 treesize of output 230 [2023-12-21 03:50:26,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:50:26,913 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-12-21 03:50:26,913 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 166 treesize of output 104 [2023-12-21 03:50:26,964 INFO L349 Elim1Store]: treesize reduction 70, result has 50.4 percent of original size [2023-12-21 03:50:26,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 118 treesize of output 137 [2023-12-21 03:50:26,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-21 03:50:27,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-21 03:50:27,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-21 03:50:27,055 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 03:50:27,055 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 15 treesize of output 7 [2023-12-21 03:50:27,068 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|))) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= .cse0 .cse1)) (let ((.cse4 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) .cse3 .cse4) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) .cse3 .cse4) (and .cse3 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0))))))) is different from false [2023-12-21 03:50:27,070 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|))) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= .cse0 .cse1)) (let ((.cse4 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) .cse3 .cse4) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) .cse3 .cse4) (and .cse3 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0))))))) is different from true [2023-12-21 03:50:27,159 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= .cse1 |c_ULTIMATE.start_main_~temp~2#1.base|))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2023-12-21 03:50:27,161 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= .cse1 |c_ULTIMATE.start_main_~temp~2#1.base|))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2023-12-21 03:50:27,190 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)))))) is different from false [2023-12-21 03:50:27,192 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)))))) is different from true [2023-12-21 03:50:27,221 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2023-12-21 03:50:27,223 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2023-12-21 03:50:27,251 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)))))) is different from false [2023-12-21 03:50:27,253 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)))))) is different from true [2023-12-21 03:50:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2023-12-21 03:50:27,265 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:50:27,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:50:27,551 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 423 treesize of output 385 [2023-12-21 03:50:27,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:50:27,556 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 374 treesize of output 336 [2023-12-21 03:50:27,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519695364] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:50:27,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:50:27,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 40 [2023-12-21 03:50:27,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937475948] [2023-12-21 03:50:27,709 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:50:27,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-21 03:50:27,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:50:27,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-21 03:50:27,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1038, Unknown=26, NotChecked=988, Total=2162 [2023-12-21 03:50:27,710 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 40 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 30 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 03:50:27,880 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) (and .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret5#1.base|))))) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2))) (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret5#1.base|)))) .cse3) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) .cse3 (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse4 (select |c_#valid| .cse4)))))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2023-12-21 03:50:27,882 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) (and .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret5#1.base|))))) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2))) (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret5#1.base|)))) .cse3) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) .cse3 (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse4 (select |c_#valid| .cse4)))))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2023-12-21 03:50:27,887 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (.cse5 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse6 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) (and (or (exists ((|v_#memory_$Pointer$#2.base_86| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#2.base| (store |v_#memory_$Pointer$#2.base_86| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.base_86| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse0))) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |v_#memory_$Pointer$#2.base_86|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse1 (select |v_#memory_$Pointer$#2.base_86| .cse1)) |v_#memory_$Pointer$#2.base_86|) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse0) 4) 0)))))) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |c_#valid| .cse3)))))) (or (exists ((|v_#memory_$Pointer$#2.offset_81| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_81| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_81| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0))) (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_81|))) (and (= .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0) 4) 0) (= |v_#memory_$Pointer$#2.offset_81| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse4 (select |v_#memory_$Pointer$#2.offset_81| .cse4)))))))) (and .cse5 .cse6)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse2 .cse5 (= (select |c_#valid| .cse0) 1) .cse6 (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2023-12-21 03:50:27,890 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (.cse5 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse6 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) (and (or (exists ((|v_#memory_$Pointer$#2.base_86| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#2.base| (store |v_#memory_$Pointer$#2.base_86| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.base_86| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse0))) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |v_#memory_$Pointer$#2.base_86|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse1 (select |v_#memory_$Pointer$#2.base_86| .cse1)) |v_#memory_$Pointer$#2.base_86|) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse0) 4) 0)))))) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |c_#valid| .cse3)))))) (or (exists ((|v_#memory_$Pointer$#2.offset_81| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_81| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_81| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0))) (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_81|))) (and (= .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0) 4) 0) (= |v_#memory_$Pointer$#2.offset_81| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse4 (select |v_#memory_$Pointer$#2.offset_81| .cse4)))))))) (and .cse5 .cse6)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse2 .cse5 (= (select |c_#valid| .cse0) 1) .cse6 (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2023-12-21 03:50:27,893 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2023-12-21 03:50:27,895 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2023-12-21 03:50:27,898 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse4 (select |c_#valid| .cse4)))))) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse3) 1) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= .cse1 .cse2))))) is different from false [2023-12-21 03:50:27,900 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse4 (select |c_#valid| .cse4)))))) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse3) 1) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= .cse1 .cse2))))) is different from true [2023-12-21 03:50:27,906 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-21 03:50:27,908 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-21 03:50:27,911 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-21 03:50:27,912 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-21 03:50:27,920 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (= .cse0 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse1 |c_node_create_#res#1.base|)) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse2) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1)))) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|))) is different from false [2023-12-21 03:50:27,923 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (= .cse0 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse1 |c_node_create_#res#1.base|)) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse2) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1)))) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|))) is different from true [2023-12-21 03:50:27,934 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_old(#valid)_AFTER_CALL_17| .cse3))) |v_old(#valid)_AFTER_CALL_17|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.offset| .cse1)) (.cse8 (select |c_#memory_$Pointer$#2.offset| .cse2))) (let ((.cse4 (= (select .cse8 4) 0)) (.cse6 (= (select .cse7 4) 0)) (.cse5 (= .cse2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))) (or (and (= .cse1 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (or .cse4 .cse5)) (and .cse4 .cse6) (and .cse6 (or (= .cse7 .cse8) .cse5))))) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse9 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse10) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse11 (select |v_#valid_BEFORE_CALL_11| .cse11))))))) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (= .cse2 .cse1))))) is different from false [2023-12-21 03:50:27,937 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_old(#valid)_AFTER_CALL_17| .cse3))) |v_old(#valid)_AFTER_CALL_17|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.offset| .cse1)) (.cse8 (select |c_#memory_$Pointer$#2.offset| .cse2))) (let ((.cse4 (= (select .cse8 4) 0)) (.cse6 (= (select .cse7 4) 0)) (.cse5 (= .cse2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))) (or (and (= .cse1 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (or .cse4 .cse5)) (and .cse4 .cse6) (and .cse6 (or (= .cse7 .cse8) .cse5))))) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse9 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse10) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse11 (select |v_#valid_BEFORE_CALL_11| .cse11))))))) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (= .cse2 .cse1))))) is different from true [2023-12-21 03:50:27,940 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0)) (.cse4 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (.cse5 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0)) (.cse6 (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0))) (and .cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_old(#valid)_AFTER_CALL_17| .cse3))) |v_old(#valid)_AFTER_CALL_17|))) (or .cse0 (= .cse1 .cse2)) (or (and .cse4 .cse5 .cse6) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) .cse5 .cse6) (and .cse5 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1))) .cse4 .cse5 .cse6)))) is different from false [2023-12-21 03:50:27,942 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0)) (.cse4 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (.cse5 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0)) (.cse6 (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0))) (and .cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_old(#valid)_AFTER_CALL_17| .cse3))) |v_old(#valid)_AFTER_CALL_17|))) (or .cse0 (= .cse1 .cse2)) (or (and .cse4 .cse5 .cse6) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) .cse5 .cse6) (and .cse5 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1))) .cse4 .cse5 .cse6)))) is different from true [2023-12-21 03:50:27,945 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4))) (and (= 0 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.base| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_old(#valid)_AFTER_CALL_17| .cse3))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= .cse2 |c_ULTIMATE.start_main_~temp~2#1.base|))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from false [2023-12-21 03:50:27,946 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4))) (and (= 0 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.base| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_old(#valid)_AFTER_CALL_17| .cse3))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= .cse2 |c_ULTIMATE.start_main_~temp~2#1.base|))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from true [2023-12-21 03:50:27,949 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_old(#valid)_AFTER_CALL_17| .cse3))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) is different from false [2023-12-21 03:50:27,951 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_old(#valid)_AFTER_CALL_17| .cse3))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) is different from true [2023-12-21 03:50:27,955 WARN L854 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2023-12-21 03:50:27,957 WARN L876 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2023-12-21 03:50:27,960 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0)) is different from false [2023-12-21 03:50:27,961 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0)) is different from true [2023-12-21 03:50:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:50:28,057 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2023-12-21 03:50:28,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-21 03:50:28,057 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 30 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2023-12-21 03:50:28,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:50:28,058 INFO L225 Difference]: With dead ends: 51 [2023-12-21 03:50:28,058 INFO L226 Difference]: Without dead ends: 46 [2023-12-21 03:50:28,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 26 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=142, Invalid=1100, Unknown=52, NotChecked=2366, Total=3660 [2023-12-21 03:50:28,059 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 880 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 03:50:28,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 189 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 275 Invalid, 0 Unknown, 880 Unchecked, 0.2s Time] [2023-12-21 03:50:28,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-21 03:50:28,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2023-12-21 03:50:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 03:50:28,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2023-12-21 03:50:28,065 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 29 [2023-12-21 03:50:28,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:50:28,065 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2023-12-21 03:50:28,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 30 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 03:50:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2023-12-21 03:50:28,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-21 03:50:28,066 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:50:28,066 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:50:28,084 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-12-21 03:50:28,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:50:28,284 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:50:28,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:50:28,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1716230419, now seen corresponding path program 3 times [2023-12-21 03:50:28,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:50:28,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918780321] [2023-12-21 03:50:28,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:50:28,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:50:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:28,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:50:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:28,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:50:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:28,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:50:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:28,416 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:50:28,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:50:28,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918780321] [2023-12-21 03:50:28,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918780321] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:50:28,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599799985] [2023-12-21 03:50:28,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 03:50:28,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:50:28,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:50:28,417 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-12-21 03:50:28,457 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-12-21 03:50:28,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-21 03:50:28,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:50:28,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-21 03:50:28,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:50:28,786 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:50:28,786 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:50:28,842 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:50:28,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599799985] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:50:28,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:50:28,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2023-12-21 03:50:28,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530981177] [2023-12-21 03:50:28,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:50:28,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 03:50:28,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:50:28,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 03:50:28,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-21 03:50:28,844 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:50:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:50:28,959 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2023-12-21 03:50:28,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 03:50:28,959 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-12-21 03:50:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:50:28,960 INFO L225 Difference]: With dead ends: 51 [2023-12-21 03:50:28,960 INFO L226 Difference]: Without dead ends: 35 [2023-12-21 03:50:28,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-21 03:50:28,961 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:50:28,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 92 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:50:28,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-21 03:50:28,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2023-12-21 03:50:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 03:50:28,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-12-21 03:50:28,965 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 29 [2023-12-21 03:50:28,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:50:28,965 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-12-21 03:50:28,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:50:28,965 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-12-21 03:50:28,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-21 03:50:28,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:50:28,966 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:50:28,988 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-12-21 03:50:29,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:50:29,175 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:50:29,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:50:29,175 INFO L85 PathProgramCache]: Analyzing trace with hash 2125367058, now seen corresponding path program 4 times [2023-12-21 03:50:29,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:50:29,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160329218] [2023-12-21 03:50:29,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:50:29,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:50:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:29,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:50:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:29,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:50:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:29,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:50:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:29,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-21 03:50:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 03:50:29,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:50:29,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160329218] [2023-12-21 03:50:29,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160329218] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:50:29,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634239208] [2023-12-21 03:50:29,264 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 03:50:29,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:50:29,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:50:29,265 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-12-21 03:50:29,287 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-12-21 03:50:29,435 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 03:50:29,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:50:29,438 WARN L260 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 211 conjunts are in the unsatisfiable core [2023-12-21 03:50:29,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:50:29,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-21 03:50:29,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:50:29,491 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 23 treesize of output 11 [2023-12-21 03:50:29,571 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-21 03:50:29,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-21 03:50:29,581 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-12-21 03:50:29,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-21 03:50:29,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:50:29,620 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 15 treesize of output 1 [2023-12-21 03:50:29,726 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-12-21 03:50:29,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:50:29,782 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 41 treesize of output 32 [2023-12-21 03:50:29,815 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-12-21 03:50:29,816 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 41 [2023-12-21 03:50:29,827 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 24 treesize of output 19 [2023-12-21 03:50:29,833 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 16 treesize of output 11 [2023-12-21 03:50:29,884 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 23 treesize of output 22 [2023-12-21 03:50:29,891 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 76 treesize of output 40 [2023-12-21 03:50:29,895 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-12-21 03:50:30,043 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-21 03:50:30,044 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 117 treesize of output 56 [2023-12-21 03:50:30,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2023-12-21 03:50:30,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-12-21 03:50:30,056 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 20 treesize of output 10 [2023-12-21 03:50:30,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:50:30,225 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-21 03:50:30,225 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 125 treesize of output 78 [2023-12-21 03:50:30,247 INFO L349 Elim1Store]: treesize reduction 56, result has 47.7 percent of original size [2023-12-21 03:50:30,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 58 [2023-12-21 03:50:30,254 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-12-21 03:50:30,259 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-12-21 03:50:30,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:50:30,292 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2023-12-21 03:50:30,292 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 2 case distinctions, treesize of input 35 treesize of output 53 [2023-12-21 03:50:30,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:50:30,326 INFO L349 Elim1Store]: treesize reduction 12, result has 75.5 percent of original size [2023-12-21 03:50:30,326 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 45 treesize of output 49 [2023-12-21 03:50:30,422 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 149 treesize of output 101 [2023-12-21 03:50:30,434 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-12-21 03:50:30,434 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 130 treesize of output 64 [2023-12-21 03:50:30,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:50:30,441 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2023-12-21 03:50:30,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-12-21 03:50:30,908 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-21 03:50:30,908 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 140 treesize of output 66 [2023-12-21 03:50:30,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2023-12-21 03:50:31,084 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 33 treesize of output 13 [2023-12-21 03:50:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:50:31,115 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:50:31,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:50:31,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 518 treesize of output 472 [2023-12-21 03:50:31,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:50:31,614 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 462 treesize of output 416 [2023-12-21 03:50:31,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634239208] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:50:31,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:50:31,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 29] total 33 [2023-12-21 03:50:31,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805272695] [2023-12-21 03:50:31,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:50:31,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-21 03:50:31,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:50:31,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-21 03:50:31,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1619, Unknown=1, NotChecked=0, Total=1722 [2023-12-21 03:50:31,775 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 25 states have internal predecessors, (42), 7 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-21 03:50:32,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:50:32,167 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2023-12-21 03:50:32,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 03:50:32,167 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 1.5) internal successors, (42), 25 states have internal predecessors, (42), 7 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 35 [2023-12-21 03:50:32,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:50:32,167 INFO L225 Difference]: With dead ends: 35 [2023-12-21 03:50:32,167 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 03:50:32,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=130, Invalid=2031, Unknown=1, NotChecked=0, Total=2162 [2023-12-21 03:50:32,169 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 03:50:32,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 25 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 03:50:32,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 03:50:32,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 03:50:32,169 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-12-21 03:50:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 03:50:32,170 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2023-12-21 03:50:32,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:50:32,170 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 03:50:32,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 1.5) internal successors, (42), 25 states have internal predecessors, (42), 7 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-21 03:50:32,170 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 03:50:32,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 03:50:32,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 03:50:32,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-21 03:50:32,381 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,SelfDestructingSolverStorable11 [2023-12-21 03:50:32,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 03:50:33,155 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2023-12-21 03:50:33,155 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 604 626) no Hoare annotation was computed. [2023-12-21 03:50:33,155 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse12 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))) (let ((.cse0 (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse2 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse3 (not .cse12)) (.cse4 (= (select (select |#memory_int#2| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1)) (.cse5 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse11 (= .cse1 0)) (.cse6 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse7 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse9 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse10 (= |ULTIMATE.start_sll_create_~data#1| 1))) (or (and .cse0 (= (select (select |#memory_$Pointer$#2.base| .cse1) 4) 0) .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_sll_create_~len#1| 0) (= (select (select |#memory_int#2| .cse1) 0) 1) (= (select (select |#memory_$Pointer$#2.offset| .cse1) 4) 0) .cse6 .cse7 (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_10| |#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse8 (select |#valid| .cse8))) |#valid|) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| |ULTIMATE.start_sll_create_~head~0#1.base|) 0))) .cse9 .cse10 (not .cse11)) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse5 .cse12 .cse6 .cse7 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse11 (= |ULTIMATE.start_sll_create_~len#1| 1) .cse6 .cse7 .cse9 .cse10)))) [2023-12-21 03:50:33,155 INFO L899 garLoopResultBuilder]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2023-12-21 03:50:33,155 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2023-12-21 03:50:33,156 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (.cse0 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (= |ULTIMATE.start_sll_create_~data#1| 1))) (or (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not .cse1) .cse0 (= (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |ULTIMATE.start_sll_create_~len#1| 1) .cse2 .cse3 .cse4 .cse5 (= (select (select |#memory_int#2| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) |ULTIMATE.start_sll_create_~data#1|)))) [2023-12-21 03:50:33,156 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-12-21 03:50:33,156 INFO L895 garLoopResultBuilder]: At program point L611-2(lines 611 618) the Hoare annotation is: (let ((.cse18 (= |ULTIMATE.start_main_~ptr~0#1.base| 0))) (let ((.cse3 (not .cse18)) (.cse5 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (= (select (select |#memory_int#2| |ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) (.cse4 (= |ULTIMATE.start_main_~ptr~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (let ((.cse0 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |#memory_$Pointer$#2.base| .cse0) 4))) (and (= (select (select |#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|))) (= (select (select |#memory_int#2| .cse1) 0) 1) .cse3 .cse4 (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$#2.base| .cse1) 4) 0) .cse5 (not (= .cse0 0)) .cse6 .cse7 (= (select (select |#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |#memory_int#2| .cse0) 0) 1) .cse8 (not (= .cse1 0)) (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0)))) (and (= |ULTIMATE.start_main_~count~0#1| 1) .cse3 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse9 (select (select |#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4))) (let ((.cse10 (select (select |#memory_$Pointer$#2.base| .cse9) 4))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select (select |#memory_$Pointer$#2.offset| .cse9) 4) 0) (= (select (select |#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4) 0) (= (select (select |#memory_$Pointer$#2.offset| .cse10) 4) 0) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse9) (= (select |v_old(#valid)_AFTER_CALL_17| .cse9) 1) (= (select (select |#memory_$Pointer$#2.base| .cse10) 4) 0) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse11 (select |v_old(#valid)_AFTER_CALL_17| .cse11))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_10| .cse10) 1))))) .cse4 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_18| Int)) (let ((.cse13 (select (select |#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) 4))) (let ((.cse12 (select (select |#memory_$Pointer$#2.base| .cse13) 4))) (and (= (select (select |#memory_int#2| .cse12) 0) 1) (not (= .cse12 .cse13)) (= (select (select |#memory_$Pointer$#2.offset| .cse13) 4) 0) (= (select (select |#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) 4) 0) (not (= .cse12 |v_ULTIMATE.start_main_~ptr~0#1.base_18|)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse13))))) .cse5 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (let ((.cse14 (select (select |#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 4))) (and (not (= .cse14 |v_ULTIMATE.start_main_~ptr~0#1.base_22|)) (= .cse14 |ULTIMATE.start_main_~ptr~0#1.base|) (not (= (select (select |#memory_$Pointer$#2.base| .cse14) 4) 0))))) .cse6 .cse7 .cse8) (and .cse3 .cse4 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse15 (select (select |#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4))) (let ((.cse16 (select (select |#memory_$Pointer$#2.base| .cse15) 4))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse15) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select (select |#memory_$Pointer$#2.offset| .cse15) 4) 0) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse16) (= (select (select |#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4) 0) (= (select (select |#memory_$Pointer$#2.offset| .cse16) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse15) 1) (= (select (select |#memory_$Pointer$#2.base| .cse16) 4) 0) (= (let ((.cse17 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse17 (select |v_old(#valid)_AFTER_CALL_17| .cse17))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_10| .cse16) 1))))) .cse5 .cse6 .cse7 (= 2 |ULTIMATE.start_main_~count~0#1|) .cse8) (and (= |ULTIMATE.start_main_~count~0#1| 3) .cse4 .cse18 .cse6 .cse7)))) [2023-12-21 03:50:33,156 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 03:50:33,156 INFO L899 garLoopResultBuilder]: For program point L611-3(lines 604 626) no Hoare annotation was computed. [2023-12-21 03:50:33,156 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 03:50:33,156 INFO L895 garLoopResultBuilder]: At program point L600(line 600) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |#memory_$Pointer$#2.base| .cse1) 4))) (and (= |ULTIMATE.start_sll_prepend_~data#1| 1) (= |ULTIMATE.start_sll_prepend_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 0)) (= (select (select |#memory_int#2| .cse1) 0) 1) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_prepend_~head#1.base|) 0) 0) (= (select |#valid| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |#valid| .cse2))) |#valid|) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0))) (= (select (select |#memory_int#2| .cse0) 0) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |#memory_$Pointer$#2.base| (select (select |#memory_$Pointer$#2.base| (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_prepend_~head#1.base|) 0)) 4)) 4) 0) (= |ULTIMATE.start_sll_prepend_~head#1.offset| 0) (not (= .cse1 0))))) [2023-12-21 03:50:33,156 INFO L899 garLoopResultBuilder]: For program point L600-1(line 600) no Hoare annotation was computed. [2023-12-21 03:50:33,156 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 604 626) no Hoare annotation was computed. [2023-12-21 03:50:33,156 INFO L899 garLoopResultBuilder]: For program point L592(lines 592 598) no Hoare annotation was computed. [2023-12-21 03:50:33,156 INFO L899 garLoopResultBuilder]: For program point L613(lines 613 615) no Hoare annotation was computed. [2023-12-21 03:50:33,156 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-12-21 03:50:33,156 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-12-21 03:50:33,157 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |old(#valid)| |#valid|)) [2023-12-21 03:50:33,157 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-12-21 03:50:33,159 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1] [2023-12-21 03:50:33,160 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 03:50:33,166 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:455) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-21 03:50:33,168 INFO L158 Benchmark]: Toolchain (without parser) took 69368.25ms. Allocated memory was 208.7MB in the beginning and 594.5MB in the end (delta: 385.9MB). Free memory was 139.4MB in the beginning and 518.9MB in the end (delta: -379.5MB). Peak memory consumption was 322.4MB. Max. memory is 8.0GB. [2023-12-21 03:50:33,168 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 208.7MB. Free memory is still 158.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 03:50:33,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.74ms. Allocated memory was 208.7MB in the beginning and 250.6MB in the end (delta: 41.9MB). Free memory was 139.3MB in the beginning and 207.6MB in the end (delta: -68.2MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2023-12-21 03:50:33,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.11ms. Allocated memory is still 250.6MB. Free memory was 207.6MB in the beginning and 205.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 03:50:33,168 INFO L158 Benchmark]: Boogie Preprocessor took 39.11ms. Allocated memory is still 250.6MB. Free memory was 205.5MB in the beginning and 202.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 03:50:33,168 INFO L158 Benchmark]: RCFGBuilder took 401.92ms. Allocated memory is still 250.6MB. Free memory was 202.8MB in the beginning and 185.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-21 03:50:33,168 INFO L158 Benchmark]: TraceAbstraction took 68512.33ms. Allocated memory was 250.6MB in the beginning and 594.5MB in the end (delta: 343.9MB). Free memory was 185.0MB in the beginning and 518.9MB in the end (delta: -333.9MB). Peak memory consumption was 324.6MB. Max. memory is 8.0GB. [2023-12-21 03:50:33,169 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 208.7MB. Free memory is still 158.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 365.74ms. Allocated memory was 208.7MB in the beginning and 250.6MB in the end (delta: 41.9MB). Free memory was 139.3MB in the beginning and 207.6MB in the end (delta: -68.2MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.11ms. Allocated memory is still 250.6MB. Free memory was 207.6MB in the beginning and 205.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.11ms. Allocated memory is still 250.6MB. Free memory was 205.5MB in the beginning and 202.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 401.92ms. Allocated memory is still 250.6MB. Free memory was 202.8MB in the beginning and 185.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 68512.33ms. Allocated memory was 250.6MB in the beginning and 594.5MB in the end (delta: 343.9MB). Free memory was 185.0MB in the beginning and 518.9MB in the end (delta: -333.9MB). Peak memory consumption was 324.6MB. Max. memory is 8.0GB. * 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: 624]: 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, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 68.5s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 39.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 100 SdHoareTripleChecker+Valid, 37.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 1328 SdHoareTripleChecker+Invalid, 37.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 880 IncrementalHoareTripleChecker+Unchecked, 1197 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2597 IncrementalHoareTripleChecker+Invalid, 3506 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 131 mSDtfsCounter, 2597 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 558 GetRequests, 238 SyntacticMatches, 4 SemanticMatches, 316 ConstructedPredicates, 27 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 11.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=10, InterpolantAutomatonStates: 146, 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, 12 MinimizatonAttempts, 19 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 13 PreInvPairs, 24 NumberOfFragments, 985 HoareAnnotationTreeSize, 13 FormulaSimplifications, 469 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FormulaSimplificationsInter, 414 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 24.2s InterpolantComputationTime, 496 NumberOfCodeBlocks, 495 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 544 ConstructedInterpolants, 43 QuantifiedInterpolants, 8262 SizeOfPredicates, 161 NumberOfNonLiveVariables, 2701 ConjunctsInSsa, 795 ConjunctsInUnsatCore, 23 InterpolantComputations, 4 PerfectInterpolantSequences, 219/398 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 - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - 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-12-21 03:50:33,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...