/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/sll2c_prepend_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:38:08,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:38:08,214 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:38:08,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:38:08,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:38:08,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:38:08,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:38:08,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:38:08,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:38:08,258 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:38:08,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:38:08,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:38:08,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:38:08,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:38:08,259 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:38:08,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:38:08,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:38:08,260 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:38:08,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:38:08,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:38:08,260 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:38:08,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:38:08,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:38:08,262 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:38:08,262 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:38:08,263 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:38:08,263 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:38:08,263 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:38:08,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:38:08,263 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:38:08,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:38:08,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:38:08,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:38:08,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:38:08,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:38:08,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:38:08,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:38:08,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:38:08,265 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:38:08,265 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:38:08,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:38:08,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:38:08,265 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:38:08,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:38:08,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:38:08,266 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:38:08,266 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:38:08,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:38:08,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:38:08,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:38:08,486 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:38:08,486 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:38:08,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_prepend_equal.i [2023-12-24 21:38:09,510 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:38:09,740 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:38:09,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_prepend_equal.i [2023-12-24 21:38:09,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3afa42d50/c415cdbd1e1445af9228be7cad9f60f4/FLAGb9ab30125 [2023-12-24 21:38:09,775 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3afa42d50/c415cdbd1e1445af9228be7cad9f60f4 [2023-12-24 21:38:09,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:38:09,778 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:38:09,780 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:38:09,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:38:09,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:38:09,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:38:09" (1/1) ... [2023-12-24 21:38:09,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c59c6f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:09, skipping insertion in model container [2023-12-24 21:38:09,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:38:09" (1/1) ... [2023-12-24 21:38:09,819 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:38:10,010 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/sll2c_prepend_equal.i[24458,24471] [2023-12-24 21:38:10,012 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:38:10,022 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:38:10,073 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/sll2c_prepend_equal.i[24458,24471] [2023-12-24 21:38:10,073 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:38:10,097 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:38:10,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:10 WrapperNode [2023-12-24 21:38:10,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:38:10,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:38:10,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:38:10,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:38:10,104 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:38:10" (1/1) ... [2023-12-24 21:38:10,120 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:38:10" (1/1) ... [2023-12-24 21:38:10,136 INFO L138 Inliner]: procedures = 130, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2023-12-24 21:38:10,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:38:10,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:38:10,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:38:10,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:38:10,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:10" (1/1) ... [2023-12-24 21:38:10,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:10" (1/1) ... [2023-12-24 21:38:10,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:10" (1/1) ... [2023-12-24 21:38:10,166 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 13, 10]. 52 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, 7, 2]. [2023-12-24 21:38:10,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:10" (1/1) ... [2023-12-24 21:38:10,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:10" (1/1) ... [2023-12-24 21:38:10,185 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:10" (1/1) ... [2023-12-24 21:38:10,188 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:10" (1/1) ... [2023-12-24 21:38:10,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:10" (1/1) ... [2023-12-24 21:38:10,190 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:10" (1/1) ... [2023-12-24 21:38:10,193 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:38:10,194 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:38:10,194 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:38:10,194 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:38:10,195 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:10" (1/1) ... [2023-12-24 21:38:10,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:38:10,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:38:10,241 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:38:10,269 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:38:10,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 21:38:10,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 21:38:10,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 21:38:10,274 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-24 21:38:10,274 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-24 21:38:10,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 21:38:10,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:38:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-24 21:38:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 21:38:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 21:38:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-24 21:38:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 21:38:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 21:38:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-24 21:38:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 21:38:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 21:38:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 21:38:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 21:38:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-24 21:38:10,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-24 21:38:10,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-24 21:38:10,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:38:10,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:38:10,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 21:38:10,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:38:10,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:38:10,393 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:38:10,394 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:38:10,667 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:38:10,690 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:38:10,690 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-24 21:38:10,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:38:10 BoogieIcfgContainer [2023-12-24 21:38:10,690 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:38:10,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:38:10,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:38:10,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:38:10,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:38:09" (1/3) ... [2023-12-24 21:38:10,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d50aa83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:38:10, skipping insertion in model container [2023-12-24 21:38:10,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:10" (2/3) ... [2023-12-24 21:38:10,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d50aa83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:38:10, skipping insertion in model container [2023-12-24 21:38:10,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:38:10" (3/3) ... [2023-12-24 21:38:10,695 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2023-12-24 21:38:10,728 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:38:10,728 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 21:38:10,764 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:38:10,769 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;@2e43ea38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:38:10,769 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 21:38:10,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:38:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-24 21:38:10,777 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:10,777 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:10,777 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:10,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:10,781 INFO L85 PathProgramCache]: Analyzing trace with hash 383461057, now seen corresponding path program 1 times [2023-12-24 21:38:10,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:10,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394838218] [2023-12-24 21:38:10,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:38:10,789 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:38:10,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:10,791 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:38:10,804 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:38:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:38:10,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 21:38:10,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:38:11,007 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:38:11,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:11,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394838218] [2023-12-24 21:38:11,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394838218] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:38:11,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:38:11,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:38:11,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394496848] [2023-12-24 21:38:11,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:38:11,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 21:38:11,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:11,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 21:38:11,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:38:11,045 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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:38:11,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:11,089 INFO L93 Difference]: Finished difference Result 54 states and 78 transitions. [2023-12-24 21:38:11,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 21:38:11,091 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 18 [2023-12-24 21:38:11,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:11,095 INFO L225 Difference]: With dead ends: 54 [2023-12-24 21:38:11,096 INFO L226 Difference]: Without dead ends: 23 [2023-12-24 21:38:11,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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:38:11,100 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:11,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:38:11,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-24 21:38:11,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-24 21:38:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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:38:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-12-24 21:38:11,124 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 18 [2023-12-24 21:38:11,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:11,125 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-12-24 21:38:11,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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:38:11,126 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-12-24 21:38:11,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-24 21:38:11,126 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:11,126 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:11,131 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 (2)] Ended with exit code 0 [2023-12-24 21:38:11,330 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:38:11,331 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:11,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:11,332 INFO L85 PathProgramCache]: Analyzing trace with hash -391035257, now seen corresponding path program 1 times [2023-12-24 21:38:11,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:11,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507403976] [2023-12-24 21:38:11,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:38:11,333 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:38:11,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:11,336 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:38:11,337 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:38:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:38:11,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:38:11,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:38:11,545 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:38:11,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:11,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507403976] [2023-12-24 21:38:11,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507403976] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:38:11,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:38:11,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:38:11,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140309313] [2023-12-24 21:38:11,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:38:11,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:38:11,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:11,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:38:11,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:38:11,552 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:38:11,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:11,598 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2023-12-24 21:38:11,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:38:11,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 18 [2023-12-24 21:38:11,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:11,599 INFO L225 Difference]: With dead ends: 43 [2023-12-24 21:38:11,599 INFO L226 Difference]: Without dead ends: 26 [2023-12-24 21:38:11,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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:38:11,600 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:11,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:38:11,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-24 21:38:11,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-12-24 21:38:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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:38:11,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-12-24 21:38:11,605 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 18 [2023-12-24 21:38:11,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:11,606 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-12-24 21:38:11,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:38:11,606 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-12-24 21:38:11,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-24 21:38:11,612 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:11,612 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:11,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 (3)] Forceful destruction successful, exit code 0 [2023-12-24 21:38:11,817 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:38:11,817 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:11,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:11,818 INFO L85 PathProgramCache]: Analyzing trace with hash 620466046, now seen corresponding path program 1 times [2023-12-24 21:38:11,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:11,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656550463] [2023-12-24 21:38:11,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:38:11,819 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:38:11,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:11,820 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:38:11,821 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:38:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:38:11,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 21:38:11,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:12,105 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:38:12,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:38:12,116 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:38:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-24 21:38:12,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:12,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656550463] [2023-12-24 21:38:12,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656550463] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:38:12,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:38:12,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2023-12-24 21:38:12,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83270556] [2023-12-24 21:38:12,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:38:12,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 21:38:12,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:12,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 21:38:12,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-24 21:38:12,204 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:38:16,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 21:38:20,264 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:38:24,305 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:38:24,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:24,863 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2023-12-24 21:38:24,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 21:38:24,864 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2023-12-24 21:38:24,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:24,865 INFO L225 Difference]: With dead ends: 36 [2023-12-24 21:38:24,865 INFO L226 Difference]: Without dead ends: 29 [2023-12-24 21:38:24,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-12-24 21:38:24,866 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:24,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 158 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 3 Unknown, 0 Unchecked, 12.6s Time] [2023-12-24 21:38:24,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-24 21:38:24,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-12-24 21:38:24,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:38:24,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-12-24 21:38:24,870 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 24 [2023-12-24 21:38:24,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:24,870 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-12-24 21:38:24,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:38:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-12-24 21:38:24,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-24 21:38:24,871 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:24,871 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:24,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-24 21:38:25,075 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:38:25,076 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:25,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:25,076 INFO L85 PathProgramCache]: Analyzing trace with hash 724565085, now seen corresponding path program 1 times [2023-12-24 21:38:25,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:25,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387935677] [2023-12-24 21:38:25,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:38:25,077 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:38:25,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:25,078 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:38:25,081 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:38:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:38:25,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-24 21:38:25,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:25,283 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:38:25,399 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:38:25,399 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:38:25,438 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:38:25,541 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-12-24 21:38:25,542 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 72 treesize of output 59 [2023-12-24 21:38:25,604 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 40 treesize of output 16 [2023-12-24 21:38:25,612 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:38:25,664 WARN L876 $PredicateComparison]: unable to prove that (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:38:25,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:38:25,677 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 48 treesize of output 37 [2023-12-24 21:38:25,699 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2023-12-24 21:38:25,700 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 36 treesize of output 38 [2023-12-24 21:38:25,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2023-12-24 21:38:25,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-12-24 21:38:25,768 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:38:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-24 21:38:25,791 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:38:25,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:25,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387935677] [2023-12-24 21:38:25,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387935677] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:38:25,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1190774656] [2023-12-24 21:38:25,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:38:25,924 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:38:25,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:38:25,985 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 21:38:25,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-24 21:38:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:38:26,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-24 21:38:26,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:26,274 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:38:26,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-12-24 21:38:26,464 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:38:26,531 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-12-24 21:38:26,532 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 17 treesize of output 17 [2023-12-24 21:38:26,943 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 44 treesize of output 42 [2023-12-24 21:38:26,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 17 [2023-12-24 21:38:26,953 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:38:26,961 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:38:27,024 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:38:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:38:27,111 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:38:27,258 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 86 treesize of output 82 [2023-12-24 21:38:27,342 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse3 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (.cse5 (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_303 (_ BitVec 32)) (v_arrayElimCell_22 (_ BitVec 32))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_303)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_299) .cse3) (bvadd (_ bv4 32) v_arrayElimCell_22)) |c_ULTIMATE.start_main_~data~0#1|))) (.cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (or (not .cse0) (not .cse1) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_303 (_ BitVec 32))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_303)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_299) .cse3) .cse4) |c_ULTIMATE.start_main_~data~0#1|))) (or .cse5 .cse1) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_303 (_ BitVec 32))) (let ((.cse6 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_303)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_299) .cse3))) (or (= (select .cse6 .cse4) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_22 (_ BitVec 32))) (= (select .cse6 (bvadd (_ bv4 32) v_arrayElimCell_22)) |c_ULTIMATE.start_main_~data~0#1|))))) (or .cse5 .cse0)))) is different from false [2023-12-24 21:38:27,526 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse5 (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse6 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (.cse0 (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_303 (_ BitVec 32)) (v_arrayElimCell_22 (_ BitVec 32))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_303)) .cse5 v_ArrVal_299) .cse6) (bvadd (_ bv4 32) v_arrayElimCell_22)) |c_ULTIMATE.start_main_~data~0#1|))) (.cse7 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (and (or .cse0 .cse1) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_303 (_ BitVec 32))) (let ((.cse2 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_303)) .cse5 v_ArrVal_299) .cse6))) (or (forall ((v_arrayElimCell_22 (_ BitVec 32))) (= (select .cse2 (bvadd (_ bv4 32) v_arrayElimCell_22)) |c_ULTIMATE.start_main_~data~0#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 .cse3))))) (or (not .cse1) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_303 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_303)) .cse5 v_ArrVal_299) .cse6) .cse3))) (not .cse7)) (or .cse0 .cse7))))) is different from false [2023-12-24 21:38:27,607 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse3 (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse4 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) (.cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse7 (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_303 (_ BitVec 32)) (v_arrayElimCell_22 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_303)) .cse3 v_ArrVal_299) .cse4) (bvadd (_ bv4 32) v_arrayElimCell_22)))))) (and (or (not .cse0) (not .cse1) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_303 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_303)) .cse3 v_ArrVal_299) .cse4) .cse5)))) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_303 (_ BitVec 32))) (let ((.cse6 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_303)) .cse3 v_ArrVal_299) .cse4))) (or (forall ((v_arrayElimCell_22 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 (bvadd (_ bv4 32) v_arrayElimCell_22)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 .cse5))))) (or .cse0 .cse7) (or .cse1 .cse7))))) is different from false [2023-12-24 21:38:28,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:38:28,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 210 treesize of output 274 [2023-12-24 21:38:28,531 INFO L349 Elim1Store]: treesize reduction 107, result has 34.4 percent of original size [2023-12-24 21:38:28,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 538 treesize of output 540 [2023-12-24 21:38:28,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:38:28,576 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 296 treesize of output 298 [2023-12-24 21:38:28,598 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 285 treesize of output 277 [2023-12-24 21:38:28,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:38:28,645 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 618 treesize of output 580 [2023-12-24 21:38:28,661 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 532 treesize of output 528 [2023-12-24 21:38:28,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:38:28,691 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 535 treesize of output 535 [2023-12-24 21:38:28,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:38:28,732 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 522 treesize of output 519 [2023-12-24 21:38:28,752 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 510 treesize of output 508 [2023-12-24 21:38:28,957 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 6 treesize of output 4 [2023-12-24 21:38:28,978 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 6 treesize of output 4 [2023-12-24 21:38:29,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-24 21:38:30,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:38:30,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 186 treesize of output 376 [2023-12-24 21:38:45,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1190774656] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:38:45,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:38:45,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 30 [2023-12-24 21:38:45,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244005672] [2023-12-24 21:38:45,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:38:45,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-24 21:38:45,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:45,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-24 21:38:45,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1102, Unknown=10, NotChecked=276, Total=1482 [2023-12-24 21:38:45,252 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 30 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-24 21:38:52,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:52,075 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2023-12-24 21:38:52,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-24 21:38:52,076 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 27 [2023-12-24 21:38:52,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:52,077 INFO L225 Difference]: With dead ends: 61 [2023-12-24 21:38:52,077 INFO L226 Difference]: Without dead ends: 53 [2023-12-24 21:38:52,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=251, Invalid=2617, Unknown=10, NotChecked=428, Total=3306 [2023-12-24 21:38:52,079 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 66 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:52,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 366 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 629 Invalid, 0 Unknown, 61 Unchecked, 5.1s Time] [2023-12-24 21:38:52,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-24 21:38:52,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2023-12-24 21:38:52,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-24 21:38:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2023-12-24 21:38:52,086 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 27 [2023-12-24 21:38:52,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:52,087 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2023-12-24 21:38:52,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-24 21:38:52,087 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2023-12-24 21:38:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-24 21:38:52,087 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:52,087 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:52,093 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:38:52,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2023-12-24 21:38:52,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 21:38:52,495 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:52,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:52,495 INFO L85 PathProgramCache]: Analyzing trace with hash 80578008, now seen corresponding path program 1 times [2023-12-24 21:38:52,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:52,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660441863] [2023-12-24 21:38:52,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:38:52,496 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:38:52,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:52,497 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:38:52,520 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:38:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:38:52,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-24 21:38:52,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:52,723 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:38:52,954 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:38:52,954 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:38:53,050 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:38:53,133 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-12-24 21:38:53,134 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 72 treesize of output 59 [2023-12-24 21:38:53,215 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 40 treesize of output 16 [2023-12-24 21:38:53,225 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:38:53,315 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:38:53,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:38:53,406 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 48 treesize of output 37 [2023-12-24 21:38:53,440 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2023-12-24 21:38:53,440 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 36 treesize of output 38 [2023-12-24 21:38:54,039 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:38:54,055 INFO L349 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2023-12-24 21:38:54,055 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 1 case distinctions, treesize of input 52 treesize of output 19 [2023-12-24 21:38:54,344 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 59 treesize of output 26 [2023-12-24 21:38:54,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2023-12-24 21:38:54,353 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:38:54,362 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:38:54,454 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:38:54,596 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:38:54,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:38:54,763 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_385 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_382 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_382 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_382) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_385) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))))) is different from false [2023-12-24 21:38:55,097 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_385 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_382) (select (select |c_#memory_$Pointer$#1.base| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_385) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))))) (not (= v_ArrVal_382 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_382 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) is different from false [2023-12-24 21:38:55,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:38:55,686 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 266 treesize of output 270 [2023-12-24 21:38:55,694 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 238 treesize of output 206 [2023-12-24 21:38:55,743 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 19 treesize of output 3 [2023-12-24 21:38:55,797 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 138 treesize of output 122 [2023-12-24 21:38:59,975 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse2 (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_23| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_23|))))) (.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_23|))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_23|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_23|))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_23| (_ BitVec 32))) (or (forall ((v_ArrVal_389 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_23|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_23| v_ArrVal_389) (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_23|))))) (or .cse2 (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|)) (or .cse2 (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| (_ bv0 32))) |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:38:59,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:59,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660441863] [2023-12-24 21:38:59,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660441863] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:38:59,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1374952955] [2023-12-24 21:38:59,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:38:59,986 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:38:59,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:38:59,989 INFO L229 MonitoredProcess]: Starting monitored process 8 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:39:00,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-24 21:39:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:39:00,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-24 21:39:00,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:39:00,318 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:39:00,737 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:39:00,738 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:39:00,869 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:39:01,076 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-24 21:39:01,076 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 56 treesize of output 43 [2023-12-24 21:39:01,225 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:39:01,230 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:39:01,450 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:39:05,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:39:05,622 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:39:05,670 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:39:05,670 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:39:06,474 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:39:06,475 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:39:06,476 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 16 [2023-12-24 21:39:06,833 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 59 treesize of output 26 [2023-12-24 21:39:06,838 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:39:06,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2023-12-24 21:39:06,865 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-24 21:39:06,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-12-24 21:39:07,010 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:39:07,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:39:07,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:39:07,065 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_467 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_467 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_467) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_468) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))))) is different from false [2023-12-24 21:39:07,165 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_467 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_467 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_467) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_468) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2023-12-24 21:39:07,750 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_467) (select (select |c_#memory_$Pointer$#1.base| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_468) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= v_ArrVal_467 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_467 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)))))) is different from false [2023-12-24 21:39:07,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:39:07,994 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 522 treesize of output 512 [2023-12-24 21:39:08,015 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 103 treesize of output 71 [2023-12-24 21:39:08,078 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 19 treesize of output 3 [2023-12-24 21:39:08,103 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 138 treesize of output 122 [2023-12-24 21:40:03,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1374952955] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:40:03,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:40:03,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 39 [2023-12-24 21:40:03,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342134421] [2023-12-24 21:40:03,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:40:03,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-24 21:40:03,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:40:03,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-24 21:40:03,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1857, Unknown=62, NotChecked=558, Total=2652 [2023-12-24 21:40:03,355 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 39 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 states have internal predecessors, (41), 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:40:07,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 21:40:15,698 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:40:36,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:40:36,429 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2023-12-24 21:40:36,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-24 21:40:36,430 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 states have internal predecessors, (41), 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 29 [2023-12-24 21:40:36,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:40:36,430 INFO L225 Difference]: With dead ends: 64 [2023-12-24 21:40:36,431 INFO L226 Difference]: Without dead ends: 62 [2023-12-24 21:40:36,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 88.5s TimeCoverageRelationStatistics Valid=277, Invalid=2758, Unknown=69, NotChecked=678, Total=3782 [2023-12-24 21:40:36,432 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 67 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2023-12-24 21:40:36,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 231 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 645 Invalid, 2 Unknown, 0 Unchecked, 11.8s Time] [2023-12-24 21:40:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-24 21:40:36,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 45. [2023-12-24 21:40:36,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-24 21:40:36,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2023-12-24 21:40:36,442 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 29 [2023-12-24 21:40:36,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:40:36,442 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2023-12-24 21:40:36,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 states have internal predecessors, (41), 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:40:36,442 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2023-12-24 21:40:36,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-24 21:40:36,443 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:40:36,443 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:40:36,448 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 (7)] Ended with exit code 0 [2023-12-24 21:40:36,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2023-12-24 21:40:36,851 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 21:40:36,851 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:40:36,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:40:36,852 INFO L85 PathProgramCache]: Analyzing trace with hash 127932368, now seen corresponding path program 1 times [2023-12-24 21:40:36,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:40:36,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898020013] [2023-12-24 21:40:36,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:40:36,852 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:40:36,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:40:36,857 INFO L229 MonitoredProcess]: Starting monitored process 9 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:40:36,891 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 (9)] Waiting until timeout for monitored process [2023-12-24 21:40:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:40:37,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-24 21:40:37,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:40:37,054 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:40:37,292 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:40:37,292 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:40:37,358 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:40:37,470 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-12-24 21:40:37,470 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 72 treesize of output 59 [2023-12-24 21:40:37,556 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 40 treesize of output 16 [2023-12-24 21:40:37,562 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:40:37,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:40:37,733 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 48 treesize of output 37 [2023-12-24 21:40:37,786 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2023-12-24 21:40:37,787 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 36 treesize of output 38 [2023-12-24 21:40:38,364 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 97 treesize of output 59 [2023-12-24 21:40:38,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 76 [2023-12-24 21:40:38,414 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2023-12-24 21:40:38,414 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 133 treesize of output 90 [2023-12-24 21:40:38,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 57 [2023-12-24 21:40:38,530 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 84 treesize of output 64 [2023-12-24 21:40:38,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 79 treesize of output 47 [2023-12-24 21:40:38,721 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 21:40:38,721 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 44 treesize of output 19 [2023-12-24 21:40:38,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:40:38,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:40:40,903 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_553 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_31| (_ BitVec 32)) (v_ArrVal_546 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_31|) (_ bv0 1))) (not (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_31|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (select (let ((.cse0 (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_31| (store v_ArrVal_553 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse0)) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_31| v_ArrVal_553) .cse0) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_546)) .cse3) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3)))))) is different from false [2023-12-24 21:40:40,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:40:40,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898020013] [2023-12-24 21:40:40,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [898020013] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:40:40,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [681862670] [2023-12-24 21:40:40,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:40:40,909 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:40:40,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:40:40,910 INFO L229 MonitoredProcess]: Starting monitored process 10 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:40:40,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-24 21:40:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:40:41,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-24 21:40:41,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:40:41,294 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:40:41,816 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:40:41,816 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:40:41,978 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:40:42,201 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-24 21:40:42,201 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 56 treesize of output 43 [2023-12-24 21:40:42,357 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:40:42,363 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:40:42,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:40:42,860 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:40:42,899 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:40:42,899 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:40:44,098 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-24 21:40:44,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-12-24 21:40:44,116 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 77 treesize of output 51 [2023-12-24 21:40:44,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 56 [2023-12-24 21:40:44,176 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2023-12-24 21:40:44,176 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 93 treesize of output 62 [2023-12-24 21:40:44,454 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:40:44,454 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:40:44,747 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 63 treesize of output 39 [2023-12-24 21:40:44,765 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-24 21:40:44,765 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 36 treesize of output 19 [2023-12-24 21:40:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:40:44,771 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:40:47,749 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_35| (_ BitVec 32)) (v_ArrVal_634 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_35|) (_ bv0 1))) (not (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_35|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (select (let ((.cse0 (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_35| (store v_ArrVal_634 (_ bv0 32) .cse0)) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_35| v_ArrVal_634) .cse0) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_630)) .cse3) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3)))))) is different from false [2023-12-24 21:40:47,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [681862670] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:40:47,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:40:47,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 39 [2023-12-24 21:40:47,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777863396] [2023-12-24 21:40:47,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:40:47,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-24 21:40:47,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:40:47,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-24 21:40:47,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2098, Unknown=75, NotChecked=190, Total=2550 [2023-12-24 21:40:47,757 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 39 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 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:40:51,859 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:41:00,182 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:41:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:41:17,130 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2023-12-24 21:41:17,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-24 21:41:17,132 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 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 31 [2023-12-24 21:41:17,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:41:17,132 INFO L225 Difference]: With dead ends: 66 [2023-12-24 21:41:17,132 INFO L226 Difference]: Without dead ends: 63 [2023-12-24 21:41:17,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=289, Invalid=3062, Unknown=79, NotChecked=230, Total=3660 [2023-12-24 21:41:17,134 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 67 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2023-12-24 21:41:17,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 325 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 620 Invalid, 2 Unknown, 0 Unchecked, 11.8s Time] [2023-12-24 21:41:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-24 21:41:17,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2023-12-24 21:41:17,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-24 21:41:17,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2023-12-24 21:41:17,141 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 31 [2023-12-24 21:41:17,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:41:17,142 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2023-12-24 21:41:17,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 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:41:17,142 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2023-12-24 21:41:17,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-24 21:41:17,142 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:41:17,142 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:41:17,150 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 (9)] Forceful destruction successful, exit code 0 [2023-12-24 21:41:17,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2023-12-24 21:41:17,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 21:41:17,545 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:41:17,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:41:17,545 INFO L85 PathProgramCache]: Analyzing trace with hash -315712365, now seen corresponding path program 2 times [2023-12-24 21:41:17,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:41:17,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136574855] [2023-12-24 21:41:17,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:41:17,546 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:41:17,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:41:17,547 INFO L229 MonitoredProcess]: Starting monitored process 11 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:41:17,565 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 (11)] Waiting until timeout for monitored process [2023-12-24 21:41:17,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:41:17,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:41:17,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-24 21:41:17,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:41:17,788 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:41:18,076 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:41:18,076 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:41:18,169 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:41:18,180 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:41:18,321 INFO L349 Elim1Store]: treesize reduction 57, result has 16.2 percent of original size [2023-12-24 21:41:18,322 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 106 treesize of output 68 [2023-12-24 21:41:18,331 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 63 treesize of output 49 [2023-12-24 21:41:18,447 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-12-24 21:41:18,447 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 82 treesize of output 41 [2023-12-24 21:41:18,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 21:41:18,463 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:41:18,692 WARN L876 $PredicateComparison]: unable to prove that (and (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|))) (= (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#1.offset|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_9| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_9| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_9|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_9|) (_ bv0 32)))) is different from true [2023-12-24 21:41:18,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:41:18,748 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-24 21:41:18,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 73 [2023-12-24 21:41:18,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:41:18,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:41:18,768 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 51 [2023-12-24 21:41:18,811 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:41:18,812 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:41:19,312 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 57 [2023-12-24 21:41:19,320 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-24 21:41:19,321 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 54 treesize of output 25 [2023-12-24 21:41:19,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:41:19,404 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-24 21:41:19,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:41:20,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:41:20,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136574855] [2023-12-24 21:41:20,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136574855] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:41:20,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [220201013] [2023-12-24 21:41:20,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:41:20,682 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:41:20,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:41:20,684 INFO L229 MonitoredProcess]: Starting monitored process 12 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:41:20,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2023-12-24 21:41:20,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:41:20,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:41:20,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 86 conjunts are in the unsatisfiable core [2023-12-24 21:41:21,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:41:21,088 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:41:21,610 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:41:21,611 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:41:21,758 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:41:21,805 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:41:22,052 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-24 21:41:22,053 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 99 treesize of output 53 [2023-12-24 21:41:22,083 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 36 treesize of output 15 [2023-12-24 21:41:22,267 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 21:41:22,267 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 63 treesize of output 30 [2023-12-24 21:41:22,278 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:41:22,284 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:41:22,527 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:41:22,801 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-24 21:41:22,801 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:41:22,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:41:22,843 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-12-24 21:41:22,843 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 2 case distinctions, treesize of input 81 treesize of output 55 [2023-12-24 21:41:22,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:41:22,873 INFO L349 Elim1Store]: treesize reduction 6, result has 66.7 percent of original size [2023-12-24 21:41:22,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 26 [2023-12-24 21:41:24,109 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:41:24,109 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:41:24,110 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2023-12-24 21:41:24,721 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:41:24,780 INFO L349 Elim1Store]: treesize reduction 98, result has 13.3 percent of original size [2023-12-24 21:41:24,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 50 [2023-12-24 21:41:25,125 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 67 treesize of output 26 [2023-12-24 21:41:25,131 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:41:25,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2023-12-24 21:41:25,172 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-24 21:41:25,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-12-24 21:41:25,361 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:41:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:41:25,616 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:41:26,091 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_797 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_797 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_797) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_801) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))))) is different from false [2023-12-24 21:41:26,198 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_797 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_797 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_797) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_801) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2023-12-24 21:41:26,285 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_797) (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) v_ArrVal_801) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_797 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_797 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) is different from false [2023-12-24 21:41:26,372 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_797) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1))) v_ArrVal_801) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))))) (not (= v_ArrVal_797 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_797 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) is different from false [2023-12-24 21:41:26,430 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_797 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_797 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_797) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1))) v_ArrVal_801) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.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:41:26,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:41:26,914 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 750 treesize of output 740 [2023-12-24 21:41:26,984 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 141 treesize of output 109 [2023-12-24 21:41:27,150 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 359 treesize of output 311 [2023-12-24 21:41:38,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [220201013] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:41:38,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:41:38,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 38 [2023-12-24 21:41:38,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964551375] [2023-12-24 21:41:38,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:41:38,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-24 21:41:38,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:41:38,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-24 21:41:38,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1929, Unknown=21, NotChecked=558, Total=2652 [2023-12-24 21:41:38,806 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 38 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 30 states have internal predecessors, (47), 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:41:46,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:41:46,602 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2023-12-24 21:41:46,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-24 21:41:46,603 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 30 states have internal predecessors, (47), 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 31 [2023-12-24 21:41:46,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:41:46,604 INFO L225 Difference]: With dead ends: 69 [2023-12-24 21:41:46,604 INFO L226 Difference]: Without dead ends: 59 [2023-12-24 21:41:46,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=274, Invalid=3035, Unknown=21, NotChecked=702, Total=4032 [2023-12-24 21:41:46,606 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 52 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:41:46,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 219 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 589 Invalid, 0 Unknown, 57 Unchecked, 5.2s Time] [2023-12-24 21:41:46,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-24 21:41:46,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2023-12-24 21:41:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-24 21:41:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2023-12-24 21:41:46,615 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 31 [2023-12-24 21:41:46,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:41:46,615 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2023-12-24 21:41:46,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 30 states have internal predecessors, (47), 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:41:46,615 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2023-12-24 21:41:46,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-24 21:41:46,616 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:41:46,616 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:41:46,624 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 (11)] Ended with exit code 0 [2023-12-24 21:41:46,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2023-12-24 21:41:47,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 21:41:47,025 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:41:47,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:41:47,026 INFO L85 PathProgramCache]: Analyzing trace with hash -329022723, now seen corresponding path program 1 times [2023-12-24 21:41:47,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:41:47,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603270267] [2023-12-24 21:41:47,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:41:47,026 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:41:47,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:41:47,027 INFO L229 MonitoredProcess]: Starting monitored process 13 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:41:47,031 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 (13)] Waiting until timeout for monitored process [2023-12-24 21:41:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:41:47,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 95 conjunts are in the unsatisfiable core [2023-12-24 21:41:47,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:41:47,272 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:41:47,496 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:41:47,590 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:41:47,590 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:41:47,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-24 21:41:47,715 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:41:47,730 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:41:47,915 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-24 21:41:47,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 67 [2023-12-24 21:41:47,929 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 36 treesize of output 15 [2023-12-24 21:41:47,948 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 36 treesize of output 15 [2023-12-24 21:41:48,094 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:41:48,103 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:41:48,112 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:41:48,118 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:41:48,518 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-24 21:41:48,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-12-24 21:41:48,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:41:48,541 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:41:48,590 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:41:48,590 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:41:48,616 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:41:50,153 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 49 treesize of output 15 [2023-12-24 21:41:50,162 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 71 treesize of output 41 [2023-12-24 21:41:50,205 INFO L349 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2023-12-24 21:41:50,205 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 119 treesize of output 64 [2023-12-24 21:41:50,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 80 [2023-12-24 21:41:50,272 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-12-24 21:41:50,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-12-24 21:41:50,864 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 137 treesize of output 93 [2023-12-24 21:41:50,898 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-12-24 21:41:50,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 46 [2023-12-24 21:41:50,918 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:41:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:41:51,236 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:42:06,056 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_893 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_906 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_907 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_46| (_ BitVec 32))) (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse4 (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (select .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_46| v_ArrVal_907) .cse4) .cse8))) (let ((.cse0 (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_46| v_ArrVal_893) .cse2 v_ArrVal_895)) (.cse5 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_46|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_46|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_46| v_ArrVal_906) .cse4) .cse8))) (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_46| (store v_ArrVal_907 (_ bv0 32) .cse4)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_46|))) .cse5) .cse6)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_46| (store v_ArrVal_906 (_ bv0 32) .cse8)))) (store .cse7 .cse2 (store (select .cse7 .cse2) .cse3 (_ bv0 32)))) .cse5) .cse6))))) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse5) (bvadd (_ bv4 32) .cse6)))))))))) is different from false [2023-12-24 21:42:06,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:42:06,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603270267] [2023-12-24 21:42:06,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603270267] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:42:06,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1180214366] [2023-12-24 21:42:06,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:42:06,138 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:42:06,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:42:06,139 INFO L229 MonitoredProcess]: Starting monitored process 14 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:42:06,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-12-24 21:42:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:42:06,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 82 conjunts are in the unsatisfiable core [2023-12-24 21:42:06,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:42:06,927 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:42:08,812 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:42:08,885 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:42:08,885 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:42:09,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-24 21:42:09,435 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:42:10,005 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-24 21:42:10,006 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 80 treesize of output 55 [2023-12-24 21:42:10,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2023-12-24 21:42:10,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:42:10,512 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:42:10,518 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:42:15,996 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-24 21:42:15,996 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:42:16,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:42:16,025 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:42:16,070 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:42:16,070 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:42:17,912 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-24 21:42:17,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-12-24 21:42:17,934 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 49 treesize of output 15 [2023-12-24 21:42:17,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 100 [2023-12-24 21:42:17,972 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-12-24 21:42:17,977 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 69 treesize of output 47 [2023-12-24 21:42:18,032 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2023-12-24 21:42:18,033 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 140 treesize of output 83 [2023-12-24 21:42:18,062 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 44 treesize of output 15 [2023-12-24 21:42:18,654 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 78 treesize of output 50 [2023-12-24 21:42:19,335 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-24 21:42:19,335 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 47 treesize of output 26 [2023-12-24 21:42:19,341 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:42:19,783 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:42:19,783 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:42:20,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:42:20,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 102 [2023-12-24 21:42:20,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:42:20,895 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 204 treesize of output 207 [2023-12-24 21:42:20,937 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 88 treesize of output 74 [2023-12-24 21:42:50,492 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse8 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse1 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (= .cse4 .cse1)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (.cse6 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (and (or .cse7 (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_239 (_ BitVec 32)) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_988) .cse4 v_ArrVal_991) (select (select (store .cse5 .cse4 v_ArrVal_992) .cse1) .cse6)) (bvadd v_arrayElimCell_239 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|))) (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_239 (_ BitVec 32)) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_241 (_ BitVec 32)) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_988) .cse4 v_ArrVal_991) (select (select (store .cse5 .cse4 v_ArrVal_992) .cse1) .cse6)))) (or (= (select .cse9 (bvadd v_arrayElimCell_241 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse9 (bvadd v_arrayElimCell_239 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse3 (bvadd (_ bv4 32) (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (and (or .cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_241 (_ BitVec 32)) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_988) .cse4 v_ArrVal_991) (select (select (store .cse5 .cse4 v_ArrVal_992) .cse1) .cse6)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 .cse3)) (= (select .cse2 (bvadd v_arrayElimCell_241 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))) (or .cse0 (= .cse6 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (or .cse7 (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_988) .cse4 v_ArrVal_991) (select (select (store .cse5 .cse4 v_ArrVal_992) .cse1) .cse6)) .cse3)))) (or (not .cse7) (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_241 (_ BitVec 32)) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_988) .cse4 v_ArrVal_991) (select (select (store .cse5 .cse4 v_ArrVal_992) .cse1) .cse6)) (bvadd v_arrayElimCell_241 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)))))))) is different from false [2023-12-24 21:42:51,271 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse12 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse11) .cse8)) (.cse3 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= .cse1 .cse3)) (.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse11))) (.cse4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (and (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_239 (_ BitVec 32)) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_241 (_ BitVec 32)) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_988) .cse1 v_ArrVal_991) (select (select (store .cse2 .cse1 v_ArrVal_992) .cse3) .cse4)))) (or (= (select .cse9 (bvadd v_arrayElimCell_241 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 (bvadd v_arrayElimCell_239 (_ bv4 32))))))) (or .cse0 (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_239 (_ BitVec 32)) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_988) .cse1 v_ArrVal_991) (select (select (store .cse2 .cse1 v_ArrVal_992) .cse3) .cse4)) (bvadd v_arrayElimCell_239 (_ bv4 32)))))))) (.cse5 (bvadd (_ bv4 32) .cse8))) (and (or .cse0 (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_988) .cse1 v_ArrVal_991) (select (select (store .cse2 .cse1 v_ArrVal_992) .cse3) .cse4)) .cse5)))) (or (= .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) .cse6) (or (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_241 (_ BitVec 32)) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_988) .cse1 v_ArrVal_991) (select (select (store .cse2 .cse1 v_ArrVal_992) .cse3) .cse4)) (bvadd v_arrayElimCell_241 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)) (not .cse0)) (or .cse6 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse3)) (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_241 (_ BitVec 32)) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_988) .cse1 v_ArrVal_991) (select (select (store .cse2 .cse1 v_ArrVal_992) .cse3) .cse4)))) (or (= (select .cse7 (bvadd v_arrayElimCell_241 (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 .cse5))))))))))) is different from false [2023-12-24 21:42:51,718 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse12 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse9 (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse11) .cse9)) (.cse2 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (= .cse0 .cse2)) (.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse11))) (.cse3 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (bvadd (_ bv4 32) .cse9)) (.cse5 (and (or (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_239 (_ BitVec 32)) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_988) .cse0 v_ArrVal_991) (select (select (store .cse1 .cse0 v_ArrVal_992) .cse2) .cse3)) (bvadd v_arrayElimCell_239 (_ bv4 32))))) .cse4) (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_239 (_ BitVec 32)) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_241 (_ BitVec 32)) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_988) .cse0 v_ArrVal_991) (select (select (store .cse1 .cse0 v_ArrVal_992) .cse2) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 (bvadd v_arrayElimCell_239 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 (bvadd v_arrayElimCell_241 (_ bv4 32)))))))))) (and (or (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_241 (_ BitVec 32)) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_988) .cse0 v_ArrVal_991) (select (select (store .cse1 .cse0 v_ArrVal_992) .cse2) .cse3)) (bvadd v_arrayElimCell_241 (_ bv4 32))))) (not .cse4)) (or (= .cse2 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse5) (or (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_988) .cse0 v_ArrVal_991) (select (select (store .cse1 .cse0 v_ArrVal_992) .cse2) .cse3)) .cse6) |c_ULTIMATE.start_main_~data~0#1|)) .cse4) (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_241 (_ BitVec 32)) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_988) .cse0 v_ArrVal_991) (select (select (store .cse1 .cse0 v_ArrVal_992) .cse2) .cse3)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 (bvadd v_arrayElimCell_241 (_ bv4 32)))) (= (select .cse7 .cse6) |c_ULTIMATE.start_main_~data~0#1|)))) (or (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse3) .cse5))))))) is different from false [2023-12-24 21:42:52,951 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse5 (select .cse20 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse11 (bvadd (_ bv4 32) .cse5)) (.cse4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse20 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse0 |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1002 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_239 (_ BitVec 32)) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_241 (_ BitVec 32)) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_ArrVal_1002) .cse3) .cse5))) (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_ArrVal_988) .cse2 v_ArrVal_991) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store v_ArrVal_1002 (_ bv0 32) .cse3)) .cse2 v_ArrVal_992) .cse0) .cse4))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 (bvadd v_arrayElimCell_239 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 (bvadd v_arrayElimCell_241 (_ bv4 32))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (_ BitVec 32))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse7 |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (forall ((v_ArrVal_1002 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_ArrVal_1002) .cse3) .cse5))) (or (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_239 (_ BitVec 32)) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_ArrVal_988) .cse8 v_ArrVal_991) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store v_ArrVal_1002 (_ bv0 32) .cse3)) .cse8 v_ArrVal_992) .cse7) .cse4)) (bvadd v_arrayElimCell_239 (_ bv4 32))))) (= .cse7 .cse8))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (forall ((v_ArrVal_1002 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_ArrVal_1002) .cse3) .cse5))) (or (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_ArrVal_988) .cse9 v_ArrVal_991) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store v_ArrVal_1002 (_ bv0 32) .cse3)) .cse9 v_ArrVal_992) .cse10) .cse4)) .cse11) |c_ULTIMATE.start_main_~data~0#1|)) (= .cse10 .cse9)))))) (or (and (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))) (forall ((v_ArrVal_1002 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_ArrVal_1002) .cse3) .cse5))) (or (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_239 (_ BitVec 32)) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_ArrVal_988) .cse12 v_ArrVal_991) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store v_ArrVal_1002 (_ bv0 32) .cse3)) .cse12 v_ArrVal_992) .cse13) .cse4)) (bvadd v_arrayElimCell_239 (_ bv4 32))))) (= .cse13 .cse12)))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (_ BitVec 32))) (or (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1002 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_239 (_ BitVec 32)) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_241 (_ BitVec 32)) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (let ((.cse15 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_ArrVal_1002) .cse3) .cse5))) (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_ArrVal_988) .cse15 v_ArrVal_991) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store v_ArrVal_1002 (_ bv0 32) .cse3)) .cse15 v_ArrVal_992) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 (bvadd v_arrayElimCell_239 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 (bvadd v_arrayElimCell_241 (_ bv4 32))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)))))) (= .cse4 (_ bv0 32))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (_ BitVec 32))) (or (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_241 (_ BitVec 32)) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (let ((.cse17 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_ArrVal_1002) .cse3) .cse5))) (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_ArrVal_988) .cse17 v_ArrVal_991) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store v_ArrVal_1002 (_ bv0 32) .cse3)) .cse17 v_ArrVal_992) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 (bvadd v_arrayElimCell_241 (_ bv4 32)))) (= (select .cse16 .cse11) |c_ULTIMATE.start_main_~data~0#1|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (_ BitVec 32))) (or (forall ((v_ArrVal_1002 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_ArrVal_1002) .cse3) .cse5))) (or (forall ((v_ArrVal_992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_241 (_ BitVec 32)) (v_ArrVal_988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| v_ArrVal_988) .cse18 v_ArrVal_991) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50| (store v_ArrVal_1002 (_ bv0 32) .cse3)) .cse18 v_ArrVal_992) .cse19) .cse4)) (bvadd v_arrayElimCell_241 (_ bv4 32))))) (not (= .cse19 .cse18))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_50|))))))))) is different from false [2023-12-24 21:42:56,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1180214366] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:42:56,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:42:56,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 44 [2023-12-24 21:42:56,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50897617] [2023-12-24 21:42:56,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:42:56,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-24 21:42:56,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:42:56,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-24 21:42:56,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2977, Unknown=44, NotChecked=570, Total=3782 [2023-12-24 21:42:56,050 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 44 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 34 states have internal predecessors, (48), 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:43:13,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:43:13,743 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2023-12-24 21:43:13,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-24 21:43:13,743 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 34 states have internal predecessors, (48), 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:43:13,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:43:13,744 INFO L225 Difference]: With dead ends: 63 [2023-12-24 21:43:13,744 INFO L226 Difference]: Without dead ends: 61 [2023-12-24 21:43:13,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1321 ImplicationChecksByTransitivity, 71.6s TimeCoverageRelationStatistics Valid=364, Invalid=5308, Unknown=48, NotChecked=760, Total=6480 [2023-12-24 21:43:13,746 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-12-24 21:43:13,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 272 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2023-12-24 21:43:13,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-24 21:43:13,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2023-12-24 21:43:13,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-24 21:43:13,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2023-12-24 21:43:13,756 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 32 [2023-12-24 21:43:13,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:43:13,756 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2023-12-24 21:43:13,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 34 states have internal predecessors, (48), 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:43:13,756 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2023-12-24 21:43:13,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-24 21:43:13,757 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:43:13,757 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:43:13,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2023-12-24 21:43:13,968 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 (13)] Forceful destruction successful, exit code 0 [2023-12-24 21:43:14,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /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:43:14,166 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:43:14,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:43:14,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1638621109, now seen corresponding path program 1 times [2023-12-24 21:43:14,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:43:14,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507473421] [2023-12-24 21:43:14,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:43:14,167 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:43:14,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:43:14,169 INFO L229 MonitoredProcess]: Starting monitored process 15 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:43:14,180 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 (15)] Waiting until timeout for monitored process [2023-12-24 21:43:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:43:14,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 83 conjunts are in the unsatisfiable core [2023-12-24 21:43:14,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:43:14,423 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:43:14,654 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:43:14,655 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:43:14,724 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:43:14,743 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:43:14,856 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-24 21:43:14,856 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 80 treesize of output 55 [2023-12-24 21:43:14,872 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 36 treesize of output 15 [2023-12-24 21:43:14,981 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:43:14,987 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:43:14,994 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:43:15,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:43:15,236 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:43:15,292 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:43:15,292 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:43:15,333 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:43:16,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 297 treesize of output 201 [2023-12-24 21:43:16,704 INFO L349 Elim1Store]: treesize reduction 58, result has 20.5 percent of original size [2023-12-24 21:43:16,704 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 194 treesize of output 110 [2023-12-24 21:43:16,711 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 103 treesize of output 49 [2023-12-24 21:43:16,772 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-12-24 21:43:16,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-12-24 21:43:17,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:43:17,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:43:17,168 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 13 [2023-12-24 21:43:17,192 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 21:43:17,192 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:43:17,487 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 58 treesize of output 38 [2023-12-24 21:43:17,545 INFO L349 Elim1Store]: treesize reduction 66, result has 18.5 percent of original size [2023-12-24 21:43:17,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 40 [2023-12-24 21:43:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:43:17,625 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:43:32,505 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse32 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse32 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse7 (select .cse32 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54| (_ BitVec 32))) (or (forall ((v_ArrVal_1093 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54| v_ArrVal_1093) .cse0) .cse7))) (or (= .cse0 .cse1) (forall ((v_ArrVal_1092 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54| v_ArrVal_1092) .cse0) .cse7))) (let ((.cse4 (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54| (store v_ArrVal_1093 (_ bv0 32) .cse0)))) (store .cse10 .cse1 (store (select .cse10 .cse1) .cse6 |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54|)))) (.cse2 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select .cse4 .cse2) .cse8))) (or (= .cse2 .cse3) (not (= (select (select .cse4 .cse3) (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54| (store v_ArrVal_1092 (_ bv0 32) .cse7)))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse6 (_ bv0 32)))) .cse2) .cse8)) .cse2)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54| (_ BitVec 32))) (or (forall ((v_ArrVal_1092 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54| v_ArrVal_1092) .cse0) .cse7))) (or (forall ((v_ArrVal_1093 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54| v_ArrVal_1093) .cse0) .cse7))) (let ((.cse13 (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54| (store v_ArrVal_1093 (_ bv0 32) .cse0)))) (store .cse17 .cse15 (store (select .cse17 .cse15) .cse16 |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54|)))) (.cse11 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (select (select .cse13 .cse11) .cse8))) (or (= .cse11 .cse12) (not (= (select (select .cse13 .cse12) (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54| (store v_ArrVal_1092 (_ bv0 32) .cse7)))) (store .cse14 .cse15 (store (select .cse14 .cse15) .cse16 (_ bv0 32)))) .cse11) .cse8)) .cse11))))))) (= .cse16 .cse7)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54|) (_ bv0 1))) (forall ((v_ArrVal_1092 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54| v_ArrVal_1092) .cse0) .cse7))) (or (forall ((v_ArrVal_1093 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54| v_ArrVal_1093) .cse0) .cse7)) (.cse20 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse18 (select (select (let ((.cse24 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54| (store v_ArrVal_1092 (_ bv0 32) .cse7)))) (store .cse24 .cse22 (store (select .cse24 .cse22) .cse23 (_ bv0 32)))) .cse20) .cse8))) (or (= .cse8 .cse18) (not (= (select (let ((.cse19 (let ((.cse21 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54| (store v_ArrVal_1093 (_ bv0 32) .cse0)))) (store .cse21 .cse22 (store (select .cse21 .cse22) .cse23 |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54|))))) (select .cse19 (select (select .cse19 .cse20) .cse8))) .cse18) .cse20)))))) (= .cse23 .cse7)))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54|) (_ bv0 1))) (forall ((v_ArrVal_1093 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54| v_ArrVal_1093) .cse0) .cse7))) (or (forall ((v_ArrVal_1092 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54| v_ArrVal_1092) .cse0) .cse7)) (.cse27 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse25 (select (select (let ((.cse31 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54| (store v_ArrVal_1092 (_ bv0 32) .cse7)))) (store .cse31 .cse29 (store (select .cse31 .cse29) .cse30 (_ bv0 32)))) .cse27) .cse8))) (or (= .cse8 .cse25) (not (= (select (let ((.cse26 (let ((.cse28 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54| (store v_ArrVal_1093 (_ bv0 32) .cse0)))) (store .cse28 .cse29 (store (select .cse28 .cse29) .cse30 |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_54|))))) (select .cse26 (select (select .cse26 .cse27) .cse8))) .cse25) .cse27)))))) (= .cse0 .cse29))))))))) is different from true [2023-12-24 21:43:32,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:43:32,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507473421] [2023-12-24 21:43:32,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507473421] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:43:32,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [314577937] [2023-12-24 21:43:32,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:43:32,507 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:43:32,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:43:32,508 INFO L229 MonitoredProcess]: Starting monitored process 16 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:43:32,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2023-12-24 21:43:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:43:32,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 80 conjunts are in the unsatisfiable core [2023-12-24 21:43:32,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:43:33,022 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:43:33,843 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:43:33,844 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:43:34,077 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:43:34,332 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:43:34,577 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:43:34,582 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:43:35,112 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:43:35,473 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-24 21:43:35,473 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:43:35,534 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-24 21:43:35,534 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:43:38,490 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-12-24 21:43:38,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 174 treesize of output 126 [2023-12-24 21:43:38,503 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 40 treesize of output 38 [2023-12-24 21:43:38,587 INFO L349 Elim1Store]: treesize reduction 36, result has 30.8 percent of original size [2023-12-24 21:43:38,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 63 [2023-12-24 21:43:38,661 INFO L349 Elim1Store]: treesize reduction 91, result has 14.2 percent of original size [2023-12-24 21:43:38,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 134 treesize of output 101 [2023-12-24 21:43:38,672 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 95 treesize of output 75 [2023-12-24 21:43:38,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 33 [2023-12-24 21:43:38,762 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-24 21:43:38,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-12-24 21:43:39,122 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:43:39,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:43:39,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2023-12-24 21:43:39,893 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 79 treesize of output 51 [2023-12-24 21:43:39,905 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-24 21:43:39,905 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 48 treesize of output 23 [2023-12-24 21:43:39,909 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:43:39,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:43:55,477 WARN L293 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 124 DAG size of output: 100 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-24 21:43:55,478 INFO L349 Elim1Store]: treesize reduction 437, result has 48.6 percent of original size [2023-12-24 21:43:55,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 5076 treesize of output 4723 [2023-12-24 21:44:37,951 WARN L293 SmtUtils]: Spent 42.32s on a formula simplification. DAG size of input: 380 DAG size of output: 329 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-24 21:44:37,951 INFO L349 Elim1Store]: treesize reduction 666, result has 84.1 percent of original size [2023-12-24 21:44:37,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 1 disjoint index pairs (out of 91 index pairs), introduced 17 new quantified variables, introduced 90 case distinctions, treesize of input 2326 treesize of output 5150 [2023-12-24 21:44:38,627 INFO L224 Elim1Store]: Index analysis took 358 ms [2023-12-24 21:44:39,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:44:39,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2589 treesize of output 2435 Received shutdown request... [2023-12-24 21:52:47,265 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 21:52:47,265 WARN L340 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 (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 21:52:47,305 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 21:52:47,508 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 21:52:47,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2023-12-24 21:52:47,729 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 (15)] Forceful destruction successful, exit code 0 [2023-12-24 21:52:47,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /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:52:47,923 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 35 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-69-9-8-8-8-10-6-8-7-9-4-8-5-9-3-8-3-5-3-5-3-4-3-1 context. [2023-12-24 21:52:47,927 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:52:47,929 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 21:52:47,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 09:52:47 BoogieIcfgContainer [2023-12-24 21:52:47,930 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 21:52:47,931 INFO L158 Benchmark]: Toolchain (without parser) took 878152.45ms. Allocated memory was 181.4MB in the beginning and 562.0MB in the end (delta: 380.6MB). Free memory was 134.1MB in the beginning and 259.8MB in the end (delta: -125.7MB). Peak memory consumption was 341.4MB. Max. memory is 8.0GB. [2023-12-24 21:52:47,931 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 21:52:47,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.97ms. Allocated memory is still 181.4MB. Free memory was 133.8MB in the beginning and 114.6MB in the end (delta: 19.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-24 21:52:47,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.99ms. Allocated memory is still 181.4MB. Free memory was 114.6MB in the beginning and 112.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 21:52:47,931 INFO L158 Benchmark]: Boogie Preprocessor took 56.14ms. Allocated memory is still 181.4MB. Free memory was 112.1MB in the beginning and 108.6MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 21:52:47,932 INFO L158 Benchmark]: RCFGBuilder took 496.25ms. Allocated memory is still 181.4MB. Free memory was 108.3MB in the beginning and 86.3MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-24 21:52:47,942 INFO L158 Benchmark]: TraceAbstraction took 877238.87ms. Allocated memory was 181.4MB in the beginning and 562.0MB in the end (delta: 380.6MB). Free memory was 85.6MB in the beginning and 259.8MB in the end (delta: -174.2MB). Peak memory consumption was 293.1MB. Max. memory is 8.0GB. [2023-12-24 21:52:47,943 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 317.97ms. Allocated memory is still 181.4MB. Free memory was 133.8MB in the beginning and 114.6MB in the end (delta: 19.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.99ms. Allocated memory is still 181.4MB. Free memory was 114.6MB in the beginning and 112.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.14ms. Allocated memory is still 181.4MB. Free memory was 112.1MB in the beginning and 108.6MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 496.25ms. Allocated memory is still 181.4MB. Free memory was 108.3MB in the beginning and 86.3MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 877238.87ms. Allocated memory was 181.4MB in the beginning and 562.0MB in the end (delta: 380.6MB). Free memory was 85.6MB in the beginning and 259.8MB in the end (delta: -174.2MB). Peak memory consumption was 293.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 640). Cancelled while NwaCegarLoop was analyzing trace of length 35 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-69-9-8-8-8-10-6-8-7-9-4-8-5-9-3-8-3-5-3-5-3-4-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 877.2s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 107.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 322 SdHoareTripleChecker+Valid, 52.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 313 mSDsluCounter, 1648 SdHoareTripleChecker+Invalid, 50.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 118 IncrementalHoareTripleChecker+Unchecked, 1499 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3439 IncrementalHoareTripleChecker+Invalid, 3619 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 149 mSDtfsCounter, 3439 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 575 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 329 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 4096 ImplicationChecksByTransitivity, 222.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=6, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 59 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 190.1s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 370 ConstructedInterpolants, 75 QuantifiedInterpolants, 9474 SizeOfPredicates, 237 NumberOfNonLiveVariables, 2855 ConjunctsInSsa, 653 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 77/154 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown