/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/dll2c_append_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:19:08,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:19:08,624 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-16 16:19:08,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:19:08,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:19:08,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:19:08,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:19:08,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:19:08,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:19:08,652 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:19:08,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:19:08,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:19:08,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:19:08,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:19:08,654 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:19:08,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:19:08,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:19:08,655 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:19:08,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:19:08,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:19:08,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:19:08,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:19:08,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:19:08,656 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:19:08,656 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:19:08,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:19:08,657 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:19:08,657 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:19:08,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:19:08,657 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:19:08,658 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:19:08,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:19:08,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:19:08,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:19:08,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:19:08,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:19:08,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:19:08,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:19:08,659 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:19:08,659 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:19:08,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:19:08,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:19:08,659 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:19:08,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:19:08,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:19:08,660 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:19:08,660 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-16 16:19:08,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:19:08,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:19:08,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:19:08,860 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:19:08,860 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:19:08,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_append_equal.i [2023-12-16 16:19:09,951 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:19:10,114 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:19:10,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_equal.i [2023-12-16 16:19:10,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeae6e4d5/38b89fd0996e4ccdade89ecfae7c82a5/FLAG57e5f3436 [2023-12-16 16:19:10,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeae6e4d5/38b89fd0996e4ccdade89ecfae7c82a5 [2023-12-16 16:19:10,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:19:10,143 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:19:10,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:19:10,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:19:10,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:19:10,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:19:10" (1/1) ... [2023-12-16 16:19:10,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a202080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:10, skipping insertion in model container [2023-12-16 16:19:10,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:19:10" (1/1) ... [2023-12-16 16:19:10,186 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:19:10,370 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_equal.i[24585,24598] [2023-12-16 16:19:10,375 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:19:10,391 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:19:10,460 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_equal.i[24585,24598] [2023-12-16 16:19:10,461 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:19:10,497 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:19:10,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:10 WrapperNode [2023-12-16 16:19:10,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:19:10,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:19:10,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:19:10,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:19:10,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:10" (1/1) ... [2023-12-16 16:19:10,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:10" (1/1) ... [2023-12-16 16:19:10,531 INFO L138 Inliner]: procedures = 130, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2023-12-16 16:19:10,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:19:10,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:19:10,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:19:10,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:19:10,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:10" (1/1) ... [2023-12-16 16:19:10,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:10" (1/1) ... [2023-12-16 16:19:10,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:10" (1/1) ... [2023-12-16 16:19:10,567 INFO L175 MemorySlicer]: Split 29 memory accesses to 3 slices as follows [2, 18, 9]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2023-12-16 16:19:10,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:10" (1/1) ... [2023-12-16 16:19:10,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:10" (1/1) ... [2023-12-16 16:19:10,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:10" (1/1) ... [2023-12-16 16:19:10,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:10" (1/1) ... [2023-12-16 16:19:10,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:10" (1/1) ... [2023-12-16 16:19:10,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:10" (1/1) ... [2023-12-16 16:19:10,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:19:10,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:19:10,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:19:10,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:19:10,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:10" (1/1) ... [2023-12-16 16:19:10,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:19:10,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:19:10,647 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-16 16:19:10,652 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-16 16:19:10,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 16:19:10,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 16:19:10,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-16 16:19:10,688 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-16 16:19:10,689 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-16 16:19:10,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 16:19:10,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:19:10,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 16:19:10,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 16:19:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 16:19:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-16 16:19:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 16:19:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 16:19:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-16 16:19:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 16:19:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 16:19:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 16:19:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-16 16:19:10,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-16 16:19:10,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-16 16:19:10,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-16 16:19:10,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:19:10,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 16:19:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 16:19:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:19:10,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:19:10,812 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:19:10,814 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:19:11,138 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:19:11,164 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:19:11,164 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-16 16:19:11,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:19:11 BoogieIcfgContainer [2023-12-16 16:19:11,164 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:19:11,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:19:11,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:19:11,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:19:11,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:19:10" (1/3) ... [2023-12-16 16:19:11,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9bb7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:19:11, skipping insertion in model container [2023-12-16 16:19:11,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:10" (2/3) ... [2023-12-16 16:19:11,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9bb7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:19:11, skipping insertion in model container [2023-12-16 16:19:11,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:19:11" (3/3) ... [2023-12-16 16:19:11,170 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal.i [2023-12-16 16:19:11,183 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:19:11,183 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:19:11,228 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:19:11,232 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;@ba7bb49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:19:11,232 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:19:11,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 16:19:11,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 16:19:11,241 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:19:11,241 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:19:11,241 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:19:11,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:19:11,247 INFO L85 PathProgramCache]: Analyzing trace with hash -540897351, now seen corresponding path program 1 times [2023-12-16 16:19:11,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:19:11,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248306240] [2023-12-16 16:19:11,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:19:11,259 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-16 16:19:11,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:19:11,288 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-16 16:19:11,346 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-16 16:19:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:19:11,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:19:11,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:19:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 16:19:11,501 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:19:11,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:19:11,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248306240] [2023-12-16 16:19:11,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248306240] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:19:11,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:19:11,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:19:11,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145028176] [2023-12-16 16:19:11,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:19:11,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:19:11,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:19:11,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:19:11,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:19:11,532 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 16:19:11,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:19:11,592 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2023-12-16 16:19:11,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:19:11,594 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-12-16 16:19:11,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:19:11,598 INFO L225 Difference]: With dead ends: 50 [2023-12-16 16:19:11,598 INFO L226 Difference]: Without dead ends: 22 [2023-12-16 16:19:11,600 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-16 16:19:11,602 INFO L413 NwaCegarLoop]: 33 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, 33 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-16 16:19:11,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:19:11,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-16 16:19:11,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-16 16:19:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-16 16:19:11,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-12-16 16:19:11,625 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 18 [2023-12-16 16:19:11,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:19:11,626 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-12-16 16:19:11,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 16:19:11,626 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-12-16 16:19:11,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 16:19:11,627 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:19:11,627 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:19:11,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 16:19:11,830 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-16 16:19:11,831 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:19:11,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:19:11,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2075980679, now seen corresponding path program 1 times [2023-12-16 16:19:11,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:19:11,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556863267] [2023-12-16 16:19:11,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:19:11,832 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-16 16:19:11,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:19:11,833 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-16 16:19:11,835 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-16 16:19:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:19:11,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:19:11,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:19:11,994 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-16 16:19:11,994 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:19:11,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:19:11,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1556863267] [2023-12-16 16:19:11,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1556863267] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:19:11,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:19:11,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:19:11,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752693332] [2023-12-16 16:19:11,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:19:11,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:19:11,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:19:12,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:19:12,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:19:12,000 INFO L87 Difference]: Start difference. First operand 22 states and 28 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-16 16:19:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:19:12,097 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2023-12-16 16:19:12,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:19:12,099 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-16 16:19:12,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:19:12,099 INFO L225 Difference]: With dead ends: 41 [2023-12-16 16:19:12,100 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 16:19:12,100 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-16 16:19:12,101 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 41 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:19:12,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 41 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:19:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 16:19:12,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2023-12-16 16:19:12,106 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-16 16:19:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-12-16 16:19:12,107 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 18 [2023-12-16 16:19:12,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:19:12,107 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-12-16 16:19:12,107 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-16 16:19:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-12-16 16:19:12,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 16:19:12,108 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:19:12,108 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] [2023-12-16 16:19:12,127 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-16 16:19:12,314 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-16 16:19:12,314 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:19:12,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:19:12,315 INFO L85 PathProgramCache]: Analyzing trace with hash 12333954, now seen corresponding path program 1 times [2023-12-16 16:19:12,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:19:12,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495760378] [2023-12-16 16:19:12,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:19:12,316 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-16 16:19:12,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:19:12,318 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-16 16:19:12,347 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-16 16:19:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:19:12,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 16:19:12,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:19:12,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-16 16:19:12,609 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-16 16:19:12,609 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:19:12,680 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-16 16:19:12,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:19:12,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495760378] [2023-12-16 16:19:12,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495760378] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:19:12,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:19:12,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2023-12-16 16:19:12,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290809075] [2023-12-16 16:19:12,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:19:12,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 16:19:12,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:19:12,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 16:19:12,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:19:12,684 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 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-16 16:19:16,696 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-16 16:19:20,725 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-16 16:19:24,847 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-16 16:19:27,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:19:27,029 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2023-12-16 16:19:27,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 16:19:27,031 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 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 26 [2023-12-16 16:19:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:19:27,031 INFO L225 Difference]: With dead ends: 49 [2023-12-16 16:19:27,031 INFO L226 Difference]: Without dead ends: 30 [2023-12-16 16:19:27,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-12-16 16:19:27,032 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:19:27,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 149 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 3 Unknown, 0 Unchecked, 14.3s Time] [2023-12-16 16:19:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-16 16:19:27,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2023-12-16 16:19:27,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 16:19:27,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-12-16 16:19:27,037 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 26 [2023-12-16 16:19:27,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:19:27,037 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-12-16 16:19:27,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 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-16 16:19:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-12-16 16:19:27,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 16:19:27,038 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:19:27,038 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] [2023-12-16 16:19:27,058 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-16 16:19:27,243 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-16 16:19:27,244 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:19:27,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:19:27,244 INFO L85 PathProgramCache]: Analyzing trace with hash 14180996, now seen corresponding path program 1 times [2023-12-16 16:19:27,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:19:27,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715749695] [2023-12-16 16:19:27,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:19:27,245 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-16 16:19:27,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:19:27,246 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-16 16:19:27,290 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-16 16:19:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:19:27,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-16 16:19:27,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:19:27,505 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-16 16:19:27,605 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-16 16:19:27,665 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-16 16:19:27,665 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-16 16:19:27,730 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-16 16:19:27,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-16 16:19:27,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:19:27,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2023-12-16 16:19:27,918 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-16 16:19:27,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:19:27,936 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 38 treesize of output 34 [2023-12-16 16:19:27,941 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 20 treesize of output 1 [2023-12-16 16:19:28,015 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-16 16:19:28,020 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-16 16:19:28,039 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-16 16:19:28,196 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-16 16:19:28,197 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-16 16:19:28,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:19:28,217 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-16 16:19:28,244 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-16 16:19:28,245 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-16 16:19:28,459 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 84 treesize of output 52 [2023-12-16 16:19:28,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:19:28,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:19:28,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2023-12-16 16:19:28,472 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-16 16:19:28,532 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-16 16:19:28,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:19:28,605 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:19:28,740 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_327 (_ BitVec 32)) (v_ArrVal_326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) v_ArrVal_326) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_328))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_327)))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-12-16 16:19:28,972 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_16| (_ BitVec 32)) (v_ArrVal_327 (_ BitVec 32)) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_328 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_16| v_ArrVal_336) .cse1) .cse2) v_ArrVal_326) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_16| v_ArrVal_328))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_327)))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_16|))))) is different from false [2023-12-16 16:19:28,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:19:28,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715749695] [2023-12-16 16:19:28,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715749695] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:19:28,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [112104171] [2023-12-16 16:19:28,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:19:28,977 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 16:19:28,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 16:19:29,014 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-16 16:19:29,020 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-16 16:19:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:19:29,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 70 conjunts are in the unsatisfiable core [2023-12-16 16:19:29,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:19:29,427 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-16 16:19:29,571 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-16 16:19:29,610 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-16 16:19:29,610 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-16 16:19:29,703 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-16 16:19:29,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-16 16:19:30,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:19:30,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2023-12-16 16:19:30,014 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-16 16:19:30,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:19:30,047 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 38 treesize of output 34 [2023-12-16 16:19:30,052 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 20 treesize of output 1 [2023-12-16 16:19:30,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-12-16 16:19:30,169 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-16 16:19:30,172 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-16 16:19:34,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:19:34,459 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-16 16:19:34,487 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-16 16:19:34,488 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-16 16:19:34,506 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-16 16:19:34,774 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 84 treesize of output 52 [2023-12-16 16:19:34,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:19:34,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:19:34,793 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 45 treesize of output 36 [2023-12-16 16:19:34,800 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-16 16:19:34,882 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-16 16:19:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:19:34,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:19:34,921 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) v_ArrVal_450) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_452))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 .cse1 v_ArrVal_449) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_ArrVal_449 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_449 .cse2)))))))) is different from false [2023-12-16 16:19:35,302 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_20| (_ BitVec 32)) (v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_20| v_ArrVal_460) .cse1) .cse2) v_ArrVal_450) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_20| v_ArrVal_452))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_20|))) (not (= v_ArrVal_449 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_449 .cse2)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 .cse1 v_ArrVal_449) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-12-16 16:19:35,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [112104171] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:19:35,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:19:35,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 37 [2023-12-16 16:19:35,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527707704] [2023-12-16 16:19:35,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:19:35,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-16 16:19:35,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:19:35,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-16 16:19:35,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1567, Unknown=32, NotChecked=332, Total=2070 [2023-12-16 16:19:35,308 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 37 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 27 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 16:19:41,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:19:41,516 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2023-12-16 16:19:41,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 16:19:41,517 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 27 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2023-12-16 16:19:41,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:19:41,518 INFO L225 Difference]: With dead ends: 50 [2023-12-16 16:19:41,518 INFO L226 Difference]: Without dead ends: 48 [2023-12-16 16:19:41,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=221, Invalid=2415, Unknown=32, NotChecked=412, Total=3080 [2023-12-16 16:19:41,520 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 56 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-12-16 16:19:41,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 167 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2023-12-16 16:19:41,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-16 16:19:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2023-12-16 16:19:41,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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-16 16:19:41,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2023-12-16 16:19:41,526 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 26 [2023-12-16 16:19:41,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:19:41,527 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-12-16 16:19:41,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 27 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 16:19:41,527 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2023-12-16 16:19:41,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 16:19:41,527 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:19:41,527 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:19:41,533 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 (5)] Ended with exit code 0 [2023-12-16 16:19:41,731 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-16 16:19:41,928 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-16 16:19:41,929 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:19:41,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:19:41,929 INFO L85 PathProgramCache]: Analyzing trace with hash 744913052, now seen corresponding path program 1 times [2023-12-16 16:19:41,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:19:41,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307372383] [2023-12-16 16:19:41,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:19:41,930 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-16 16:19:41,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:19:41,931 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-16 16:19:41,971 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-16 16:19:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:19:42,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-16 16:19:42,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:19:42,198 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-16 16:19:42,319 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-16 16:19:42,319 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-16 16:19:42,353 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-16 16:19:42,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-16 16:19:42,506 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-12-16 16:19:42,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 116 [2023-12-16 16:19:42,512 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 88 treesize of output 80 [2023-12-16 16:19:42,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 28 [2023-12-16 16:19:42,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 19 [2023-12-16 16:19:42,585 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-16 16:19:42,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:19:42,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2023-12-16 16:19:42,739 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-16 16:19:42,740 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-16 16:19:42,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:19:43,032 INFO L349 Elim1Store]: treesize reduction 106, result has 9.4 percent of original size [2023-12-16 16:19:43,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 147 [2023-12-16 16:19:43,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 155 [2023-12-16 16:19:43,234 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-16 16:19:43,234 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-16 16:19:43,395 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 169 treesize of output 105 [2023-12-16 16:19:43,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:19:43,409 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-12-16 16:19:43,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 251 treesize of output 164 [2023-12-16 16:19:43,415 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 12 treesize of output 8 [2023-12-16 16:19:43,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:19:43,468 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:19:43,581 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_565 (_ BitVec 32)) (v_ArrVal_567 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3) v_ArrVal_567) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_564))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_565)))) .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-12-16 16:19:43,598 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_565 (_ BitVec 32)) (v_ArrVal_567 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3) v_ArrVal_567) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_564))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_565)))) .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-12-16 16:19:43,660 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| (_ BitVec 32)) (v_ArrVal_564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_565 (_ BitVec 32)) (v_ArrVal_567 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24|))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| v_ArrVal_570) .cse2) .cse3) v_ArrVal_567) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| v_ArrVal_564))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_565)))) .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-12-16 16:19:43,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:19:43,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307372383] [2023-12-16 16:19:43,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307372383] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:19:43,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2127559024] [2023-12-16 16:19:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:19:43,664 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 16:19:43,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 16:19:43,665 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-16 16:19:43,666 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-16 16:19:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:19:44,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-16 16:19:44,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:19:44,067 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-16 16:19:44,204 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-16 16:19:44,205 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-16 16:19:44,277 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-16 16:19:44,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-16 16:19:44,576 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-12-16 16:19:44,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 116 [2023-12-16 16:19:44,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 20 [2023-12-16 16:19:44,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2023-12-16 16:19:44,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 19 [2023-12-16 16:19:44,695 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-16 16:19:48,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:19:48,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2023-12-16 16:19:48,937 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-16 16:19:48,938 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-16 16:19:49,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:19:49,252 INFO L349 Elim1Store]: treesize reduction 106, result has 9.4 percent of original size [2023-12-16 16:19:49,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 147 [2023-12-16 16:19:49,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 132 [2023-12-16 16:19:49,438 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 16:19:49,439 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-16 16:19:49,686 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 172 treesize of output 108 [2023-12-16 16:19:49,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:19:49,697 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-12-16 16:19:49,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 211 treesize of output 152 [2023-12-16 16:19:49,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-16 16:19:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:19:49,703 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:19:49,719 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (_ BitVec 32)) (v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3) v_ArrVal_677) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_678))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_676)))) .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-12-16 16:19:49,736 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (_ BitVec 32)) (v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) v_ArrVal_677) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_678))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_676)))) .cse3) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)))) is different from false [2023-12-16 16:19:49,786 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_676 (_ BitVec 32)) (v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_28| (_ BitVec 32)) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_28| v_ArrVal_681) .cse2) .cse3) v_ArrVal_677) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_28| v_ArrVal_678))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_676)))) .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_28|) (_ bv0 1))))) is different from false [2023-12-16 16:19:49,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2127559024] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:19:49,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:19:49,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 37 [2023-12-16 16:19:49,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194191134] [2023-12-16 16:19:49,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:19:49,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-16 16:19:49,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:19:49,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-16 16:19:49,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1355, Unknown=18, NotChecked=474, Total=1980 [2023-12-16 16:19:49,793 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 37 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 28 states have internal predecessors, (37), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 16:19:57,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:19:57,760 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2023-12-16 16:19:57,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 16:19:57,761 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 28 states have internal predecessors, (37), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 28 [2023-12-16 16:19:57,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:19:57,762 INFO L225 Difference]: With dead ends: 52 [2023-12-16 16:19:57,762 INFO L226 Difference]: Without dead ends: 49 [2023-12-16 16:19:57,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=192, Invalid=1967, Unknown=27, NotChecked=570, Total=2756 [2023-12-16 16:19:57,763 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 55 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 8 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:19:57,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 244 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 571 Invalid, 8 Unknown, 0 Unchecked, 7.3s Time] [2023-12-16 16:19:57,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-16 16:19:57,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2023-12-16 16:19:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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-16 16:19:57,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2023-12-16 16:19:57,769 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 28 [2023-12-16 16:19:57,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:19:57,770 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2023-12-16 16:19:57,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 28 states have internal predecessors, (37), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 16:19:57,770 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2023-12-16 16:19:57,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 16:19:57,770 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:19:57,771 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-16 16:19:57,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:19:57,980 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-16 16:19:58,180 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-16 16:19:58,180 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:19:58,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:19:58,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1617509290, now seen corresponding path program 1 times [2023-12-16 16:19:58,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:19:58,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667986154] [2023-12-16 16:19:58,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:19:58,181 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-16 16:19:58,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:19:58,182 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-16 16:19:58,208 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-16 16:19:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:19:58,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 102 conjunts are in the unsatisfiable core [2023-12-16 16:19:58,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:19:58,474 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-16 16:19:58,491 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-16 16:19:58,657 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-16 16:19:58,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-16 16:19:58,685 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-16 16:19:58,685 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-16 16:19:58,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-16 16:19:58,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-16 16:19:58,777 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-16 16:19:58,861 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-16 16:19:58,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-16 16:19:58,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-16 16:19:59,221 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-12-16 16:19:59,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 258 treesize of output 196 [2023-12-16 16:19:59,242 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 38 treesize of output 38 [2023-12-16 16:19:59,249 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 140 treesize of output 122 [2023-12-16 16:19:59,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 28 [2023-12-16 16:19:59,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2023-12-16 16:19:59,277 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 79 treesize of output 41 [2023-12-16 16:19:59,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 33 [2023-12-16 16:19:59,397 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-16 16:19:59,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2023-12-16 16:19:59,409 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-16 16:19:59,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:19:59,585 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 89 treesize of output 54 [2023-12-16 16:19:59,607 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-12-16 16:19:59,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2023-12-16 16:19:59,656 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2023-12-16 16:19:59,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 58 [2023-12-16 16:19:59,700 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-16 16:19:59,701 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-16 16:20:00,379 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-12-16 16:20:00,379 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 409 treesize of output 233 [2023-12-16 16:20:01,837 INFO L349 Elim1Store]: treesize reduction 189, result has 7.8 percent of original size [2023-12-16 16:20:01,838 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 576 treesize of output 354 [2023-12-16 16:20:01,912 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 55 treesize of output 55 [2023-12-16 16:20:01,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 36 [2023-12-16 16:20:01,985 INFO L349 Elim1Store]: treesize reduction 84, result has 7.7 percent of original size [2023-12-16 16:20:01,986 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 155 treesize of output 92 [2023-12-16 16:20:01,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 92 [2023-12-16 16:20:02,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:20:02,008 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 61 treesize of output 19 [2023-12-16 16:20:02,135 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 99 treesize of output 67 [2023-12-16 16:20:02,336 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-16 16:20:02,336 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 64 treesize of output 35 [2023-12-16 16:20:02,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-12-16 16:20:02,436 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:20:02,436 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:20:02,994 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_820 (_ BitVec 32)) (v_ArrVal_809 (_ BitVec 32)) (v_ArrVal_819 (_ BitVec 32)) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_818 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_817 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) .cse1 v_ArrVal_819)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_810) .cse2 v_ArrVal_807) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| .cse0 (store (select |c_#memory_$Pointer$#1.base| .cse0) .cse1 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_812))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 v_ArrVal_820))) .cse5) .cse6)) (bvadd (select (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| .cse0 (store (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1 v_ArrVal_809)))) (store .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_817))))) (store .cse7 .cse2 (store (select .cse7 .cse2) .cse4 v_ArrVal_818))) .cse5) .cse6) (_ bv8 32))))))) is different from false [2023-12-16 16:20:03,339 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_820 (_ BitVec 32)) (v_ArrVal_809 (_ BitVec 32)) (v_ArrVal_819 (_ BitVec 32)) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_818 (_ BitVec 32)) (v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_817 (_ BitVec 32))) (= (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) .cse1 v_ArrVal_819)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_810) .cse2 v_ArrVal_807) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| .cse0 (store (select |c_#memory_$Pointer$#1.base| .cse0) .cse1 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_812))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 v_ArrVal_820))) .cse5) .cse6)) (bvadd (_ bv8 32) (select (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| .cse0 (store (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1 v_ArrVal_809)))) (store .cse8 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_817))))) (store .cse7 .cse2 (store (select .cse7 .cse2) .cse4 v_ArrVal_818))) .cse5) .cse6))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-12-16 16:20:04,474 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_830 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_32| (_ BitVec 32)) (v_ArrVal_820 (_ BitVec 32)) (v_ArrVal_809 (_ BitVec 32)) (v_ArrVal_819 (_ BitVec 32)) (v_ArrVal_818 (_ BitVec 32)) (v_ArrVal_817 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_32|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_32| v_ArrVal_831)) (.cse5 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_32| v_ArrVal_832)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse0 (select (select .cse5 .cse2) .cse4)) (.cse1 (select (select .cse10 .cse2) .cse4)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_32| v_ArrVal_830) .cse0) .cse1 v_ArrVal_819)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_32| v_ArrVal_810) .cse2 v_ArrVal_807) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| .cse0 (store (select .cse5 .cse0) .cse1 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_32|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_32| v_ArrVal_812))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 v_ArrVal_820))) .cse6) .cse7)) (bvadd (select (select (let ((.cse8 (let ((.cse9 (store (select .cse10 .cse0) .cse1 v_ArrVal_809))) (store (store |c_#memory_$Pointer$#1.offset| .cse0 .cse9) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_32| (store (store (select (store .cse10 .cse0 .cse9) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_32|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_817))))) (store .cse8 .cse2 (store (select .cse8 .cse2) .cse4 v_ArrVal_818))) .cse6) .cse7) (_ bv8 32)))))))) is different from false [2023-12-16 16:20:04,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:04,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667986154] [2023-12-16 16:20:04,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667986154] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:20:04,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2132290376] [2023-12-16 16:20:04,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:20:04,510 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 16:20:04,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 16:20:04,513 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-16 16:20:04,531 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-16 16:20:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:20:04,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 97 conjunts are in the unsatisfiable core [2023-12-16 16:20:04,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:04,983 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-16 16:20:04,989 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-16 16:20:05,200 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-16 16:20:05,200 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-16 16:20:05,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-16 16:20:05,326 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-16 16:20:05,344 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-16 16:20:05,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-16 16:20:05,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-16 16:20:05,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-16 16:20:05,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-16 16:20:05,939 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-12-16 16:20:05,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 255 treesize of output 193 [2023-12-16 16:20:05,954 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 38 treesize of output 38 [2023-12-16 16:20:05,966 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 149 treesize of output 127 [2023-12-16 16:20:05,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 86 [2023-12-16 16:20:05,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 98 [2023-12-16 16:20:06,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2023-12-16 16:20:06,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:20:06,232 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 18 treesize of output 12 [2023-12-16 16:20:06,240 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-16 16:20:06,241 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 187 treesize of output 106 [2023-12-16 16:20:06,249 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 21 treesize of output 11 [2023-12-16 16:20:06,253 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 27 treesize of output 19 [2023-12-16 16:20:06,258 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-16 16:20:10,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:20:10,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:20:10,579 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 26 treesize of output 21 [2023-12-16 16:20:10,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:20:10,608 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-16 16:20:10,609 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 195 treesize of output 120 [2023-12-16 16:20:10,629 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-12-16 16:20:10,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2023-12-16 16:20:10,661 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-16 16:20:10,661 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-16 16:20:10,676 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 18 treesize of output 26 [2023-12-16 16:20:11,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:20:11,971 INFO L349 Elim1Store]: treesize reduction 106, result has 9.4 percent of original size [2023-12-16 16:20:11,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 324 treesize of output 259 [2023-12-16 16:20:11,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 91 [2023-12-16 16:20:12,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2023-12-16 16:20:12,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 280 treesize of output 239 [2023-12-16 16:20:12,119 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 37 treesize of output 19 [2023-12-16 16:20:12,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-16 16:20:12,778 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 318 treesize of output 202 [2023-12-16 16:20:13,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:20:13,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:20:13,652 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 30 treesize of output 24 [2023-12-16 16:20:13,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:20:13,670 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-12-16 16:20:13,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 440 treesize of output 315 [2023-12-16 16:20:13,675 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 15 treesize of output 11 [2023-12-16 16:20:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:20:13,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:20:13,833 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_970 (_ BitVec 32)) (v_ArrVal_963 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_960 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_967 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) .cse1 v_ArrVal_968)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_960) .cse2 v_ArrVal_957) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_965) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_958))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 v_ArrVal_970))) .cse5) .cse6)) (bvadd (_ bv8 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_964) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_963) .cse2 (store (select (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse0 (store (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1 v_ArrVal_966)))) (store .cse7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_967))) .cse2) .cse4 v_ArrVal_969)) .cse5) .cse6))))))) is different from false [2023-12-16 16:20:21,163 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_970 (_ BitVec 32)) (v_ArrVal_963 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| (_ BitVec 32)) (v_ArrVal_981 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_960 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_967 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_980 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36|))) (= (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| v_ArrVal_979)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| v_ArrVal_980) .cse2) .cse4)) (.cse1 (select (select .cse8 .cse2) .cse4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| v_ArrVal_981) .cse0) .cse1 v_ArrVal_968)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| v_ArrVal_960) .cse2 v_ArrVal_957) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_965) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| v_ArrVal_958))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 v_ArrVal_970))) .cse5) .cse6)) (bvadd (_ bv8 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_964) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| v_ArrVal_963) .cse2 (store (select (let ((.cse7 (store (select .cse8 .cse0) .cse1 v_ArrVal_966))) (store (store |c_#memory_$Pointer$#1.offset| .cse0 .cse7) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| (store (store (select (store .cse8 .cse0 .cse7) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_967))) .cse2) .cse4 v_ArrVal_969)) .cse5) .cse6))))) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2023-12-16 16:20:21,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2132290376] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:20:21,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:20:21,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 39 [2023-12-16 16:20:21,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740478558] [2023-12-16 16:20:21,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:20:21,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-16 16:20:21,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:21,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-16 16:20:21,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1741, Unknown=41, NotChecked=440, Total=2352 [2023-12-16 16:20:21,223 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 39 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 29 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Received shutdown request... [2023-12-16 16:20:25,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 16:20:25,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=204, Invalid=2736, Unknown=50, NotChecked=550, Total=3540 [2023-12-16 16:20:25,677 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 7 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-16 16:20:25,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 111 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 473 Invalid, 5 Unknown, 0 Unchecked, 2.5s Time] [2023-12-16 16:20:25,678 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:20:25,685 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-16 16:20:25,705 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 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 16:20:25,714 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-16 16:20:25,715 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 16:20:25,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2023-12-16 16:20:26,078 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-16 16:20:26,079 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (42states) and FLOYD_HOARE automaton (currently 16 states, 39 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. [2023-12-16 16:20:26,082 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-16 16:20:26,084 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:20:26,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:20:26 BoogieIcfgContainer [2023-12-16 16:20:26,085 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:20:26,086 INFO L158 Benchmark]: Toolchain (without parser) took 75942.50ms. Allocated memory is still 268.4MB. Free memory was 222.0MB in the beginning and 187.8MB in the end (delta: 34.2MB). Peak memory consumption was 35.1MB. Max. memory is 8.0GB. [2023-12-16 16:20:26,086 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:20:26,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.04ms. Allocated memory is still 268.4MB. Free memory was 222.0MB in the beginning and 202.5MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-16 16:20:26,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.76ms. Allocated memory is still 268.4MB. Free memory was 202.5MB in the beginning and 200.0MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 16:20:26,086 INFO L158 Benchmark]: Boogie Preprocessor took 67.45ms. Allocated memory is still 268.4MB. Free memory was 200.0MB in the beginning and 196.5MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 16:20:26,086 INFO L158 Benchmark]: RCFGBuilder took 564.47ms. Allocated memory is still 268.4MB. Free memory was 196.5MB in the beginning and 173.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-16 16:20:26,086 INFO L158 Benchmark]: TraceAbstraction took 74919.49ms. Allocated memory is still 268.4MB. Free memory was 172.7MB in the beginning and 187.8MB in the end (delta: -15.1MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:20:26,087 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.13ms. Allocated memory is still 176.2MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 353.04ms. Allocated memory is still 268.4MB. Free memory was 222.0MB in the beginning and 202.5MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.76ms. Allocated memory is still 268.4MB. Free memory was 202.5MB in the beginning and 200.0MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 67.45ms. Allocated memory is still 268.4MB. Free memory was 200.0MB in the beginning and 196.5MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 564.47ms. Allocated memory is still 268.4MB. Free memory was 196.5MB in the beginning and 173.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 74919.49ms. Allocated memory is still 268.4MB. Free memory was 172.7MB in the beginning and 187.8MB in the end (delta: -15.1MB). There was no memory consumed. 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: 645]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 645). Cancelled while NwaCegarLoop was constructing difference of abstraction (42states) and FLOYD_HOARE automaton (currently 16 states, 39 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 74.9s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 33.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 29.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 154 mSDsluCounter, 745 SdHoareTripleChecker+Invalid, 29.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 638 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1614 IncrementalHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 107 mSDtfsCounter, 1614 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 178 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 29.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=5, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 37.4s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 244 ConstructedInterpolants, 48 QuantifiedInterpolants, 6548 SizeOfPredicates, 152 NumberOfNonLiveVariables, 2150 ConjunctsInSsa, 456 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 48/90 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