/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_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/dll2n_append_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:29:02,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:29:02,849 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 21:29:02,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:29:02,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:29:02,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:29:02,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:29:02,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:29:02,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:29:02,866 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:29:02,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:29:02,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:29:02,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:29:02,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:29:02,868 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:29:02,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:29:02,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:29:02,868 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:29:02,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:29:02,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:29:02,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:29:02,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:29:02,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:29:02,870 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:29:02,870 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:29:02,870 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:29:02,870 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:29:02,870 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:29:02,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:29:02,870 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:29:02,871 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:29:02,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:29:02,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:29:02,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:29:02,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:29:02,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:29:02,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:29:02,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:29:02,872 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:29:02,872 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:29:02,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:29:02,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:29:02,872 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:29:02,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:29:02,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:29:02,872 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:29:02,872 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 [2023-12-24 21:29:03,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:29:03,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:29:03,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:29:03,043 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:29:03,043 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:29:03,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_append_equal.i [2023-12-24 21:29:04,021 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:29:04,188 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:29:04,188 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_append_equal.i [2023-12-24 21:29:04,198 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8955571e/1c338b418afa4651955a41d76cbcc41b/FLAGc6a060b10 [2023-12-24 21:29:04,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8955571e/1c338b418afa4651955a41d76cbcc41b [2023-12-24 21:29:04,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:29:04,211 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:29:04,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:29:04,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:29:04,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:29:04,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:29:04" (1/1) ... [2023-12-24 21:29:04,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3015de89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:04, skipping insertion in model container [2023-12-24 21:29:04,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:29:04" (1/1) ... [2023-12-24 21:29:04,241 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:29:04,444 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/dll2n_append_equal.i[24333,24346] [2023-12-24 21:29:04,449 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:29:04,462 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:29:04,493 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/dll2n_append_equal.i[24333,24346] [2023-12-24 21:29:04,494 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:29:04,513 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:29:04,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:04 WrapperNode [2023-12-24 21:29:04,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:29:04,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:29:04,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:29:04,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:29:04,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:04" (1/1) ... [2023-12-24 21:29:04,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:04" (1/1) ... [2023-12-24 21:29:04,550 INFO L138 Inliner]: procedures = 130, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 125 [2023-12-24 21:29:04,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:29:04,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:29:04,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:29:04,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:29:04,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:04" (1/1) ... [2023-12-24 21:29:04,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:04" (1/1) ... [2023-12-24 21:29:04,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:04" (1/1) ... [2023-12-24 21:29:04,574 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 13, 6]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 8, 1]. [2023-12-24 21:29:04,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:04" (1/1) ... [2023-12-24 21:29:04,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:04" (1/1) ... [2023-12-24 21:29:04,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:04" (1/1) ... [2023-12-24 21:29:04,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:04" (1/1) ... [2023-12-24 21:29:04,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:04" (1/1) ... [2023-12-24 21:29:04,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:04" (1/1) ... [2023-12-24 21:29:04,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:29:04,591 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:29:04,591 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:29:04,591 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:29:04,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:04" (1/1) ... [2023-12-24 21:29:04,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:29:04,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:29:04,618 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-24 21:29:04,626 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-24 21:29:04,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 21:29:04,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 21:29:04,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 21:29:04,641 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-24 21:29:04,641 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-24 21:29:04,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 21:29:04,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:29:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-24 21:29:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 21:29:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 21:29:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-24 21:29:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 21:29:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 21:29:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-24 21:29:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 21:29:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 21:29:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 21:29:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 21:29:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-24 21:29:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-24 21:29:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-24 21:29:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:29:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:29:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 21:29:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:29:04,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:29:04,747 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:29:04,749 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:29:05,017 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:29:05,051 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:29:05,051 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-24 21:29:05,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:29:05 BoogieIcfgContainer [2023-12-24 21:29:05,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:29:05,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:29:05,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:29:05,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:29:05,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:29:04" (1/3) ... [2023-12-24 21:29:05,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ef59e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:29:05, skipping insertion in model container [2023-12-24 21:29:05,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:04" (2/3) ... [2023-12-24 21:29:05,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ef59e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:29:05, skipping insertion in model container [2023-12-24 21:29:05,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:29:05" (3/3) ... [2023-12-24 21:29:05,059 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2023-12-24 21:29:05,071 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:29:05,071 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 21:29:05,103 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:29:05,108 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;@26b959bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:29:05,108 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 21:29:05,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 23 states have internal predecessors, (36), 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-24 21:29:05,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-24 21:29:05,116 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:05,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:05,117 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:05,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1765087503, now seen corresponding path program 1 times [2023-12-24 21:29:05,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:05,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890812939] [2023-12-24 21:29:05,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:05,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:29:05,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:05,132 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:29:05,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 21:29:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:05,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 21:29:05,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:05,295 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-24 21:29:05,295 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:29:05,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:05,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890812939] [2023-12-24 21:29:05,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890812939] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:29:05,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:29:05,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:29:05,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152754447] [2023-12-24 21:29:05,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:29:05,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 21:29:05,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:05,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 21:29:05,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:29:05,318 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 23 states have internal predecessors, (36), 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 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-24 21:29:05,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:05,351 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2023-12-24 21:29:05,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 21:29:05,353 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 13 [2023-12-24 21:29:05,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:05,358 INFO L225 Difference]: With dead ends: 48 [2023-12-24 21:29:05,358 INFO L226 Difference]: Without dead ends: 22 [2023-12-24 21:29:05,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:29:05,362 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:05,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:29:05,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-24 21:29:05,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-24 21:29:05,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-24 21:29:05,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-12-24 21:29:05,383 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2023-12-24 21:29:05,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:05,384 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-12-24 21:29:05,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-24 21:29:05,384 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-12-24 21:29:05,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-24 21:29:05,385 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:05,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:05,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 21:29:05,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:29:05,590 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:05,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:05,591 INFO L85 PathProgramCache]: Analyzing trace with hash 851795797, now seen corresponding path program 1 times [2023-12-24 21:29:05,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:05,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30668030] [2023-12-24 21:29:05,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:05,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:29:05,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:05,593 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:29:05,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 21:29:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:05,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:29:05,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:05,707 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-24 21:29:05,707 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:29:05,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:05,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30668030] [2023-12-24 21:29:05,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30668030] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:29:05,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:29:05,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:29:05,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806280524] [2023-12-24 21:29:05,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:29:05,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:29:05,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:05,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:29:05,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:29:05,715 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-24 21:29:05,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:05,760 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2023-12-24 21:29:05,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:29:05,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 13 [2023-12-24 21:29:05,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:05,761 INFO L225 Difference]: With dead ends: 43 [2023-12-24 21:29:05,762 INFO L226 Difference]: Without dead ends: 27 [2023-12-24 21:29:05,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:29:05,762 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:05,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 45 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:29:05,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-24 21:29:05,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2023-12-24 21:29:05,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 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-24 21:29:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-12-24 21:29:05,767 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 13 [2023-12-24 21:29:05,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:05,767 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-12-24 21:29:05,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-24 21:29:05,767 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-12-24 21:29:05,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-24 21:29:05,768 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:05,770 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:05,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 21:29:05,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:29:05,971 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:05,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:05,971 INFO L85 PathProgramCache]: Analyzing trace with hash -853542195, now seen corresponding path program 1 times [2023-12-24 21:29:05,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:05,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72662233] [2023-12-24 21:29:05,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:05,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:29:05,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:05,973 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:29:05,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 21:29:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:06,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 21:29:06,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:29:06,100 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:29:06,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:06,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72662233] [2023-12-24 21:29:06,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72662233] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:29:06,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:29:06,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:29:06,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810441986] [2023-12-24 21:29:06,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:29:06,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:29:06,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:06,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:29:06,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:29:06,102 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:29:06,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:06,160 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2023-12-24 21:29:06,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:29:06,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2023-12-24 21:29:06,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:06,161 INFO L225 Difference]: With dead ends: 48 [2023-12-24 21:29:06,161 INFO L226 Difference]: Without dead ends: 27 [2023-12-24 21:29:06,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:29:06,162 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:06,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:29:06,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-24 21:29:06,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-12-24 21:29:06,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-24 21:29:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-12-24 21:29:06,166 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 21 [2023-12-24 21:29:06,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:06,166 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-12-24 21:29:06,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:29:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-12-24 21:29:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-24 21:29:06,167 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:06,167 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:06,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 21:29:06,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:29:06,371 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:06,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:06,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1864659445, now seen corresponding path program 1 times [2023-12-24 21:29:06,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:06,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196873308] [2023-12-24 21:29:06,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:06,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:29:06,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:06,373 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:29:06,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 21:29:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:06,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 21:29:06,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:06,493 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-24 21:29:06,493 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:06,534 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-24 21:29:06,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:06,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196873308] [2023-12-24 21:29:06,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196873308] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:29:06,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:29:06,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-24 21:29:06,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220041105] [2023-12-24 21:29:06,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:29:06,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 21:29:06,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:06,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 21:29:06,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:29:06,539 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-24 21:29:06,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:06,615 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2023-12-24 21:29:06,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 21:29:06,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2023-12-24 21:29:06,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:06,617 INFO L225 Difference]: With dead ends: 48 [2023-12-24 21:29:06,617 INFO L226 Difference]: Without dead ends: 32 [2023-12-24 21:29:06,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:29:06,618 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:06,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 71 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:29:06,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-24 21:29:06,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2023-12-24 21:29:06,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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-24 21:29:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2023-12-24 21:29:06,623 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 21 [2023-12-24 21:29:06,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:06,623 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2023-12-24 21:29:06,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-24 21:29:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2023-12-24 21:29:06,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-24 21:29:06,624 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:06,624 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:06,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 21:29:06,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:29:06,840 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:06,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:06,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1775178627, now seen corresponding path program 1 times [2023-12-24 21:29:06,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:06,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151241595] [2023-12-24 21:29:06,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:06,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:29:06,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:06,842 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:29:06,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 21:29:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:06,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 21:29:06,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:07,086 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-24 21:29:07,096 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-24 21:29:07,096 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-24 21:29:07,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:07,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151241595] [2023-12-24 21:29:07,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151241595] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:29:07,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:29:07,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2023-12-24 21:29:07,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313899667] [2023-12-24 21:29:07,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:29:07,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 21:29:07,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:07,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 21:29:07,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-24 21:29:07,137 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:29:11,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 21:29:15,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 21:29:19,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 21:29:19,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:19,698 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2023-12-24 21:29:19,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 21:29:19,700 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2023-12-24 21:29:19,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:19,701 INFO L225 Difference]: With dead ends: 52 [2023-12-24 21:29:19,701 INFO L226 Difference]: Without dead ends: 31 [2023-12-24 21:29:19,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-12-24 21:29:19,702 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 24 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:19,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 154 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 3 Unknown, 0 Unchecked, 12.5s Time] [2023-12-24 21:29:19,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-24 21:29:19,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-24 21:29:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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-24 21:29:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-12-24 21:29:19,706 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 29 [2023-12-24 21:29:19,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:19,706 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-12-24 21:29:19,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:29:19,706 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-12-24 21:29:19,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-24 21:29:19,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:19,707 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:19,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 21:29:19,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:29:19,911 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:19,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:19,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2018592169, now seen corresponding path program 1 times [2023-12-24 21:29:19,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:19,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892996743] [2023-12-24 21:29:19,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:19,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:29:19,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:19,913 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:29:19,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-24 21:29:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:20,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 21:29:20,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:20,182 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-24 21:29:20,192 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-24 21:29:20,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-24 21:29:20,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:20,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892996743] [2023-12-24 21:29:20,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892996743] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:29:20,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:29:20,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2023-12-24 21:29:20,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477051374] [2023-12-24 21:29:20,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:29:20,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 21:29:20,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:20,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 21:29:20,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-24 21:29:20,241 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:29:24,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 21:29:28,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 21:29:28,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:28,821 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2023-12-24 21:29:28,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 21:29:28,821 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2023-12-24 21:29:28,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:28,822 INFO L225 Difference]: With dead ends: 38 [2023-12-24 21:29:28,822 INFO L226 Difference]: Without dead ends: 35 [2023-12-24 21:29:28,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-12-24 21:29:28,822 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:28,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 142 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2023-12-24 21:29:28,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-24 21:29:28,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2023-12-24 21:29:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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-24 21:29:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-12-24 21:29:28,827 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 32 [2023-12-24 21:29:28,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:28,827 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-12-24 21:29:28,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:29:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-12-24 21:29:28,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-24 21:29:28,828 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:28,828 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:28,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-24 21:29:29,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:29:29,035 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:29,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:29,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2018590495, now seen corresponding path program 1 times [2023-12-24 21:29:29,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:29,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497783933] [2023-12-24 21:29:29,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:29,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:29:29,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:29,055 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:29:29,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 21:29:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:29,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-24 21:29:29,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:29,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-12-24 21:29:29,439 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:29:29,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:29:29,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:29:29,548 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:29:29,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-24 21:29:29,716 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 44 treesize of output 20 [2023-12-24 21:29:29,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 21:29:29,810 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_3|) (_ bv0 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2023-12-24 21:29:29,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:29:29,828 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 52 treesize of output 35 [2023-12-24 21:29:29,850 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:29:29,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-24 21:29:29,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2023-12-24 21:29:29,948 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 24 treesize of output 12 [2023-12-24 21:29:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-24 21:29:29,969 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:30,082 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_37| (_ BitVec 32)) (v_ArrVal_428 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_37|) (_ bv0 1))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_37| v_ArrVal_428) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (_ bv0 32))))) is different from false [2023-12-24 21:29:30,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:30,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497783933] [2023-12-24 21:29:30,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497783933] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:29:30,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [175490222] [2023-12-24 21:29:30,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:30,086 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:29:30,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:29:30,133 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 21:29:30,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-12-24 21:29:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:30,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 56 conjunts are in the unsatisfiable core [2023-12-24 21:29:30,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:30,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:29:30,718 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:29:30,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:29:30,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-24 21:29:30,869 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-24 21:29:31,231 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-24 21:29:31,236 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 19 treesize of output 11 [2023-12-24 21:29:31,453 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-24 21:29:31,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-12-24 21:29:31,466 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-24 21:29:31,838 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 26 [2023-12-24 21:29:31,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-12-24 21:29:31,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 21:29:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:29:32,039 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:32,233 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_526 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_526) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_527) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_526 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 (select v_ArrVal_526 .cse0))))))) is different from false [2023-12-24 21:29:32,306 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_526 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_526) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_527) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_526 (let ((.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_526 .cse1)))))))) is different from false [2023-12-24 21:29:32,323 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_526 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (or (not (= v_ArrVal_526 (let ((.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_526 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_526) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_527) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-12-24 21:29:32,384 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_527 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| (_ BitVec 32)) (v_ArrVal_526 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (or (not (= (let ((.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| v_ArrVal_532) .cse0) .cse1 (select v_ArrVal_526 .cse1))) v_ArrVal_526)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_526) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| v_ArrVal_527) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-12-24 21:29:32,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [175490222] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:29:32,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:29:32,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 41 [2023-12-24 21:29:32,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264369129] [2023-12-24 21:29:32,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:29:32,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-24 21:29:32,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:32,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-24 21:29:32,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1868, Unknown=6, NotChecked=546, Total=2550 [2023-12-24 21:29:32,389 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 41 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 33 states have internal predecessors, (49), 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-24 21:29:36,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:36,886 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2023-12-24 21:29:36,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-24 21:29:36,889 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 33 states have internal predecessors, (49), 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 32 [2023-12-24 21:29:36,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:36,890 INFO L225 Difference]: With dead ends: 43 [2023-12-24 21:29:36,890 INFO L226 Difference]: Without dead ends: 35 [2023-12-24 21:29:36,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=273, Invalid=3405, Unknown=6, NotChecked=738, Total=4422 [2023-12-24 21:29:36,892 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:36,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 379 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 708 Invalid, 0 Unknown, 38 Unchecked, 3.3s Time] [2023-12-24 21:29:36,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-24 21:29:36,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2023-12-24 21:29:36,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 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-24 21:29:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2023-12-24 21:29:36,897 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 32 [2023-12-24 21:29:36,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:36,897 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2023-12-24 21:29:36,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 33 states have internal predecessors, (49), 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-24 21:29:36,897 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2023-12-24 21:29:36,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-24 21:29:36,898 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:36,898 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:36,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2023-12-24 21:29:37,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 21:29:37,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:29:37,305 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:37,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:37,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1013232572, now seen corresponding path program 1 times [2023-12-24 21:29:37,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:37,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390057106] [2023-12-24 21:29:37,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:37,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:29:37,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:37,307 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:29:37,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-24 21:29:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:37,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-24 21:29:37,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:37,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:29:37,655 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:29:37,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:29:37,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-24 21:29:37,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:29:37,752 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:29:37,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2023-12-24 21:29:37,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-24 21:29:37,945 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 16 [2023-12-24 21:29:37,951 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-24 21:29:37,955 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 19 treesize of output 11 [2023-12-24 21:29:38,101 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-24 21:29:38,101 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-24 21:29:38,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:29:38,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2023-12-24 21:29:38,144 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:29:38,145 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 32 treesize of output 34 [2023-12-24 21:29:38,489 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 40 treesize of output 16 [2023-12-24 21:29:38,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2023-12-24 21:29:38,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 21:29:38,797 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:29:38,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:38,930 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_634 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_633) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_634) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-12-24 21:29:39,282 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| (_ BitVec 32)) (v_ArrVal_642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_634 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_int#1| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_642) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) v_ArrVal_633) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_634) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31|) (_ bv0 1))))) is different from false [2023-12-24 21:29:39,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:39,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390057106] [2023-12-24 21:29:39,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390057106] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:29:39,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1046193644] [2023-12-24 21:29:39,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:39,285 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:29:39,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:29:39,286 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 21:29:39,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-12-24 21:29:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:39,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 74 conjunts are in the unsatisfiable core [2023-12-24 21:29:39,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:39,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:29:40,172 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:29:40,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:29:40,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-24 21:29:40,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:29:40,389 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-24 21:29:40,398 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-24 21:29:40,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 21:29:40,793 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-24 21:29:40,796 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-24 21:29:41,108 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-24 21:29:41,108 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 20 treesize of output 23 [2023-12-24 21:29:41,141 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-24 21:29:41,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-12-24 21:29:41,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-24 21:29:41,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-24 21:29:41,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:29:41,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2023-12-24 21:29:42,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-24 21:29:42,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2023-12-24 21:29:42,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:29:42,309 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 35 treesize of output 27 [2023-12-24 21:29:42,316 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:29:42,316 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-24 21:29:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:29:42,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:42,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:29:42,962 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 50 treesize of output 47 [2023-12-24 21:29:42,989 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| (_ bv0 32) v_ArrVal_745) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_743) .cse0) .cse1))) (forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_3 (_ BitVec 32)) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimIndex_3 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimIndex_3 v_ArrVal_745) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_743) .cse0) .cse1)))) (or (forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_3 (_ BitVec 32)) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimIndex_3 v_ArrVal_745) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_743) .cse0) .cse1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))))) is different from false [2023-12-24 21:29:43,015 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (and (forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| (_ bv0 32) v_ArrVal_745) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_743) .cse0) .cse1))) (forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_3 (_ BitVec 32)) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimIndex_3 v_ArrVal_745) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_743) .cse0) .cse1)) (= .cse2 v_arrayElimIndex_3))) (or (forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_3 (_ BitVec 32)) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimIndex_3 v_ArrVal_745) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_743) .cse0) .cse1))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) (bvadd (_ bv4 32) .cse3)) .cse3))))) is different from false [2023-12-24 21:29:43,042 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (and (forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| (_ bv0 32) v_ArrVal_745) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_743) .cse0) .cse1))) (forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_3 (_ BitVec 32)) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimIndex_3 v_ArrVal_745) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_743) .cse0) .cse1)) (= .cse2 v_arrayElimIndex_3))) (or (forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_3 (_ BitVec 32)) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimIndex_3 v_ArrVal_745) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_743) .cse0) .cse1))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) (bvadd (_ bv4 32) .cse3)) .cse3))))) is different from false [2023-12-24 21:29:45,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1046193644] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:29:45,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:29:45,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 50 [2023-12-24 21:29:45,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462736499] [2023-12-24 21:29:45,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:29:45,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-24 21:29:45,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:45,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-24 21:29:45,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=3397, Unknown=59, NotChecked=610, Total=4290 [2023-12-24 21:29:45,780 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 50 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 40 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-24 21:29:50,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:50,442 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2023-12-24 21:29:50,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-24 21:29:50,443 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 40 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2023-12-24 21:29:50,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:50,443 INFO L225 Difference]: With dead ends: 48 [2023-12-24 21:29:50,444 INFO L226 Difference]: Without dead ends: 46 [2023-12-24 21:29:50,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=368, Invalid=4992, Unknown=62, NotChecked=740, Total=6162 [2023-12-24 21:29:50,445 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 78 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:50,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 292 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-12-24 21:29:50,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-24 21:29:50,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2023-12-24 21:29:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 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-24 21:29:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2023-12-24 21:29:50,454 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 34 [2023-12-24 21:29:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:50,454 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2023-12-24 21:29:50,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 40 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-24 21:29:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2023-12-24 21:29:50,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-24 21:29:50,454 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:50,454 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:50,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2023-12-24 21:29:50,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-24 21:29:50,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:29:50,863 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:50,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:50,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1241041523, now seen corresponding path program 1 times [2023-12-24 21:29:50,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:50,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942965594] [2023-12-24 21:29:50,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:50,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:29:50,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:50,866 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:29:50,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-24 21:29:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:51,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-24 21:29:51,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:51,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-12-24 21:29:51,205 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:29:51,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:29:51,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:29:51,292 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:29:51,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-24 21:29:51,434 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 44 treesize of output 20 [2023-12-24 21:29:51,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 21:29:51,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:29:51,598 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 52 treesize of output 35 [2023-12-24 21:29:51,618 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:29:51,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-24 21:29:52,071 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2023-12-24 21:29:52,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 37 [2023-12-24 21:29:52,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2023-12-24 21:29:52,181 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 24 treesize of output 12 [2023-12-24 21:29:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:29:52,213 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:52,852 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_39| (_ BitVec 32)) (v_ArrVal_849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_853 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_39|) (_ bv0 1))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_39| v_ArrVal_853) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) v_ArrVal_850) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_39| v_ArrVal_849) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32))))) is different from false [2023-12-24 21:29:52,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:52,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942965594] [2023-12-24 21:29:52,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942965594] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:29:52,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1040704679] [2023-12-24 21:29:52,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:52,855 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:29:52,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:29:52,856 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 21:29:52,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-12-24 21:29:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:53,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 53 conjunts are in the unsatisfiable core [2023-12-24 21:29:53,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:53,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-12-24 21:29:53,454 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:29:53,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:29:53,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:29:53,618 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:29:53,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-24 21:29:53,890 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 44 treesize of output 20 [2023-12-24 21:29:53,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 21:29:58,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:29:58,122 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 52 treesize of output 35 [2023-12-24 21:29:58,155 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:29:58,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-24 21:29:58,710 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2023-12-24 21:29:58,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 37 [2023-12-24 21:29:58,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2023-12-24 21:29:58,813 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 24 treesize of output 12 [2023-12-24 21:29:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:29:58,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:59,555 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_950 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_43| (_ BitVec 32)) (v_ArrVal_951 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_954 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_43| v_ArrVal_954) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) v_ArrVal_951) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_43| v_ArrVal_950) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_43|))))) is different from false [2023-12-24 21:29:59,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1040704679] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:29:59,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:29:59,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 42 [2023-12-24 21:29:59,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186542153] [2023-12-24 21:29:59,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:29:59,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-24 21:29:59,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:59,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-24 21:29:59,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2390, Unknown=76, NotChecked=202, Total=2862 [2023-12-24 21:29:59,559 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 42 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 33 states have internal predecessors, (51), 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-24 21:30:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:30:03,269 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2023-12-24 21:30:03,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-24 21:30:03,270 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 33 states have internal predecessors, (51), 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 36 [2023-12-24 21:30:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:30:03,270 INFO L225 Difference]: With dead ends: 53 [2023-12-24 21:30:03,270 INFO L226 Difference]: Without dead ends: 50 [2023-12-24 21:30:03,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=333, Invalid=3889, Unknown=76, NotChecked=258, Total=4556 [2023-12-24 21:30:03,272 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 62 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-24 21:30:03,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 307 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-24 21:30:03,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-24 21:30:03,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2023-12-24 21:30:03,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 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-24 21:30:03,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2023-12-24 21:30:03,292 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 36 [2023-12-24 21:30:03,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:30:03,292 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2023-12-24 21:30:03,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 33 states have internal predecessors, (51), 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-24 21:30:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2023-12-24 21:30:03,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-24 21:30:03,292 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:30:03,292 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:30:03,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2023-12-24 21:30:03,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-24 21:30:03,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:30:03,705 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:30:03,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:30:03,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1241039849, now seen corresponding path program 1 times [2023-12-24 21:30:03,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:30:03,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271459294] [2023-12-24 21:30:03,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:30:03,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:30:03,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:30:03,707 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:30:03,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-24 21:30:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:30:03,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 86 conjunts are in the unsatisfiable core [2023-12-24 21:30:03,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:30:03,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:30:04,039 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-24 21:30:04,171 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 21:30:04,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-24 21:30:04,212 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:30:04,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:30:04,259 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-24 21:30:04,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:30:04,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:30:04,349 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:30:04,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 77 [2023-12-24 21:30:04,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-12-24 21:30:04,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-24 21:30:04,564 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 47 treesize of output 23 [2023-12-24 21:30:04,569 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-24 21:30:04,573 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 19 treesize of output 11 [2023-12-24 21:30:04,576 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-24 21:30:04,747 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-24 21:30:04,747 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-24 21:30:04,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:04,770 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 55 treesize of output 38 [2023-12-24 21:30:04,796 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-12-24 21:30:04,797 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-24 21:30:04,833 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:30:04,833 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 32 treesize of output 34 [2023-12-24 21:30:05,467 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2023-12-24 21:30:05,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 169 treesize of output 94 [2023-12-24 21:30:05,475 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 83 treesize of output 34 [2023-12-24 21:30:05,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2023-12-24 21:30:05,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 15 [2023-12-24 21:30:05,570 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 50 treesize of output 30 [2023-12-24 21:30:05,655 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-24 21:30:05,658 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-24 21:30:05,753 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:30:05,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:30:05,996 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1066 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_1063 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 (select v_ArrVal_1063 .cse0))))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1063) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1067) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1065) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1064) .cse1) .cse2)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1068) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1066) .cse1) .cse2)))))) is different from false [2023-12-24 21:30:06,072 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1066 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_1063) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1067) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1065) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1064) .cse1) .cse2)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1068) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1066) .cse1) .cse2)))) (not (= (let ((.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4)))) (store (select |c_#memory_int#1| .cse0) .cse3 (select v_ArrVal_1063 .cse3))) v_ArrVal_1063)))))) is different from false [2023-12-24 21:30:06,130 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1066 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3))) (or (not (= v_ArrVal_1063 (let ((.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3)))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_1063 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_1063) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1067) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1065) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1064) .cse4) .cse5)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1068) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1066) .cse4) .cse5)))))))) is different from false [2023-12-24 21:30:06,166 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1066 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5))) (or (= (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_1063) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1067) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1065) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1064) .cse1) .cse2)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1068) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1066) .cse1) .cse2))) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_1063 (let ((.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5)))) (store (select |c_#memory_int#1| .cse0) .cse3 (select v_ArrVal_1063 .cse3))))))))) is different from false [2023-12-24 21:30:06,300 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1066 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1077 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_47| (_ BitVec 32))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_47| v_ArrVal_1078) .cse2) .cse3))) (or (not (= (let ((.cse1 (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_47| v_ArrVal_1077) .cse2) .cse3)))) (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_47| v_ArrVal_1079) .cse0) .cse1 (select v_ArrVal_1063 .cse1))) v_ArrVal_1063)) (= (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_1063) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_47| v_ArrVal_1067) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1065) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_47| v_ArrVal_1064) .cse4) .cse5)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1068) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_47| v_ArrVal_1066) .cse4) .cse5))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_47|))))))) is different from false [2023-12-24 21:30:06,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:30:06,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271459294] [2023-12-24 21:30:06,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271459294] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:30:06,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [253792799] [2023-12-24 21:30:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:30:06,311 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:30:06,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:30:06,312 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 21:30:06,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2023-12-24 21:30:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:30:06,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 90 conjunts are in the unsatisfiable core [2023-12-24 21:30:06,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:30:06,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:30:06,900 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-24 21:30:07,222 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:30:07,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:30:07,235 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-24 21:30:07,335 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-24 21:30:07,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:30:07,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:30:07,484 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:30:07,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 77 [2023-12-24 21:30:07,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-12-24 21:30:07,498 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 11 [2023-12-24 21:30:07,871 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 47 treesize of output 23 [2023-12-24 21:30:07,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-24 21:30:07,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 21:30:07,899 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-24 21:30:08,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:08,231 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 55 treesize of output 38 [2023-12-24 21:30:08,251 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:30:08,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-24 21:30:08,263 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-24 21:30:08,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-24 21:30:09,546 INFO L349 Elim1Store]: treesize reduction 59, result has 23.4 percent of original size [2023-12-24 21:30:09,547 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 168 treesize of output 97 [2023-12-24 21:30:09,557 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 83 treesize of output 34 [2023-12-24 21:30:09,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2023-12-24 21:30:09,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 15 [2023-12-24 21:30:09,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:09,699 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 66 treesize of output 46 [2023-12-24 21:30:09,714 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:30:09,714 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-24 21:30:09,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 27 treesize of output 15 [2023-12-24 21:30:09,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-24 21:30:09,840 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:30:09,840 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:30:09,876 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1190) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1192) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1188) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1191) .cse0) .cse1)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1187) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1193) .cse0) .cse1)))) (not (= (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse2 (select v_ArrVal_1190 .cse2))) v_ArrVal_1190)))) is different from false [2023-12-24 21:30:11,420 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_51| (_ BitVec 32)) (v_ArrVal_1193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_51| v_ArrVal_1202)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (let ((.cse1 (select (select .cse0 .cse5) .cse6)) (.cse2 (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_51| v_ArrVal_1204) .cse5) .cse6)))) (or (not (= (select (select .cse0 .cse1) .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int#1| .cse1 v_ArrVal_1190) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_51| v_ArrVal_1192) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1188) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_51| v_ArrVal_1191) .cse3) .cse4)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1187) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_51| v_ArrVal_1193) .cse3) .cse4)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_51|))) (not (= (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_51| v_ArrVal_1203) .cse1) .cse2 (select v_ArrVal_1190 .cse2)) v_ArrVal_1190)))))) is different from false [2023-12-24 21:30:11,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [253792799] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:30:11,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:30:11,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 49 [2023-12-24 21:30:11,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803045275] [2023-12-24 21:30:11,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:30:11,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-24 21:30:11,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:30:11,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-24 21:30:11,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=3106, Unknown=8, NotChecked=826, Total=4160 [2023-12-24 21:30:11,434 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 49 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 39 states have internal predecessors, (55), 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-24 21:30:16,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:30:16,505 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2023-12-24 21:30:16,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-24 21:30:16,506 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 39 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2023-12-24 21:30:16,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:30:16,506 INFO L225 Difference]: With dead ends: 50 [2023-12-24 21:30:16,506 INFO L226 Difference]: Without dead ends: 48 [2023-12-24 21:30:16,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=396, Invalid=5174, Unknown=8, NotChecked=1064, Total=6642 [2023-12-24 21:30:16,508 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 45 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-12-24 21:30:16,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 313 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-12-24 21:30:16,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-24 21:30:16,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2023-12-24 21:30:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 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-24 21:30:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2023-12-24 21:30:16,518 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 36 [2023-12-24 21:30:16,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:30:16,519 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2023-12-24 21:30:16,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 39 states have internal predecessors, (55), 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-24 21:30:16,519 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2023-12-24 21:30:16,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-24 21:30:16,521 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:30:16,521 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:30:16,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2023-12-24 21:30:16,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-12-24 21:30:16,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:30:16,922 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:30:16,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:30:16,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1687594025, now seen corresponding path program 2 times [2023-12-24 21:30:16,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:30:16,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921573849] [2023-12-24 21:30:16,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:30:16,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:30:16,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:30:16,923 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:30:16,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-24 21:30:17,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:30:17,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:30:17,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 86 conjunts are in the unsatisfiable core [2023-12-24 21:30:17,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:30:17,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:30:17,309 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-24 21:30:17,461 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 21:30:17,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-24 21:30:17,482 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:30:17,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:30:17,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:30:17,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2023-12-24 21:30:17,547 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-24 21:30:17,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-24 21:30:17,626 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:30:17,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 77 [2023-12-24 21:30:17,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-24 21:30:17,639 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 0 case distinctions, treesize of input 46 treesize of output 25 [2023-12-24 21:30:17,845 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 47 treesize of output 23 [2023-12-24 21:30:17,850 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-24 21:30:17,854 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-24 21:30:17,858 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 19 treesize of output 11 [2023-12-24 21:30:18,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:18,015 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 55 treesize of output 38 [2023-12-24 21:30:18,044 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:30:18,044 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 32 treesize of output 34 [2023-12-24 21:30:18,055 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 33 [2023-12-24 21:30:18,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-24 21:30:18,505 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 55 treesize of output 23 [2023-12-24 21:30:18,642 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-24 21:30:18,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-12-24 21:30:18,749 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-24 21:30:18,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 21:30:18,895 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:30:18,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:30:20,039 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1317 (_ BitVec 32)) (v_ArrVal_1315 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.base_57| (_ BitVec 32))) (= (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_~last~0#1.base_57| (store (select |c_#memory_int#1| |v_ULTIMATE.start_dll_append_~last~0#1.base_57|) (bvadd (_ bv4 32) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1))))) v_ArrVal_1317)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1315) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-12-24 21:30:20,155 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1317 (_ BitVec 32)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| (_ BitVec 32)) (v_ArrVal_1328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1327 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.base_57| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_~last~0#1.base_57| (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| v_ArrVal_1328) |v_ULTIMATE.start_dll_append_~last~0#1.base_57|) (bvadd (_ bv4 32) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| v_ArrVal_1326)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| v_ArrVal_1327) .cse1) .cse2)) (bvadd (_ bv4 32) (select (select .cse0 .cse1) .cse2))))) v_ArrVal_1317)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| v_ArrVal_1315) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-12-24 21:30:20,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:30:20,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921573849] [2023-12-24 21:30:20,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921573849] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:30:20,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [489672318] [2023-12-24 21:30:20,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:30:20,162 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:30:20,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:30:20,163 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 21:30:20,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-12-24 21:30:20,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:30:20,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:30:20,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 88 conjunts are in the unsatisfiable core [2023-12-24 21:30:20,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:30:20,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:30:20,762 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-24 21:30:21,254 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:30:21,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:30:21,264 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-24 21:30:21,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-24 21:30:21,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-24 21:30:21,387 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-24 21:30:21,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:30:21,524 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:30:21,524 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 51 [2023-12-24 21:30:21,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:21,532 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 11 [2023-12-24 21:30:21,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:21,539 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 11 [2023-12-24 21:30:21,987 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-24 21:30:21,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 29 [2023-12-24 21:30:21,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 21:30:21,999 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-24 21:30:22,002 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-24 21:30:22,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:22,526 INFO L349 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-12-24 21:30:22,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 53 [2023-12-24 21:30:22,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:22,559 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:30:22,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-24 21:30:22,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-24 21:30:22,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-24 21:30:23,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-24 21:30:23,969 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-12-24 21:30:23,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 29 [2023-12-24 21:30:24,167 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-24 21:30:24,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2023-12-24 21:30:24,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:24,333 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 35 treesize of output 27 [2023-12-24 21:30:24,339 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:30:24,340 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-24 21:30:24,435 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:30:24,435 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:30:24,663 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1439 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|)) v_ArrVal_1440) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1439) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-12-24 21:30:24,995 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1439 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1)))) v_ArrVal_1440) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1439) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-12-24 21:30:25,463 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1454 (_ BitVec 32)) (v_ArrVal_1440 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_59| (_ BitVec 32)) (v_ArrVal_1456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1453 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_59|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_59| (store (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_59|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) v_ArrVal_1453) (_ bv0 32) v_ArrVal_1454)))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_59| v_ArrVal_1456) .cse1) .cse2)))) v_ArrVal_1440) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_59| v_ArrVal_1439) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-12-24 21:30:25,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [489672318] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:30:25,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:30:25,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 51 [2023-12-24 21:30:25,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237756803] [2023-12-24 21:30:25,468 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:30:25,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-24 21:30:25,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:30:25,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-24 21:30:25,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3359, Unknown=102, NotChecked=610, Total=4290 [2023-12-24 21:30:25,470 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 51 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 40 states have internal predecessors, (56), 6 states have call successors, (6), 5 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-24 21:30:33,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:30:33,609 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2023-12-24 21:30:33,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-24 21:30:33,609 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 40 states have internal predecessors, (56), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2023-12-24 21:30:33,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:30:33,610 INFO L225 Difference]: With dead ends: 92 [2023-12-24 21:30:33,610 INFO L226 Difference]: Without dead ends: 90 [2023-12-24 21:30:33,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=549, Invalid=7925, Unknown=102, NotChecked=930, Total=9506 [2023-12-24 21:30:33,612 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 126 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-24 21:30:33,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 300 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-12-24 21:30:33,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-24 21:30:33,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 46. [2023-12-24 21:30:33,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 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-24 21:30:33,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2023-12-24 21:30:33,623 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 36 [2023-12-24 21:30:33,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:30:33,624 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2023-12-24 21:30:33,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 40 states have internal predecessors, (56), 6 states have call successors, (6), 5 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-24 21:30:33,624 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2023-12-24 21:30:33,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-24 21:30:33,624 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:30:33,624 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:30:33,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-24 21:30:33,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2023-12-24 21:30:34,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 21:30:34,031 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:30:34,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:30:34,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1361646376, now seen corresponding path program 2 times [2023-12-24 21:30:34,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:30:34,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611662659] [2023-12-24 21:30:34,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:30:34,031 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:30:34,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:30:34,032 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:30:34,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-24 21:30:34,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:30:34,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:30:34,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-24 21:30:34,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:30:34,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:30:34,450 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:30:34,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:30:34,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:30:34,514 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:30:34,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-24 21:30:34,625 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 16 [2023-12-24 21:30:34,629 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 19 treesize of output 11 [2023-12-24 21:30:34,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:34,753 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 40 treesize of output 29 [2023-12-24 21:30:34,773 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:30:34,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-24 21:30:35,191 INFO L349 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2023-12-24 21:30:35,191 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 65 [2023-12-24 21:30:35,217 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2023-12-24 21:30:35,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 232 treesize of output 159 [2023-12-24 21:30:35,235 INFO L349 Elim1Store]: treesize reduction 89, result has 9.2 percent of original size [2023-12-24 21:30:35,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 164 treesize of output 124 [2023-12-24 21:30:35,339 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 114 treesize of output 70 [2023-12-24 21:30:35,435 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 66 treesize of output 50 [2023-12-24 21:30:35,527 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 21:30:35,527 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 68 treesize of output 23 [2023-12-24 21:30:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:30:35,558 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:30:35,737 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1557 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1555))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1557) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1554) .cse1) .cse2)))) (_ bv0 32)))) is different from false [2023-12-24 21:30:35,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:35,776 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 938 treesize of output 834 [2023-12-24 21:30:35,782 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 398 treesize of output 390 [2023-12-24 21:30:35,786 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 390 treesize of output 374 [2023-12-24 21:30:35,974 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))) (let ((.cse14 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (= .cse4 .cse6)) (.cse13 (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (let ((.cse8 (not .cse13)) (.cse1 (not .cse2)) (.cse5 (bvadd (_ bv4 32) .cse14)) (.cse7 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse9 (and (or (and (or (forall ((v_arrayElimCell_229 (_ BitVec 32)) (v_arrayElimCell_228 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse15 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store .cse7 (bvadd v_arrayElimCell_228 (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1555))) (select .cse15 (select (select .cse15 .cse4) .cse5))) (bvadd v_arrayElimCell_229 (_ bv4 32))) (_ bv0 32)))) .cse1) (or (forall ((v_arrayElimCell_227 (_ BitVec 32)) (v_arrayElimCell_228 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse16 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store .cse7 (bvadd v_arrayElimCell_228 (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1555))) (select .cse16 (select (select .cse16 .cse4) .cse5))) (bvadd v_arrayElimCell_227 (_ bv4 32))) (_ bv0 32)))) .cse2)) .cse13) (or .cse8 (let ((.cse17 (forall ((v_arrayElimCell_228 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_230 (_ BitVec 32))) (not (= (select (let ((.cse18 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store .cse7 (bvadd v_arrayElimCell_228 (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1555))) (select .cse18 (select (select .cse18 .cse4) .cse5))) (bvadd v_arrayElimCell_230 (_ bv4 32))) (_ bv0 32)))))) (and (or .cse17 .cse2) (or .cse17 .cse1))))))) (and (or (let ((.cse0 (forall ((v_arrayElimCell_227 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_230 (_ BitVec 32))) (not (= (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store .cse7 (bvadd v_arrayElimCell_227 (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1555))) (select .cse3 (select (select .cse3 .cse4) .cse5))) (bvadd v_arrayElimCell_230 (_ bv4 32))) (_ bv0 32)))))) (and (or .cse0 .cse1) (or .cse0 .cse2))) .cse8) (or (= .cse4 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse9) (or (and (or (forall ((v_arrayElimCell_227 (_ BitVec 32)) (v_arrayElimCell_229 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse10 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store .cse7 (bvadd v_arrayElimCell_227 (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1555))) (select .cse10 (select (select .cse10 .cse4) .cse5))) (bvadd v_arrayElimCell_229 (_ bv4 32))) (_ bv0 32)))) .cse1) (or (forall ((v_arrayElimCell_227 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse12 (bvadd v_arrayElimCell_227 (_ bv4 32)))) (select (let ((.cse11 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store .cse7 .cse12 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1555))) (select .cse11 (select (select .cse11 .cse4) .cse5))) .cse12)) (_ bv0 32)))) .cse2)) .cse13) (or .cse9 (= .cse14 |c_ULTIMATE.start_dll_append_~last~0#1.offset|))))))) is different from false [2023-12-24 21:30:38,428 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse13 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse10) (bvadd (_ bv4 32) .cse13)))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (= .cse2 .cse4)) (.cse9 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (let ((.cse14 (not .cse9)) (.cse0 (not .cse8)) (.cse3 (bvadd (_ bv4 32) .cse12)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse11 (and (or (and (or .cse0 (forall ((v_arrayElimCell_229 (_ BitVec 32)) (v_arrayElimCell_228 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse17 (store (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse5 (bvadd v_arrayElimCell_228 (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1555))) (select .cse17 (select (select .cse17 .cse2) .cse3))) (bvadd v_arrayElimCell_229 (_ bv4 32))) (_ bv0 32))))) (or (forall ((v_arrayElimCell_227 (_ BitVec 32)) (v_arrayElimCell_228 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse18 (store (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse5 (bvadd v_arrayElimCell_228 (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1555))) (select .cse18 (select (select .cse18 .cse2) .cse3))) (bvadd v_arrayElimCell_227 (_ bv4 32))) (_ bv0 32)))) .cse8)) .cse9) (or .cse14 (let ((.cse19 (forall ((v_arrayElimCell_228 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_230 (_ BitVec 32))) (not (= (_ bv0 32) (select (let ((.cse20 (store (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse5 (bvadd v_arrayElimCell_228 (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1555))) (select .cse20 (select (select .cse20 .cse2) .cse3))) (bvadd v_arrayElimCell_230 (_ bv4 32)))))))) (and (or .cse19 .cse8) (or .cse19 .cse0))))))) (and (or (and (or .cse0 (forall ((v_arrayElimCell_227 (_ BitVec 32)) (v_arrayElimCell_229 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse5 (bvadd v_arrayElimCell_227 (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1555))) (select .cse1 (select (select .cse1 .cse2) .cse3))) (bvadd v_arrayElimCell_229 (_ bv4 32))) (_ bv0 32))))) (or (forall ((v_arrayElimCell_227 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse7 (bvadd v_arrayElimCell_227 (_ bv4 32)))) (select (let ((.cse6 (store (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse5 .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1555))) (select .cse6 (select (select .cse6 .cse2) .cse3))) .cse7)) (_ bv0 32)))) .cse8)) .cse9) (or (= .cse2 .cse10) .cse11) (or .cse11 (= .cse12 .cse13)) (or .cse14 (let ((.cse15 (forall ((v_arrayElimCell_227 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_230 (_ BitVec 32))) (not (= (select (let ((.cse16 (store (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse5 (bvadd v_arrayElimCell_227 (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1555))) (select .cse16 (select (select .cse16 .cse2) .cse3))) (bvadd v_arrayElimCell_230 (_ bv4 32))) (_ bv0 32)))))) (and (or .cse15 .cse8) (or .cse0 .cse15)))))))))) is different from false [2023-12-24 21:30:38,877 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse15 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse16) (bvadd (_ bv4 32) .cse15)))) (let ((.cse14 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (= .cse4 .cse6)) (.cse9 (= .cse4 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))) (let ((.cse8 (not .cse9)) (.cse1 (not .cse2)) (.cse5 (bvadd (_ bv4 32) .cse14)) (.cse7 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse13 (and (or .cse8 (let ((.cse17 (forall ((v_arrayElimCell_228 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_230 (_ BitVec 32))) (not (= (select (let ((.cse18 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store .cse7 (bvadd v_arrayElimCell_228 (_ bv4 32)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1555))) (select .cse18 (select (select .cse18 .cse4) .cse5))) (bvadd v_arrayElimCell_230 (_ bv4 32))) (_ bv0 32)))))) (and (or .cse17 .cse2) (or .cse1 .cse17)))) (or .cse9 (and (or .cse1 (forall ((v_arrayElimCell_229 (_ BitVec 32)) (v_arrayElimCell_228 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse19 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store .cse7 (bvadd v_arrayElimCell_228 (_ bv4 32)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1555))) (select .cse19 (select (select .cse19 .cse4) .cse5))) (bvadd v_arrayElimCell_229 (_ bv4 32))) (_ bv0 32))))) (or (forall ((v_arrayElimCell_227 (_ BitVec 32)) (v_arrayElimCell_228 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse20 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store .cse7 (bvadd v_arrayElimCell_228 (_ bv4 32)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1555))) (select .cse20 (select (select .cse20 .cse4) .cse5))) (bvadd v_arrayElimCell_227 (_ bv4 32))) (_ bv0 32)))) .cse2)))))) (and (or (let ((.cse0 (forall ((v_arrayElimCell_227 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_230 (_ BitVec 32))) (not (= (_ bv0 32) (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store .cse7 (bvadd v_arrayElimCell_227 (_ bv4 32)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1555))) (select .cse3 (select (select .cse3 .cse4) .cse5))) (bvadd v_arrayElimCell_230 (_ bv4 32)))))))) (and (or .cse0 .cse1) (or .cse0 .cse2))) .cse8) (or .cse9 (and (or (forall ((v_arrayElimCell_227 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse11 (bvadd v_arrayElimCell_227 (_ bv4 32)))) (select (let ((.cse10 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store .cse7 .cse11 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1555))) (select .cse10 (select (select .cse10 .cse4) .cse5))) .cse11)) (_ bv0 32)))) .cse2) (or .cse1 (forall ((v_arrayElimCell_227 (_ BitVec 32)) (v_arrayElimCell_229 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse12 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store .cse7 (bvadd v_arrayElimCell_227 (_ bv4 32)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1555))) (select .cse12 (select (select .cse12 .cse4) .cse5))) (bvadd v_arrayElimCell_229 (_ bv4 32))) (_ bv0 32))))))) (or .cse13 (= .cse14 .cse15)) (or .cse13 (= .cse4 .cse16)))))))) is different from false [2023-12-24 21:30:39,902 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse19 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse18 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (not (= (_ bv0 1) (select |c_#valid| .cse0)))) (.cse10 (= .cse0 (_ bv0 32))) (.cse3 (bvadd (_ bv4 32) .cse18)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (bvadd (_ bv4 32) .cse19))) (let ((.cse8 (and (or (and (forall ((v_ArrVal_1560 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1560))) (let ((.cse20 (select (select .cse21 .cse6) .cse7))) (or (not (= .cse0 .cse20)) (forall ((v_arrayElimCell_228 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_230 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse20 (store (select .cse21 .cse20) (bvadd v_arrayElimCell_228 (_ bv4 32)) .cse0)) .cse0 v_ArrVal_1555) (select v_ArrVal_1555 .cse3)) (bvadd v_arrayElimCell_230 (_ bv4 32)))))))))) (forall ((v_ArrVal_1560 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1560))) (let ((.cse22 (select (select .cse23 .cse6) .cse7))) (or (= .cse0 .cse22) (forall ((v_arrayElimCell_228 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_230 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse22 (store (select .cse23 .cse22) (bvadd v_arrayElimCell_228 (_ bv4 32)) .cse0)) .cse0 v_ArrVal_1555) (select v_ArrVal_1555 .cse3)) (bvadd v_arrayElimCell_230 (_ bv4 32))))))))))) .cse9 .cse10) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| (_ BitVec 32))) (or (= .cse0 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63|) (forall ((v_ArrVal_1560 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| v_ArrVal_1560))) (let ((.cse25 (select (select .cse26 .cse6) .cse7))) (or (forall ((v_arrayElimCell_227 (_ BitVec 32)) (v_arrayElimCell_228 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (let ((.cse24 (store (store |c_#memory_$Pointer$#1.base| .cse25 (store (select .cse26 .cse25) (bvadd v_arrayElimCell_228 (_ bv4 32)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| v_ArrVal_1555))) (select .cse24 (select (select .cse24 .cse0) .cse3))) (bvadd v_arrayElimCell_227 (_ bv4 32)))))) (= .cse0 .cse25))))) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63|))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| (_ BitVec 32))) (or (forall ((v_ArrVal_1560 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| v_ArrVal_1560))) (let ((.cse27 (select (select .cse29 .cse6) .cse7))) (or (not (= .cse0 .cse27)) (forall ((v_arrayElimCell_229 (_ BitVec 32)) (v_arrayElimCell_228 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse28 (store (store |c_#memory_$Pointer$#1.base| .cse27 (store (select .cse29 .cse27) (bvadd v_arrayElimCell_228 (_ bv4 32)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| v_ArrVal_1555))) (select .cse28 (select (select .cse28 .cse0) .cse3))) (bvadd v_arrayElimCell_229 (_ bv4 32))) (_ bv0 32)))))))) (= .cse0 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63|) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63|)))))))) (and (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| (_ BitVec 32))) (or (= .cse0 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63|) (forall ((v_ArrVal_1560 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| v_ArrVal_1560))) (let ((.cse1 (select (select .cse4 .cse6) .cse7))) (or (= .cse0 .cse1) (forall ((v_arrayElimCell_227 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse5 (bvadd v_arrayElimCell_227 (_ bv4 32)))) (select (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| .cse1 (store (select .cse4 .cse1) .cse5 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| v_ArrVal_1555))) (select .cse2 (select (select .cse2 .cse0) .cse3))) .cse5)) (_ bv0 32)))))))) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63|))))) (or (= .cse0 .cse6) .cse8) (or .cse9 .cse10 (and (forall ((v_ArrVal_1560 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1560))) (let ((.cse11 (select (select .cse12 .cse6) .cse7))) (or (= .cse0 .cse11) (forall ((v_arrayElimCell_227 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_230 (_ BitVec 32))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| .cse11 (store (select .cse12 .cse11) (bvadd v_arrayElimCell_227 (_ bv4 32)) .cse0)) .cse0 v_ArrVal_1555) (select v_ArrVal_1555 .cse3)) (bvadd v_arrayElimCell_230 (_ bv4 32))) (_ bv0 32)))))))) (forall ((v_ArrVal_1560 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1560))) (let ((.cse13 (select (select .cse14 .cse6) .cse7))) (or (not (= .cse0 .cse13)) (forall ((v_arrayElimCell_227 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_230 (_ BitVec 32))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| .cse13 (store (select .cse14 .cse13) (bvadd v_arrayElimCell_227 (_ bv4 32)) .cse0)) .cse0 v_ArrVal_1555) (select v_ArrVal_1555 .cse3)) (bvadd v_arrayElimCell_230 (_ bv4 32))) (_ bv0 32)))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| (_ BitVec 32))) (or (= .cse0 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63|) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| (_ bv0 32)) (forall ((v_ArrVal_1560 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| v_ArrVal_1560))) (let ((.cse15 (select (select .cse17 .cse6) .cse7))) (or (not (= .cse0 .cse15)) (forall ((v_arrayElimCell_227 (_ BitVec 32)) (v_arrayElimCell_229 (_ BitVec 32)) (v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (let ((.cse16 (store (store |c_#memory_$Pointer$#1.base| .cse15 (store (select .cse17 .cse15) (bvadd v_arrayElimCell_227 (_ bv4 32)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| v_ArrVal_1555))) (select .cse16 (select (select .cse16 .cse0) .cse3))) (bvadd v_arrayElimCell_229 (_ bv4 32)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63|))))) (or (= .cse18 .cse19) .cse8))))) is different from false [2023-12-24 21:30:41,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:30:41,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611662659] [2023-12-24 21:30:41,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611662659] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:30:41,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1404241460] [2023-12-24 21:30:41,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:30:41,272 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:30:41,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:30:41,272 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 21:30:41,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2023-12-24 21:30:41,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:30:41,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:30:41,651 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 73 conjunts are in the unsatisfiable core [2023-12-24 21:30:41,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:30:41,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:30:41,984 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:30:41,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:30:42,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:30:42,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:30:42,181 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:30:42,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2023-12-24 21:30:42,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-24 21:30:42,478 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 16 [2023-12-24 21:30:42,482 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-24 21:30:42,485 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 19 treesize of output 11 [2023-12-24 21:30:42,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:42,777 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 40 treesize of output 29 [2023-12-24 21:30:42,798 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:30:42,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-24 21:30:42,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-24 21:30:43,596 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-24 21:30:43,596 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 97 [2023-12-24 21:30:43,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:43,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 15 [2023-12-24 21:30:43,775 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 106 treesize of output 70 [2023-12-24 21:30:43,921 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-24 21:30:44,055 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-24 21:30:44,055 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 29 [2023-12-24 21:30:44,057 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:30:44,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:30:46,586 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1669 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (_ BitVec 32)) (v_ArrVal_1659 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (_ bv0 32)) (not (= (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_1669)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (let ((.cse3 (select (select .cse5 .cse6) .cse7)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (let ((.cse0 (let ((.cse4 (store (select .cse5 .cse3) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_1670) .cse6) .cse7)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|))) (store (store |c_#memory_$Pointer$#1.base| .cse3 .cse4) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select (store .cse5 .cse3 .cse4) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (_ bv8 32) .cse3))))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1661) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_1659) .cse1) .cse2))))) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|))))) is different from false [2023-12-24 21:30:46,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1404241460] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:30:46,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:30:46,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 47 [2023-12-24 21:30:46,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726782050] [2023-12-24 21:30:46,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:30:46,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-12-24 21:30:46,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:30:46,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-12-24 21:30:46,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2677, Unknown=19, NotChecked=654, Total=3540 [2023-12-24 21:30:46,598 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 47 states, 40 states have (on average 1.475) internal successors, (59), 38 states have internal predecessors, (59), 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-24 21:30:51,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:30:51,282 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2023-12-24 21:30:51,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-24 21:30:51,283 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 40 states have (on average 1.475) internal successors, (59), 38 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2023-12-24 21:30:51,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:30:51,283 INFO L225 Difference]: With dead ends: 61 [2023-12-24 21:30:51,283 INFO L226 Difference]: Without dead ends: 58 [2023-12-24 21:30:51,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=328, Invalid=4233, Unknown=19, NotChecked=822, Total=5402 [2023-12-24 21:30:51,285 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 71 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:30:51,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 367 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-24 21:30:51,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-24 21:30:51,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2023-12-24 21:30:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 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-24 21:30:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2023-12-24 21:30:51,298 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 38 [2023-12-24 21:30:51,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:30:51,298 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2023-12-24 21:30:51,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 40 states have (on average 1.475) internal successors, (59), 38 states have internal predecessors, (59), 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-24 21:30:51,298 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2023-12-24 21:30:51,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-24 21:30:51,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:30:51,298 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:30:51,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2023-12-24 21:30:51,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-24 21:30:51,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:30:51,702 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:30:51,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:30:51,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1361648050, now seen corresponding path program 2 times [2023-12-24 21:30:51,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:30:51,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609057216] [2023-12-24 21:30:51,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:30:51,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:30:51,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:30:51,704 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:30:51,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-24 21:30:52,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:30:52,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:30:52,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 83 conjunts are in the unsatisfiable core [2023-12-24 21:30:52,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:30:52,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:30:52,215 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:30:52,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:30:52,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:30:52,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:30:52,312 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:30:52,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2023-12-24 21:30:52,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-24 21:30:52,506 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 16 [2023-12-24 21:30:52,510 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 19 treesize of output 11 [2023-12-24 21:30:52,514 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-24 21:30:52,606 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-24 21:30:52,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:52,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2023-12-24 21:30:52,694 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:30:52,695 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 32 treesize of output 34 [2023-12-24 21:30:52,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-24 21:30:53,422 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-12-24 21:30:53,422 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 79 [2023-12-24 21:30:53,461 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2023-12-24 21:30:53,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 241 treesize of output 126 [2023-12-24 21:30:53,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:53,467 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 82 treesize of output 55 [2023-12-24 21:30:53,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 [2023-12-24 21:30:53,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:53,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2023-12-24 21:30:53,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:53,492 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 59 treesize of output 33 [2023-12-24 21:30:53,593 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 97 treesize of output 65 [2023-12-24 21:30:53,858 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-24 21:30:53,858 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-24 21:30:53,863 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-24 21:30:53,956 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:30:53,956 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:30:54,291 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1771 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1777 (_ BitVec 32)) (v_ArrVal_1776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1771)) (.cse1 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1776)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 .cse5) .cse6)))) (select (select (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1774))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) v_ArrVal_1777))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2023-12-24 21:30:54,536 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1771 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1777 (_ BitVec 32)) (v_ArrVal_1776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse9)) (.cse8 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse9)))) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| .cse1 (store (select |c_#memory_$Pointer$#1.offset| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1771)) (.cse2 (store (store |c_#memory_$Pointer$#1.base| .cse1 (store (select |c_#memory_$Pointer$#1.base| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1776)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (bvadd (select (select .cse5 .cse6) .cse7) (_ bv4 32)))) (select (select (let ((.cse0 (store |c_#memory_int#1| .cse1 v_ArrVal_1774))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) v_ArrVal_1777))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2023-12-24 21:30:54,731 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1771 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1777 (_ BitVec 32)) (v_ArrVal_1776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse10 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse9) .cse10)) (.cse8 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| .cse9) .cse10)))) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| .cse1 (store (select |c_#memory_$Pointer$#1.offset| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1771)) (.cse2 (store (store |c_#memory_$Pointer$#1.base| .cse1 (store (select |c_#memory_$Pointer$#1.base| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1776)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 .cse6) .cse7)))) (select (select (let ((.cse0 (store |c_#memory_int#1| .cse1 v_ArrVal_1774))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) v_ArrVal_1777))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2023-12-24 21:30:54,834 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1771 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1777 (_ BitVec 32)) (v_ArrVal_1776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse10 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse9) .cse10)) (.cse8 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| .cse9) .cse10)))) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| .cse1 (store (select |c_#memory_$Pointer$#1.offset| .cse1) .cse8 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1771)) (.cse2 (store (store |c_#memory_$Pointer$#1.base| .cse1 (store (select |c_#memory_$Pointer$#1.base| .cse1) .cse8 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1776)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 .cse6) .cse7)))) (select (select (let ((.cse0 (store |c_#memory_int#1| .cse1 v_ArrVal_1774))) (store .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|) v_ArrVal_1777))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2023-12-24 21:30:55,214 INFO L349 Elim1Store]: treesize reduction 955, result has 50.3 percent of original size [2023-12-24 21:30:55,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2737 treesize of output 3213 [2023-12-24 21:30:55,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:55,328 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 3747 treesize of output 3747 [2023-12-24 21:30:55,375 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 3737 treesize of output 3026 [2023-12-24 21:30:56,413 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 240 treesize of output 3 [2023-12-24 21:30:58,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:58,606 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 1225 treesize of output 1229 [2023-12-24 21:31:19,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:31:19,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609057216] [2023-12-24 21:31:19,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609057216] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:31:19,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [86618999] [2023-12-24 21:31:19,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:31:19,633 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:31:19,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:31:19,634 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 21:31:19,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-12-24 21:31:20,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:31:20,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:31:20,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 90 conjunts are in the unsatisfiable core [2023-12-24 21:31:20,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:31:20,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:31:23,107 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:31:23,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:31:23,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:31:23,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:31:24,609 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:31:24,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2023-12-24 21:31:24,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-24 21:31:25,899 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 16 [2023-12-24 21:31:25,904 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-24 21:31:25,907 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 19 treesize of output 11 [2023-12-24 21:31:27,395 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-24 21:31:32,194 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-24 21:31:32,194 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-24 21:31:32,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:31:32,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2023-12-24 21:31:32,237 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:31:32,237 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 32 treesize of output 34 [2023-12-24 21:31:36,971 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-24 21:31:36,971 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 351 treesize of output 147 [2023-12-24 21:31:36,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:31:36,983 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 95 treesize of output 49 [2023-12-24 21:31:37,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:31:37,023 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 82 treesize of output 55 [2023-12-24 21:31:37,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 [2023-12-24 21:31:37,641 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 143 treesize of output 99 [2023-12-24 21:31:39,883 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-24 21:31:39,883 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 53 [2023-12-24 21:31:39,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-24 21:31:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:31:40,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:31:43,287 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1893 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) (.cse11 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse5 (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse11 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)))) (store .cse12 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))) (.cse3 (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse11 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)))) (store .cse10 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_append_~last~0#1.base|)))) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1892))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1893)) (.cse1 (select (select .cse3 .cse8) .cse9)) (.cse2 (select (select .cse5 .cse8) .cse9))) (or (not (= (select (select .cse0 .cse1) .cse2) |c_ULTIMATE.start_main_~data~0#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (bvadd (_ bv4 32) .cse2))) (select (select .cse0 (select (select .cse3 .cse1) .cse4)) (select (select .cse5 .cse1) .cse4)))) (not (= (store (select .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse7 (select v_ArrVal_1893 .cse7)) v_ArrVal_1893))))))) is different from false [2023-12-24 21:31:43,915 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1893 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse15))) (let ((.cse7 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse15)) (.cse12 (bvadd (_ bv4 32) .cse14))) (let ((.cse5 (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| .cse10 (store (select |c_#memory_$Pointer$#1.offset| .cse10) .cse12 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)))) (store .cse13 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse7 .cse14)))) (.cse3 (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse10 (store (select |c_#memory_$Pointer$#1.base| .cse10) .cse12 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)))) (store .cse11 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse7 .cse10)))) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse6 (store |c_#memory_int#1| .cse10 v_ArrVal_1892))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1893)) (.cse1 (select (select .cse3 .cse8) .cse9)) (.cse2 (select (select .cse5 .cse8) .cse9))) (or (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse1) .cse2))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (bvadd (_ bv4 32) .cse2))) (select (select .cse0 (select (select .cse3 .cse1) .cse4)) (select (select .cse5 .cse1) .cse4)))) (not (= (store (select .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse7 (select v_ArrVal_1893 .cse7)) v_ArrVal_1893))))))))) is different from false [2023-12-24 21:32:08,412 INFO L349 Elim1Store]: treesize reduction 4073, result has 40.2 percent of original size [2023-12-24 21:32:08,413 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 14297 treesize of output 14661 [2023-12-24 21:32:08,705 INFO L224 Elim1Store]: Index analysis took 132 ms [2023-12-24 21:32:09,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:32:09,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 8491 treesize of output 9173 [2023-12-24 21:32:09,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:32:09,943 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 10546 treesize of output 9198 [2023-12-24 21:32:13,700 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 507 treesize of output 3 [2023-12-24 21:32:16,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:32:16,130 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 2272 treesize of output 2276 [2023-12-24 21:32:29,707 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 176 treesize of output 4 [2023-12-24 21:35:21,256 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-24 21:35:21,260 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-24 21:35:21,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2023-12-24 21:35:21,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-24 21:35:21,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2023-12-24 21:35:21,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 21:35:21,661 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:364) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:230) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 62 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 80 more [2023-12-24 21:35:21,664 INFO L158 Benchmark]: Toolchain (without parser) took 377453.51ms. Allocated memory is still 288.4MB. Free memory was 242.3MB in the beginning and 99.0MB in the end (delta: 143.3MB). Peak memory consumption was 174.2MB. Max. memory is 8.0GB. [2023-12-24 21:35:21,664 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 21:35:21,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.28ms. Allocated memory is still 288.4MB. Free memory was 242.0MB in the beginning and 222.8MB in the end (delta: 19.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-24 21:35:21,664 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.28ms. Allocated memory is still 288.4MB. Free memory was 222.8MB in the beginning and 220.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 21:35:21,665 INFO L158 Benchmark]: Boogie Preprocessor took 39.19ms. Allocated memory is still 288.4MB. Free memory was 220.3MB in the beginning and 217.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 21:35:21,665 INFO L158 Benchmark]: RCFGBuilder took 461.35ms. Allocated memory is still 288.4MB. Free memory was 217.1MB in the beginning and 196.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-24 21:35:21,665 INFO L158 Benchmark]: TraceAbstraction took 376610.29ms. Allocated memory is still 288.4MB. Free memory was 195.1MB in the beginning and 99.0MB in the end (delta: 96.1MB). Peak memory consumption was 127.0MB. Max. memory is 8.0GB. [2023-12-24 21:35:21,665 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.09ms. Allocated memory is still 190.8MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 302.28ms. Allocated memory is still 288.4MB. Free memory was 242.0MB in the beginning and 222.8MB in the end (delta: 19.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.28ms. Allocated memory is still 288.4MB. Free memory was 222.8MB in the beginning and 220.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.19ms. Allocated memory is still 288.4MB. Free memory was 220.3MB in the beginning and 217.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 461.35ms. Allocated memory is still 288.4MB. Free memory was 217.1MB in the beginning and 196.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 376610.29ms. Allocated memory is still 288.4MB. Free memory was 195.1MB in the beginning and 99.0MB in the end (delta: 96.1MB). Peak memory consumption was 127.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...