/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/dll2n_prepend_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:32:52,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:32:52,156 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 21:32:52,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:32:52,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:32:52,182 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:32:52,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:32:52,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:32:52,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:32:52,183 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:32:52,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:32:52,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:32:52,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:32:52,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:32:52,185 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:32:52,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:32:52,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:32:52,185 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:32:52,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:32:52,186 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:32:52,186 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:32:52,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:32:52,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:32:52,189 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:32:52,191 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:32:52,191 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:32:52,192 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:32:52,192 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:32:52,193 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:32:52,193 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:32:52,193 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:32:52,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:32:52,194 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:32:52,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:32:52,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:32:52,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:32:52,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:32:52,194 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:32:52,194 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:32:52,194 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:32:52,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:32:52,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:32:52,195 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:32:52,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:32:52,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:32:52,195 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:32:52,195 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 21:32:52,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:32:52,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:32:52,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:32:52,413 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:32:52,413 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:32:52,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_prepend_unequal.i [2023-12-24 21:32:53,407 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:32:53,594 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:32:53,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_prepend_unequal.i [2023-12-24 21:32:53,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/904ac696d/65116b68058b486f8fbacc7f0ce39a9d/FLAGce2cf5e18 [2023-12-24 21:32:53,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/904ac696d/65116b68058b486f8fbacc7f0ce39a9d [2023-12-24 21:32:53,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:32:53,619 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:32:53,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:32:53,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:32:53,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:32:53,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:32:53" (1/1) ... [2023-12-24 21:32:53,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@351e75e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:32:53, skipping insertion in model container [2023-12-24 21:32:53,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:32:53" (1/1) ... [2023-12-24 21:32:53,682 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:32:53,870 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_prepend_unequal.i[24450,24463] [2023-12-24 21:32:53,873 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:32:53,899 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:32:53,933 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_prepend_unequal.i[24450,24463] [2023-12-24 21:32:53,934 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:32:53,957 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:32:53,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:32:53 WrapperNode [2023-12-24 21:32:53,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:32:53,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:32:53,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:32:53,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:32:53,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:32:53" (1/1) ... [2023-12-24 21:32:53,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:32:53" (1/1) ... [2023-12-24 21:32:54,005 INFO L138 Inliner]: procedures = 130, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 126 [2023-12-24 21:32:54,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:32:54,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:32:54,007 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:32:54,007 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:32:54,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:32:53" (1/1) ... [2023-12-24 21:32:54,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:32:53" (1/1) ... [2023-12-24 21:32:54,022 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:32:53" (1/1) ... [2023-12-24 21:32:54,041 INFO L175 MemorySlicer]: Split 23 memory accesses to 3 slices as follows [2, 14, 7]. 61 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2023-12-24 21:32:54,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:32:53" (1/1) ... [2023-12-24 21:32:54,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:32:53" (1/1) ... [2023-12-24 21:32:54,049 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:32:53" (1/1) ... [2023-12-24 21:32:54,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:32:53" (1/1) ... [2023-12-24 21:32:54,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:32:53" (1/1) ... [2023-12-24 21:32:54,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:32:53" (1/1) ... [2023-12-24 21:32:54,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:32:54,066 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:32:54,066 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:32:54,066 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:32:54,067 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:32:53" (1/1) ... [2023-12-24 21:32:54,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:32:54,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:32:54,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 21:32:54,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 21:32:54,146 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-24 21:32:54,147 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-24 21:32:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 21:32:54,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 21:32:54,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 21:32:54,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 21:32:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:32:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-24 21:32:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 21:32:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 21:32:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-24 21:32:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 21:32:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 21:32:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-24 21:32:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 21:32:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 21:32:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 21:32:54,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 21:32:54,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-24 21:32:54,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-24 21:32:54,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-24 21:32:54,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:32:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:32:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 21:32:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:32:54,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:32:54,273 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:32:54,275 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:32:54,306 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-24 21:32:54,531 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:32:54,570 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:32:54,571 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-24 21:32:54,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:32:54 BoogieIcfgContainer [2023-12-24 21:32:54,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:32:54,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:32:54,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:32:54,580 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:32:54,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:32:53" (1/3) ... [2023-12-24 21:32:54,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714fe39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:32:54, skipping insertion in model container [2023-12-24 21:32:54,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:32:53" (2/3) ... [2023-12-24 21:32:54,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714fe39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:32:54, skipping insertion in model container [2023-12-24 21:32:54,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:32:54" (3/3) ... [2023-12-24 21:32:54,582 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_unequal.i [2023-12-24 21:32:54,593 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:32:54,593 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 21:32:54,627 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:32:54,631 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;@fd65488, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:32:54,631 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 21:32:54,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:32:54,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 21:32:54,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:32:54,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:32:54,638 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:32:54,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:32:54,642 INFO L85 PathProgramCache]: Analyzing trace with hash 612994908, now seen corresponding path program 1 times [2023-12-24 21:32:54,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:32:54,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403802671] [2023-12-24 21:32:54,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:32:54,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:32:54,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:32:54,652 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:32:54,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 21:32:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:32:54,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 21:32:54,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:32:54,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:32:54,776 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:32:54,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:32:54,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403802671] [2023-12-24 21:32:54,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403802671] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:32:54,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:32:54,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:32:54,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402642048] [2023-12-24 21:32:54,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:32:54,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 21:32:54,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:32:54,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 21:32:54,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:32:54,807 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:32:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:32:54,868 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2023-12-24 21:32:54,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 21:32:54,869 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-24 21:32:54,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:32:54,874 INFO L225 Difference]: With dead ends: 43 [2023-12-24 21:32:54,874 INFO L226 Difference]: Without dead ends: 17 [2023-12-24 21:32:54,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:32:54,879 INFO L413 NwaCegarLoop]: 28 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, 28 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:32:54,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:32:54,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-24 21:32:54,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-24 21:32:54,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:32:54,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2023-12-24 21:32:54,903 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 9 [2023-12-24 21:32:54,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:32:54,903 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2023-12-24 21:32:54,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:32:54,904 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2023-12-24 21:32:54,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 21:32:54,904 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:32:54,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:32:54,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 21:32:55,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:32:55,109 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:32:55,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:32:55,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1859336911, now seen corresponding path program 1 times [2023-12-24 21:32:55,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:32:55,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146812034] [2023-12-24 21:32:55,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:32:55,111 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:32:55,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:32:55,112 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:32:55,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 21:32:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:32:55,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:32:55,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:32:55,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:32:55,251 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:32:55,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:32:55,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146812034] [2023-12-24 21:32:55,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146812034] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:32:55,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:32:55,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:32:55,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999173423] [2023-12-24 21:32:55,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:32:55,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:32:55,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:32:55,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:32:55,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:32:55,258 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:32:55,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:32:55,334 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2023-12-24 21:32:55,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:32:55,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-24 21:32:55,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:32:55,335 INFO L225 Difference]: With dead ends: 33 [2023-12-24 21:32:55,335 INFO L226 Difference]: Without dead ends: 22 [2023-12-24 21:32:55,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:32:55,336 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 31 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-24 21:32:55,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 31 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:32:55,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-24 21:32:55,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2023-12-24 21:32:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:32:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2023-12-24 21:32:55,340 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 9 [2023-12-24 21:32:55,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:32:55,340 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2023-12-24 21:32:55,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:32:55,340 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2023-12-24 21:32:55,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-24 21:32:55,341 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:32:55,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:32:55,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 21:32:55,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:32:55,542 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:32:55,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:32:55,542 INFO L85 PathProgramCache]: Analyzing trace with hash -804966833, now seen corresponding path program 1 times [2023-12-24 21:32:55,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:32:55,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058123408] [2023-12-24 21:32:55,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:32:55,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:32:55,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:32:55,545 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:32:55,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 21:32:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:32:55,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 21:32:55,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:32:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:32:55,713 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:32:55,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:32:55,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058123408] [2023-12-24 21:32:55,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058123408] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:32:55,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:32:55,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:32:55,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821655616] [2023-12-24 21:32:55,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:32:55,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:32:55,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:32:55,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:32:55,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:32:55,719 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:32:55,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:32:55,874 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2023-12-24 21:32:55,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:32:55,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-24 21:32:55,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:32:55,876 INFO L225 Difference]: With dead ends: 38 [2023-12-24 21:32:55,876 INFO L226 Difference]: Without dead ends: 22 [2023-12-24 21:32:55,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:32:55,877 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:32:55,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 21:32:55,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-24 21:32:55,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2023-12-24 21:32:55,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:32:55,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-12-24 21:32:55,881 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 14 [2023-12-24 21:32:55,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:32:55,881 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-12-24 21:32:55,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:32:55,882 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-12-24 21:32:55,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-24 21:32:55,882 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:32:55,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:32:55,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 21:32:56,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:32:56,086 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:32:56,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:32:56,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1197993843, now seen corresponding path program 1 times [2023-12-24 21:32:56,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:32:56,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272557092] [2023-12-24 21:32:56,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:32:56,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:32:56,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:32:56,100 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:32:56,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 21:32:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:32:56,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 21:32:56,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:32:56,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:32:56,217 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:32:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:32:56,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:32:56,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272557092] [2023-12-24 21:32:56,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272557092] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:32:56,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:32:56,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-24 21:32:56,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867602696] [2023-12-24 21:32:56,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:32:56,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 21:32:56,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:32:56,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 21:32:56,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:32:56,246 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:32:56,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:32:56,363 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2023-12-24 21:32:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 21:32:56,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-24 21:32:56,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:32:56,364 INFO L225 Difference]: With dead ends: 38 [2023-12-24 21:32:56,364 INFO L226 Difference]: Without dead ends: 27 [2023-12-24 21:32:56,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:32:56,374 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:32:56,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 49 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:32:56,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-24 21:32:56,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2023-12-24 21:32:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:32:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-12-24 21:32:56,378 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2023-12-24 21:32:56,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:32:56,378 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-12-24 21:32:56,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:32:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2023-12-24 21:32:56,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-24 21:32:56,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:32:56,379 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:32:56,398 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-24 21:32:56,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:32:56,582 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:32:56,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:32:56,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1120518319, now seen corresponding path program 1 times [2023-12-24 21:32:56,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:32:56,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5759052] [2023-12-24 21:32:56,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:32:56,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:32:56,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:32:56,584 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:32:56,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 21:32:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:32:56,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-24 21:32:56,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:32:56,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:32:56,848 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-12-24 21:32:56,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-12-24 21:32:56,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-24 21:32:56,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:32:56,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-24 21:32:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:32:57,034 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:32:57,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:32:57,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5759052] [2023-12-24 21:32:57,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5759052] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:32:57,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:32:57,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 21:32:57,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462284035] [2023-12-24 21:32:57,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:32:57,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 21:32:57,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:32:57,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 21:32:57,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 21:32:57,043 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:32:57,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:32:57,598 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2023-12-24 21:32:57,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 21:32:57,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-24 21:32:57,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:32:57,599 INFO L225 Difference]: With dead ends: 25 [2023-12-24 21:32:57,599 INFO L226 Difference]: Without dead ends: 23 [2023-12-24 21:32:57,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-24 21:32:57,600 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 21:32:57,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 21:32:57,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-24 21:32:57,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-24 21:32:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:32:57,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-12-24 21:32:57,602 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2023-12-24 21:32:57,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:32:57,603 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-12-24 21:32:57,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:32:57,603 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-12-24 21:32:57,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-24 21:32:57,603 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:32:57,603 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:32:57,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 21:32:57,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:32:57,808 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:32:57,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:32:57,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1218720098, now seen corresponding path program 1 times [2023-12-24 21:32:57,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:32:57,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683277405] [2023-12-24 21:32:57,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:32:57,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:32:57,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:32:57,811 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:32:57,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-24 21:32:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:32:57,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-24 21:32:57,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:32:57,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:32:58,015 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-12-24 21:32:58,015 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 1 case distinctions, treesize of input 17 treesize of output 17 [2023-12-24 21:32:58,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-24 21:32:58,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:32:58,103 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 28 treesize of output 15 [2023-12-24 21:32:58,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-12-24 21:32:58,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-24 21:32:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:32:58,153 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:32:58,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:32:58,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683277405] [2023-12-24 21:32:58,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683277405] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:32:58,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:32:58,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 21:32:58,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746592606] [2023-12-24 21:32:58,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:32:58,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 21:32:58,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:32:58,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 21:32:58,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-24 21:32:58,155 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:32:58,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:32:58,727 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2023-12-24 21:32:58,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 21:32:58,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-24 21:32:58,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:32:58,728 INFO L225 Difference]: With dead ends: 43 [2023-12-24 21:32:58,728 INFO L226 Difference]: Without dead ends: 27 [2023-12-24 21:32:58,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-24 21:32:58,728 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 21:32:58,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 21:32:58,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-24 21:32:58,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2023-12-24 21:32:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:32:58,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-12-24 21:32:58,731 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 21 [2023-12-24 21:32:58,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:32:58,731 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-12-24 21:32:58,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:32:58,731 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-12-24 21:32:58,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-24 21:32:58,732 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:32:58,732 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:32:58,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-24 21:32:58,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:32:58,933 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:32:58,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:32:58,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1218721772, now seen corresponding path program 1 times [2023-12-24 21:32:58,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:32:58,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642621444] [2023-12-24 21:32:58,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:32:58,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:32:58,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:32:58,935 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:32:58,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 21:32:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:32:59,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-24 21:32:59,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:32:59,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:32:59,165 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:32:59,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:32:59,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-12-24 21:32:59,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:32:59,368 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-24 21:32:59,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-12-24 21:32:59,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-24 21:32:59,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-24 21:32:59,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-24 21:32:59,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:32:59,546 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 28 treesize of output 15 [2023-12-24 21:32:59,558 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:32:59,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:32:59,560 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 51 treesize of output 15 [2023-12-24 21:32:59,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:32:59,569 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 28 treesize of output 15 [2023-12-24 21:32:59,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-12-24 21:32:59,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-24 21:32:59,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 7 treesize of output 3 [2023-12-24 21:32:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:32:59,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:32:59,886 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (or (not (= v_ArrVal_444 (let ((.cse1 (bvadd (_ bv8 32) (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_444 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store |c_#memory_int#1| .cse0 v_ArrVal_444) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_443) .cse3) .cse4)) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_442) .cse3) .cse4)))))))) is different from false [2023-12-24 21:32:59,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:32:59,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 120 [2023-12-24 21:33:00,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:33:00,076 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 238 treesize of output 237 [2023-12-24 21:33:00,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:33:00,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 180 [2023-12-24 21:33:00,121 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 90 treesize of output 74 [2023-12-24 21:33:00,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:33:00,177 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 300 treesize of output 269 [2023-12-24 21:33:00,196 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 53 treesize of output 37 [2023-12-24 21:33:00,976 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse10 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse3 (select .cse19 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse17 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse19 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (= .cse3 .cse17)) (.cse4 (bvadd (_ bv8 32) .cse8))) (let ((.cse1 (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_26 (_ BitVec 32)) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_439))) (or (forall ((v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_27 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse18 .cse3 v_ArrVal_444) v_arrayElimCell_24) v_arrayElimCell_27))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_444 v_arrayElimCell_26)) (not (= (store (select .cse18 .cse3) .cse4 (select v_ArrVal_444 .cse4)) v_ArrVal_444)))))) (.cse5 (= .cse17 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (.cse6 (and (or .cse2 (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_26 (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32)) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_439))) (or (= (select (select (store .cse11 .cse3 v_ArrVal_444) v_arrayElimCell_23) v_arrayElimCell_26) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (select .cse11 .cse3) .cse4 (select v_ArrVal_444 .cse4)) v_ArrVal_444)))))) (or .cse2 (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_23 (_ BitVec 32)) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_439))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse12 .cse3 v_ArrVal_444) v_arrayElimCell_23) .cse8)) (not (= (store (select .cse12 .cse3) .cse4 (select v_ArrVal_444 .cse4)) v_ArrVal_444)))))) (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_26 (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32)) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_439))) (let ((.cse13 (store .cse14 .cse3 v_ArrVal_444))) (or (forall ((v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_27 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse13 v_arrayElimCell_24) v_arrayElimCell_27))) (= (select (select .cse13 v_arrayElimCell_23) v_arrayElimCell_26) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (select .cse14 .cse3) .cse4 (select v_ArrVal_444 .cse4)) v_ArrVal_444)))))) (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_23 (_ BitVec 32)) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_439))) (let ((.cse15 (store .cse16 .cse3 v_ArrVal_444))) (or (forall ((v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_27 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_arrayElimCell_24) v_arrayElimCell_27))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_arrayElimCell_23) .cse8)) (not (= (store (select .cse16 .cse3) .cse4 (select v_ArrVal_444 .cse4)) v_ArrVal_444)))))))) (.cse0 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (or .cse0 (and .cse1 (or .cse2 (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_439) .cse3) .cse4 v_DerPreprocessor_4) v_arrayElimCell_26)))))) (or (and (or .cse2 (forall ((v_arrayElimCell_26 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_439) .cse3) .cse4 v_DerPreprocessor_3) v_arrayElimCell_26)))) .cse1) .cse5) (or .cse6 .cse5) (or .cse6 .cse0) (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_439))) (or (forall ((v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_27 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse7 .cse3 v_ArrVal_444) v_arrayElimCell_24) v_arrayElimCell_27))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_444 .cse8)) (not (= (store (select .cse7 .cse3) .cse4 (select v_ArrVal_444 .cse4)) v_ArrVal_444))))) (or .cse2 (forall ((v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_439) .cse3) .cse8) |c_ULTIMATE.start_main_~data~0#1|))) (or (not .cse2) (forall ((v_arrayElimCell_24 (_ BitVec 32)) (v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_27 (_ BitVec 32)) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_439))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse9 .cse3 v_ArrVal_444) v_arrayElimCell_24) v_arrayElimCell_27)) (not (= (store (select .cse9 .cse3) .cse4 (select v_ArrVal_444 .cse4)) v_ArrVal_444))))))))))) is different from false [2023-12-24 21:33:01,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 117 [2023-12-24 21:33:01,462 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 121 treesize of output 93 [2023-12-24 21:33:01,511 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 13 treesize of output 1 [2023-12-24 21:33:02,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:33:02,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 351 treesize of output 369 [2023-12-24 21:33:02,885 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2023-12-24 21:33:02,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 289 treesize of output 304 [2023-12-24 21:33:03,360 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2023-12-24 21:33:03,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 278 treesize of output 282 [2023-12-24 21:33:03,420 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 262 treesize of output 260 [2023-12-24 21:33:03,437 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 260 treesize of output 256 [2023-12-24 21:33:03,453 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 256 treesize of output 254 [2023-12-24 21:33:06,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 21:33:07,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:33:07,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2023-12-24 21:33:08,040 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-24 21:33:08,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-24 21:33:08,145 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-24 21:33:08,199 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 13 treesize of output 7 [2023-12-24 21:33:08,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 21:33:08,299 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 13 treesize of output 7 [2023-12-24 21:33:08,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 21:33:08,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:33:08,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 11 [2023-12-24 21:33:08,396 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-24 21:33:08,437 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-24 21:33:08,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:33:08,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 113 [2023-12-24 21:33:10,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:33:10,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 64 [2023-12-24 21:33:10,343 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-24 21:33:10,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:33:10,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2023-12-24 21:33:10,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:33:10,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2023-12-24 21:33:10,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 21:33:10,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:33:10,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-12-24 21:33:10,740 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-24 21:33:10,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 21:33:10,805 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 120 treesize of output 118 [2023-12-24 21:33:10,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 21:33:10,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 21:33:10,858 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 246 treesize of output 242 [2023-12-24 21:33:10,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 21:33:10,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-24 21:33:10,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-24 21:33:10,974 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 120 treesize of output 118 [2023-12-24 21:33:10,981 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 527 treesize of output 517 [2023-12-24 21:33:11,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 21:33:13,884 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:33:13,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:33:13,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642621444] [2023-12-24 21:33:13,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642621444] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:33:13,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:33:13,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-12-24 21:33:13,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115579690] [2023-12-24 21:33:13,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:33:13,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-24 21:33:13,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:33:13,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-24 21:33:13,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=8, NotChecked=94, Total=702 [2023-12-24 21:33:13,888 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 27 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 26 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:33:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:33:22,978 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2023-12-24 21:33:22,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 21:33:22,979 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 26 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-24 21:33:22,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:33:22,979 INFO L225 Difference]: With dead ends: 31 [2023-12-24 21:33:22,980 INFO L226 Difference]: Without dead ends: 29 [2023-12-24 21:33:22,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=168, Invalid=875, Unknown=21, NotChecked=126, Total=1190 [2023-12-24 21:33:22,980 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 14 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 8 mSolverCounterUnsat, 32 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 32 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2023-12-24 21:33:22,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 105 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 330 Invalid, 32 Unknown, 55 Unchecked, 6.9s Time] [2023-12-24 21:33:22,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-24 21:33:22,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2023-12-24 21:33:22,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:33:22,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-12-24 21:33:22,983 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2023-12-24 21:33:22,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:33:22,984 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-12-24 21:33:22,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 26 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:33:22,984 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-12-24 21:33:22,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-24 21:33:22,984 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:33:22,984 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:33:22,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 21:33:23,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:33:23,192 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:33:23,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:33:23,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1334415555, now seen corresponding path program 1 times [2023-12-24 21:33:23,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:33:23,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46179954] [2023-12-24 21:33:23,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:33:23,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:33:23,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:33:23,194 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:33:23,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-24 21:33:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:33:23,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-24 21:33:23,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:33:23,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:33:23,448 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:33:23,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:33:23,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-12-24 21:33:23,536 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:33:23,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 46 [2023-12-24 21:33:23,681 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:33:23,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-24 21:33:23,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-24 21:33:23,854 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 13 treesize of output 16 [2023-12-24 21:33:23,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 37 [2023-12-24 21:33:24,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:33:24,012 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:33:24,015 INFO L349 Elim1Store]: treesize reduction 73, result has 1.4 percent of original size [2023-12-24 21:33:24,015 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 45 [2023-12-24 21:33:24,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:33:24,043 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 28 treesize of output 15 [2023-12-24 21:33:24,159 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 52 treesize of output 32 [2023-12-24 21:33:24,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-24 21:33:24,294 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-24 21:33:24,295 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 52 treesize of output 23 [2023-12-24 21:33:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:33:24,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:33:24,531 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 (_ BitVec 32)) (v_ArrVal_535 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse1 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse3 (store (select |c_#memory_$Pointer$#1.base| .cse3) (bvadd (_ bv8 32) (select .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) v_ArrVal_533)))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_535) .cse1) .cse2))))) (_ bv0 32)))) is different from false [2023-12-24 21:33:24,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:33:24,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 183 treesize of output 160 [2023-12-24 21:33:24,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:33:24,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 148 [2023-12-24 21:33:24,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:33:24,745 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 295 treesize of output 294 [2023-12-24 21:33:24,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 234 [2023-12-24 21:33:26,977 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 191 treesize of output 139 [2023-12-24 21:33:26,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 119 [2023-12-24 21:33:27,050 INFO L349 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2023-12-24 21:33:27,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 66 [2023-12-24 21:33:27,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:33:27,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 17 [2023-12-24 21:33:28,826 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 170 treesize of output 154 [2023-12-24 21:33:28,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:33:28,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2023-12-24 21:33:28,859 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:33:28,875 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:33:28,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 530 treesize of output 415 [2023-12-24 21:33:28,880 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:33:28,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:33:28,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 139 [2023-12-24 21:33:28,907 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 130 treesize of output 114 [2023-12-24 21:33:28,911 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 121 treesize of output 107 [2023-12-24 21:33:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:33:43,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:33:43,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46179954] [2023-12-24 21:33:43,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46179954] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:33:43,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:33:43,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2023-12-24 21:33:43,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646360804] [2023-12-24 21:33:43,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:33:43,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-24 21:33:43,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:33:43,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-24 21:33:43,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=502, Unknown=33, NotChecked=46, Total=650 [2023-12-24 21:33:43,981 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:34:00,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 21:34:01,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:34:01,848 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2023-12-24 21:34:01,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 21:34:01,848 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-24 21:34:01,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:34:01,849 INFO L225 Difference]: With dead ends: 37 [2023-12-24 21:34:01,849 INFO L226 Difference]: Without dead ends: 34 [2023-12-24 21:34:01,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=148, Invalid=801, Unknown=47, NotChecked=60, Total=1056 [2023-12-24 21:34:01,850 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2023-12-24 21:34:01,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 133 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 394 Invalid, 1 Unknown, 30 Unchecked, 12.4s Time] [2023-12-24 21:34:01,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-24 21:34:01,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2023-12-24 21:34:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:34:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-24 21:34:01,853 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 23 [2023-12-24 21:34:01,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:34:01,853 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-24 21:34:01,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:34:01,853 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-24 21:34:01,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-24 21:34:01,853 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:34:01,853 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:34:01,861 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 (9)] Ended with exit code 0 [2023-12-24 21:34:02,062 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 [2023-12-24 21:34:02,063 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:34:02,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:34:02,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1334413881, now seen corresponding path program 1 times [2023-12-24 21:34:02,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:34:02,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623461032] [2023-12-24 21:34:02,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:34:02,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:34:02,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:34:02,064 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:34:02,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-24 21:34:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:34:02,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 76 conjunts are in the unsatisfiable core [2023-12-24 21:34:02,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:34:02,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:34:02,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-12-24 21:34:02,374 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:34:02,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:34:02,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-24 21:34:02,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:34:02,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-12-24 21:34:02,529 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:34:02,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 77 [2023-12-24 21:34:02,544 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 31 treesize of output 16 [2023-12-24 21:34:02,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-12-24 21:34:02,701 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:34:02,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-24 21:34:02,838 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 13 treesize of output 16 [2023-12-24 21:34:02,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 35 [2023-12-24 21:34:02,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-12-24 21:34:02,876 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 13 treesize of output 16 [2023-12-24 21:34:02,887 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 31 treesize of output 20 [2023-12-24 21:34:02,999 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:34:03,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:34:03,003 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 21:34:03,003 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 1 case distinctions, treesize of input 94 treesize of output 45 [2023-12-24 21:34:03,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:34:03,011 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 32 treesize of output 19 [2023-12-24 21:34:03,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:34:03,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:34:03,037 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:34:03,038 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:34:03,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 32 [2023-12-24 21:34:03,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 42 [2023-12-24 21:34:03,332 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-24 21:34:03,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 33 [2023-12-24 21:34:03,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 21:34:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:34:03,427 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:34:03,773 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_642 (_ BitVec 32)) (v_ArrVal_641 (_ BitVec 32)) (v_ArrVal_645 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse7 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse9 (bvadd (_ bv8 32) (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| .cse0 (store (select |c_#memory_$Pointer$#1.offset| .cse0) .cse9 v_ArrVal_642))) (.cse1 (store |c_#memory_$Pointer$#1.base| .cse0 (store (select |c_#memory_$Pointer$#1.base| .cse0) .cse9 v_ArrVal_641))) (.cse5 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 .cse5) .cse6)))) (select (select (store |c_#memory_int#1| .cse0 v_ArrVal_645) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3)))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-12-24 21:34:03,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:34:03,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 425 treesize of output 384 [2023-12-24 21:34:03,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:34:03,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 371 treesize of output 330 [2023-12-24 21:34:04,344 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_642 (_ BitVec 32)) (v_ArrVal_641 (_ BitVec 32)) (v_ArrVal_645 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_635 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse0 (bvadd |c_ULTIMATE.start_node_create_~temp~0#1.offset| (_ bv4 32))) (.cse2 (select .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse1 (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (or (not (= (select v_arrayElimArr_13 .cse0) .cse1)) (not (= (select v_arrayElimArr_12 .cse0) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse12 (bvadd (_ bv8 32) .cse1))) (let ((.cse6 (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse13 .cse2 (store (select .cse13 .cse2) .cse12 v_ArrVal_642)))) (.cse3 (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse11 .cse2 (store (select .cse11 .cse2) .cse12 v_ArrVal_641)))) (.cse7 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (let ((.cse4 (select (select .cse3 .cse7) .cse8)) (.cse5 (bvadd (_ bv4 32) (select (select .cse6 .cse7) .cse8)))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_635) .cse2 v_ArrVal_645) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))))) is different from false [2023-12-24 21:34:04,672 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 232 treesize of output 172 [2023-12-24 21:34:04,675 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 180 treesize of output 148 [2023-12-24 21:34:04,732 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_642 (_ BitVec 32)) (v_ArrVal_641 (_ BitVec 32)) (v_ArrVal_645 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_node_create_~temp~0#1.base_21| (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_635 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select v_arrayElimArr_12 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_21| v_arrayElimArr_13))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 v_ArrVal_642)))) (.cse0 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_21| v_arrayElimArr_12))) (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 v_ArrVal_641))))) (let ((.cse1 (select (select .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_21|) (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_21|) (_ bv4 32))))) (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_node_create_~temp~0#1.base_21| v_ArrVal_635) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_645) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) (not (= (select v_arrayElimArr_13 (_ bv4 32)) |c_ULTIMATE.start_dll_create_~head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_21|) (_ bv0 1))))) is different from false [2023-12-24 21:34:04,850 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_642 (_ BitVec 32)) (v_ArrVal_641 (_ BitVec 32)) (v_ArrVal_645 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_node_create_~temp~0#1.base_21| (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_635 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_12 (_ bv4 32))) (.cse0 (select v_arrayElimArr_13 (_ bv4 32)))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_21|) (_ bv0 1))) (= (let ((.cse7 (bvadd .cse0 (_ bv8 32)))) (let ((.cse5 (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_21| v_arrayElimArr_13))) (store .cse8 .cse1 (store (select .cse8 .cse1) .cse7 v_ArrVal_642)))) (.cse2 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_21| v_arrayElimArr_12))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse7 v_ArrVal_641))))) (let ((.cse3 (select (select .cse2 |v_ULTIMATE.start_node_create_~temp~0#1.base_21|) (_ bv4 32))) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_21|) (_ bv4 32))))) (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_node_create_~temp~0#1.base_21| v_ArrVal_635) .cse1 v_ArrVal_645) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))) |c_ULTIMATE.start_main_~data~0#1|)))) is different from false [2023-12-24 21:34:05,034 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_629 (_ BitVec 32)) (v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_642 (_ BitVec 32)) (v_ArrVal_641 (_ BitVec 32)) (v_ArrVal_645 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_node_create_~temp~0#1.base_21| (_ BitVec 32)) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_635 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select v_arrayElimArr_13 (_ bv4 32))) (.cse0 (select v_arrayElimArr_12 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (bvadd .cse8 (_ bv8 32)))) (let ((.cse4 (let ((.cse7 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_627) |v_ULTIMATE.start_node_create_~temp~0#1.base_21| v_arrayElimArr_13))) (store .cse7 .cse0 (store (select .cse7 .cse0) .cse6 v_ArrVal_642)))) (.cse1 (let ((.cse5 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_631) |v_ULTIMATE.start_node_create_~temp~0#1.base_21| v_arrayElimArr_12))) (store .cse5 .cse0 (store (select .cse5 .cse0) .cse6 v_ArrVal_641))))) (let ((.cse2 (select (select .cse1 |v_ULTIMATE.start_node_create_~temp~0#1.base_21|) (_ bv4 32))) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_21|) (_ bv4 32))))) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) v_ArrVal_629)) |v_ULTIMATE.start_node_create_~temp~0#1.base_21| v_ArrVal_635) .cse0 v_ArrVal_645) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3)))))) (not (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_21|) (_ bv0 1)))))) is different from false [2023-12-24 21:34:05,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:34:05,160 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 407 treesize of output 338 [2023-12-24 21:34:05,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:34:05,305 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 317 treesize of output 248 [2023-12-24 21:34:06,291 INFO L349 Elim1Store]: treesize reduction 34, result has 67.0 percent of original size [2023-12-24 21:34:06,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 63368 treesize of output 62507 [2023-12-24 21:34:06,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:34:06,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 8226 treesize of output 6714 [2023-12-24 21:34:06,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:34:06,822 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 196779 treesize of output 194597 [2023-12-24 21:34:07,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:34:07,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3245 treesize of output 3255 [2023-12-24 21:34:07,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:34:07,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3144 treesize of output 3132 [2023-12-24 21:34:07,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:34:07,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 4158 treesize of output 3926 [2023-12-24 21:34:08,027 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 78 treesize of output 74 [2023-12-24 21:34:08,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:34:08,541 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 178 treesize of output 184 [2023-12-24 21:34:09,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:34:09,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 3064 treesize of output 3090 [2023-12-24 21:34:09,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:34:09,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3016 treesize of output 3000 [2023-12-24 21:40:54,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 Received shutdown request... [2023-12-24 21:47:24,465 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 (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 21:47:24,475 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 21:47:25,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-24 21:47:25,569 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 21:47:25,569 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 24 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-24 21:47:25,572 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:47:25,574 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 21:47:25,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 09:47:25 BoogieIcfgContainer [2023-12-24 21:47:25,577 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 21:47:25,577 INFO L158 Benchmark]: Toolchain (without parser) took 871958.67ms. Allocated memory was 212.9MB in the beginning and 941.6MB in the end (delta: 728.8MB). Free memory was 163.6MB in the beginning and 860.2MB in the end (delta: -696.6MB). Peak memory consumption was 564.6MB. Max. memory is 8.0GB. [2023-12-24 21:47:25,577 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 212.9MB. Free memory was 166.8MB in the beginning and 166.7MB in the end (delta: 174.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 21:47:25,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.04ms. Allocated memory is still 212.9MB. Free memory was 163.2MB in the beginning and 143.9MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-24 21:47:25,578 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.63ms. Allocated memory is still 212.9MB. Free memory was 143.9MB in the beginning and 141.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 21:47:25,579 INFO L158 Benchmark]: Boogie Preprocessor took 58.50ms. Allocated memory is still 212.9MB. Free memory was 141.5MB in the beginning and 138.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-24 21:47:25,579 INFO L158 Benchmark]: RCFGBuilder took 504.90ms. Allocated memory was 212.9MB in the beginning and 314.6MB in the end (delta: 101.7MB). Free memory was 138.0MB in the beginning and 275.4MB in the end (delta: -137.4MB). Peak memory consumption was 24.4MB. Max. memory is 8.0GB. [2023-12-24 21:47:25,580 INFO L158 Benchmark]: TraceAbstraction took 871004.55ms. Allocated memory was 314.6MB in the beginning and 941.6MB in the end (delta: 627.0MB). Free memory was 274.9MB in the beginning and 860.2MB in the end (delta: -585.3MB). Peak memory consumption was 572.7MB. Max. memory is 8.0GB. [2023-12-24 21:47:25,581 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.12ms. Allocated memory is still 212.9MB. Free memory was 166.8MB in the beginning and 166.7MB in the end (delta: 174.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 338.04ms. Allocated memory is still 212.9MB. Free memory was 163.2MB in the beginning and 143.9MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.63ms. Allocated memory is still 212.9MB. Free memory was 143.9MB in the beginning and 141.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.50ms. Allocated memory is still 212.9MB. Free memory was 141.5MB in the beginning and 138.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 504.90ms. Allocated memory was 212.9MB in the beginning and 314.6MB in the end (delta: 101.7MB). Free memory was 138.0MB in the beginning and 275.4MB in the end (delta: -137.4MB). Peak memory consumption was 24.4MB. Max. memory is 8.0GB. * TraceAbstraction took 871004.55ms. Allocated memory was 314.6MB in the beginning and 941.6MB in the end (delta: 627.0MB). Free memory was 274.9MB in the beginning and 860.2MB in the end (delta: -585.3MB). Peak memory consumption was 572.7MB. 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: 643]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 643). Cancelled while NwaCegarLoop was analyzing trace of length 24 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 871.0s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 33 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 20.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 482 SdHoareTripleChecker+Invalid, 20.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 85 IncrementalHoareTripleChecker+Unchecked, 368 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 955 IncrementalHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 114 mSDtfsCounter, 955 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 29.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=8, InterpolantAutomatonStates: 63, 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, 8 MinimizatonAttempts, 24 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 36.0s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 177 ConstructedInterpolants, 32 QuantifiedInterpolants, 7334 SizeOfPredicates, 76 NumberOfNonLiveVariables, 1284 ConjunctsInSsa, 182 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 24/47 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