/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-ext3-properties/dll_nullified-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:52:51,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:52:52,023 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:52:52,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:52:52,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:52:52,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:52:52,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:52:52,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:52:52,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:52:52,068 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:52:52,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:52:52,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:52:52,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:52:52,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:52:52,070 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:52:52,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:52:52,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:52:52,071 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:52:52,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:52:52,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:52:52,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:52:52,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:52:52,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:52:52,073 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:52:52,073 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:52:52,073 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:52:52,074 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:52:52,074 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:52:52,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:52:52,074 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:52:52,075 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:52:52,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:52:52,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:52:52,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:52:52,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:52:52,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:52:52,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:52:52,076 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:52:52,076 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:52:52,076 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:52:52,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:52:52,076 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:52:52,076 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:52:52,076 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:52:52,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:52:52,077 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:52:52,077 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:52:52,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:52:52,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:52:52,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:52:52,306 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:52:52,307 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:52:52,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i [2023-12-24 21:52:53,351 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:52:53,562 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:52:53,562 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i [2023-12-24 21:52:53,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd966239f/3fcd7ee77d2a4bd3954dd34f163dbb8e/FLAGd7a95d004 [2023-12-24 21:52:53,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd966239f/3fcd7ee77d2a4bd3954dd34f163dbb8e [2023-12-24 21:52:53,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:52:53,592 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:52:53,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:52:53,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:52:53,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:52:53,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:52:53" (1/1) ... [2023-12-24 21:52:53,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142d9968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:53, skipping insertion in model container [2023-12-24 21:52:53,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:52:53" (1/1) ... [2023-12-24 21:52:53,624 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:52:53,812 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-ext3-properties/dll_nullified-1.i[24046,24059] [2023-12-24 21:52:53,816 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:52:53,836 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:52:53,884 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-ext3-properties/dll_nullified-1.i[24046,24059] [2023-12-24 21:52:53,884 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:52:53,905 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:52:53,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:53 WrapperNode [2023-12-24 21:52:53,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:52:53,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:52:53,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:52:53,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:52:53,911 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:52:53" (1/1) ... [2023-12-24 21:52:53,922 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:52:53" (1/1) ... [2023-12-24 21:52:53,939 INFO L138 Inliner]: procedures = 126, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 112 [2023-12-24 21:52:53,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:52:53,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:52:53,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:52:53,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:52:53,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:53" (1/1) ... [2023-12-24 21:52:53,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:53" (1/1) ... [2023-12-24 21:52:53,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:53" (1/1) ... [2023-12-24 21:52:53,986 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2023-12-24 21:52:53,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:53" (1/1) ... [2023-12-24 21:52:53,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:53" (1/1) ... [2023-12-24 21:52:53,995 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:53" (1/1) ... [2023-12-24 21:52:53,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:53" (1/1) ... [2023-12-24 21:52:53,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:53" (1/1) ... [2023-12-24 21:52:53,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:53" (1/1) ... [2023-12-24 21:52:54,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:52:54,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:52:54,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:52:54,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:52:54,003 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:53" (1/1) ... [2023-12-24 21:52:54,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:52:54,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:52:54,065 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:52:54,085 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:52:54,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 21:52:54,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 21:52:54,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 21:52:54,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:52:54,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 21:52:54,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 21:52:54,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 21:52:54,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 21:52:54,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 21:52:54,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 21:52:54,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 21:52:54,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:52:54,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:52:54,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:52:54,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:52:54,199 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:52:54,200 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:52:54,736 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:52:54,761 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:52:54,762 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-24 21:52:54,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:52:54 BoogieIcfgContainer [2023-12-24 21:52:54,762 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:52:54,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:52:54,764 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:52:54,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:52:54,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:52:53" (1/3) ... [2023-12-24 21:52:54,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37731e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:52:54, skipping insertion in model container [2023-12-24 21:52:54,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:53" (2/3) ... [2023-12-24 21:52:54,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37731e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:52:54, skipping insertion in model container [2023-12-24 21:52:54,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:52:54" (3/3) ... [2023-12-24 21:52:54,768 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2023-12-24 21:52:54,781 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:52:54,782 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 21:52:54,811 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:52:54,816 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;@2c58afe8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:52:54,816 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 21:52:54,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 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:52:54,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-24 21:52:54,823 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:52:54,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:52:54,824 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:52:54,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:52:54,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1329840781, now seen corresponding path program 1 times [2023-12-24 21:52:54,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:52:54,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060909010] [2023-12-24 21:52:54,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:52:54,837 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:52:54,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:52:54,839 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:52:54,847 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:52:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:52:54,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:52:54,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:52:54,980 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:52:54,981 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:52:54,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:52:54,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060909010] [2023-12-24 21:52:54,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060909010] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:52:54,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:52:54,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:52:54,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731553574] [2023-12-24 21:52:54,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:52:54,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:52:54,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:52:55,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:52:55,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:52:55,019 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 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) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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:52:55,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:52:55,424 INFO L93 Difference]: Finished difference Result 45 states and 71 transitions. [2023-12-24 21:52:55,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:52:55,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2023-12-24 21:52:55,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:52:55,430 INFO L225 Difference]: With dead ends: 45 [2023-12-24 21:52:55,431 INFO L226 Difference]: Without dead ends: 23 [2023-12-24 21:52:55,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:52:55,435 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 51 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.4s IncrementalHoareTripleChecker+Time [2023-12-24 21:52:55,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 51 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 21:52:55,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-24 21:52:55,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-12-24 21:52:55,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 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:52:55,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2023-12-24 21:52:55,455 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 10 [2023-12-24 21:52:55,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:52:55,456 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2023-12-24 21:52:55,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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:52:55,456 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2023-12-24 21:52:55,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-24 21:52:55,456 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:52:55,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:52:55,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 21:52:55,659 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:52:55,659 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:52:55,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:52:55,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1023865075, now seen corresponding path program 1 times [2023-12-24 21:52:55,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:52:55,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808953375] [2023-12-24 21:52:55,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:52:55,661 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:52:55,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:52:55,662 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:52:55,689 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:52:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:52:55,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 21:52:55,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:52:55,773 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:52:55,773 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:52:55,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:52:55,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808953375] [2023-12-24 21:52:55,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808953375] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:52:55,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:52:55,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:52:55,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170994068] [2023-12-24 21:52:55,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:52:55,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:52:55,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:52:55,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:52:55,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:52:55,776 INFO L87 Difference]: Start difference. First operand 20 states and 28 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:52:56,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:52:56,522 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2023-12-24 21:52:56,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:52:56,523 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:52:56,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:52:56,523 INFO L225 Difference]: With dead ends: 41 [2023-12-24 21:52:56,523 INFO L226 Difference]: Without dead ends: 23 [2023-12-24 21:52:56,524 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:52:56,524 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 21:52:56,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 21:52:56,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-24 21:52:56,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2023-12-24 21:52:56,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 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:52:56,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2023-12-24 21:52:56,528 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 14 [2023-12-24 21:52:56,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:52:56,528 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-12-24 21:52:56,528 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:52:56,528 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2023-12-24 21:52:56,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-24 21:52:56,529 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:52:56,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:52:56,544 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:52:56,733 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:52:56,735 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:52:56,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:52:56,736 INFO L85 PathProgramCache]: Analyzing trace with hash -322800497, now seen corresponding path program 1 times [2023-12-24 21:52:56,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:52:56,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005719668] [2023-12-24 21:52:56,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:52:56,737 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:52:56,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:52:56,738 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:52:56,739 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:52:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:52:56,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 21:52:56,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:52:56,853 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:52:56,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:52:56,896 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:52:56,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:52:56,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005719668] [2023-12-24 21:52:56,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005719668] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:52:56,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:52:56,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-24 21:52:56,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131470841] [2023-12-24 21:52:56,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:52:56,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 21:52:56,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:52:56,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 21:52:56,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:52:56,904 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:52:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:52:59,113 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2023-12-24 21:52:59,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 21:52:59,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:52:59,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:52:59,115 INFO L225 Difference]: With dead ends: 46 [2023-12-24 21:52:59,115 INFO L226 Difference]: Without dead ends: 32 [2023-12-24 21:52:59,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-24 21:52:59,116 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:52:59,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 86 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-24 21:52:59,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-24 21:52:59,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-24 21:52:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 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:52:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2023-12-24 21:52:59,120 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 14 [2023-12-24 21:52:59,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:52:59,120 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2023-12-24 21:52:59,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:52:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2023-12-24 21:52:59,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-24 21:52:59,121 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:52:59,121 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:52:59,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-24 21:52:59,324 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:52:59,324 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:52:59,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:52:59,325 INFO L85 PathProgramCache]: Analyzing trace with hash 874424079, now seen corresponding path program 1 times [2023-12-24 21:52:59,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:52:59,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834380582] [2023-12-24 21:52:59,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:52:59,326 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:52:59,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:52:59,327 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:52:59,333 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:52:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:52:59,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 21:52:59,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:52:59,573 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:52:59,573 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:52:59,690 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:52:59,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:52:59,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834380582] [2023-12-24 21:52:59,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834380582] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:52:59,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:52:59,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-24 21:52:59,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141569092] [2023-12-24 21:52:59,691 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:52:59,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 21:52:59,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:52:59,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 21:52:59,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-24 21:52:59,694 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 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:53:11,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:53:11,981 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2023-12-24 21:53:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 21:53:11,981 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 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 26 [2023-12-24 21:53:11,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:53:11,982 INFO L225 Difference]: With dead ends: 53 [2023-12-24 21:53:11,982 INFO L226 Difference]: Without dead ends: 39 [2023-12-24 21:53:11,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-24 21:53:11,983 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 20 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:53:11,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 166 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2023-12-24 21:53:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-24 21:53:11,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2023-12-24 21:53:11,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 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:53:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2023-12-24 21:53:11,987 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 26 [2023-12-24 21:53:11,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:53:11,987 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2023-12-24 21:53:11,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 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:53:11,987 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2023-12-24 21:53:11,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-24 21:53:11,988 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:53:11,988 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:53:11,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 21:53:12,192 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:53:12,193 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:53:12,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:53:12,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1055515279, now seen corresponding path program 2 times [2023-12-24 21:53:12,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:53:12,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626309748] [2023-12-24 21:53:12,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:53:12,194 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:53:12,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:53:12,195 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:53:12,204 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:53:12,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:53:12,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:53:12,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 21:53:12,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:53:12,571 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:53:12,608 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 21:53:12,609 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 13 treesize of output 13 [2023-12-24 21:53:12,642 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 82 treesize of output 77 [2023-12-24 21:53:12,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 112 [2023-12-24 21:53:12,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:12,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 143 [2023-12-24 21:53:12,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:12,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 53 [2023-12-24 21:53:12,949 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 62 treesize of output 47 [2023-12-24 21:53:13,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:13,152 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 75 treesize of output 35 [2023-12-24 21:53:13,170 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 21:53:13,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:53:13,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 82 [2023-12-24 21:53:13,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:13,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 62 treesize of output 123 [2023-12-24 21:53:13,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-12-24 21:53:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 3 refuted. 1 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 21:53:13,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:53:13,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626309748] [2023-12-24 21:53:13,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626309748] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:53:13,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:53:13,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2023-12-24 21:53:13,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918744039] [2023-12-24 21:53:13,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:53:13,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 21:53:13,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:53:13,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 21:53:13,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=145, Unknown=4, NotChecked=0, Total=182 [2023-12-24 21:53:13,465 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 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:53:15,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 21:53:18,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:53:18,320 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2023-12-24 21:53:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 21:53:18,320 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 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 30 [2023-12-24 21:53:18,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:53:18,321 INFO L225 Difference]: With dead ends: 62 [2023-12-24 21:53:18,321 INFO L226 Difference]: Without dead ends: 49 [2023-12-24 21:53:18,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=267, Unknown=5, NotChecked=0, Total=342 [2023-12-24 21:53:18,322 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-24 21:53:18,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 125 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-12-24 21:53:18,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-24 21:53:18,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2023-12-24 21:53:18,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 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:53:18,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2023-12-24 21:53:18,327 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 30 [2023-12-24 21:53:18,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:53:18,327 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2023-12-24 21:53:18,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 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:53:18,327 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2023-12-24 21:53:18,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-24 21:53:18,328 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:53:18,328 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:53:18,337 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:53:18,528 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:53:18,529 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:53:18,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:53:18,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1057362321, now seen corresponding path program 1 times [2023-12-24 21:53:18,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:53:18,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250293575] [2023-12-24 21:53:18,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:53:18,529 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:53:18,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:53:18,530 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:53:18,532 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:53:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:53:18,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-24 21:53:18,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:53:18,922 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:53:18,943 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 21:53:18,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-24 21:53:18,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 7 [2023-12-24 21:53:18,988 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:53:19,065 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 21:53:19,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:53:19,143 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_517) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) is different from false [2023-12-24 21:53:19,151 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 67 treesize of output 65 [2023-12-24 21:53:19,153 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:53:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 1 not checked. [2023-12-24 21:53:19,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:53:19,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250293575] [2023-12-24 21:53:19,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250293575] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:53:19,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:53:19,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2023-12-24 21:53:19,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801576661] [2023-12-24 21:53:19,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:53:19,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-24 21:53:19,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:53:19,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-24 21:53:19,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2023-12-24 21:53:19,182 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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:53:27,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:53:27,188 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2023-12-24 21:53:27,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 21:53:27,189 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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 30 [2023-12-24 21:53:27,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:53:27,189 INFO L225 Difference]: With dead ends: 63 [2023-12-24 21:53:27,189 INFO L226 Difference]: Without dead ends: 50 [2023-12-24 21:53:27,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=443, Unknown=1, NotChecked=44, Total=600 [2023-12-24 21:53:27,191 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-12-24 21:53:27,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 119 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 200 Invalid, 0 Unknown, 38 Unchecked, 7.8s Time] [2023-12-24 21:53:27,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-24 21:53:27,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2023-12-24 21:53:27,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 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:53:27,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2023-12-24 21:53:27,196 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 30 [2023-12-24 21:53:27,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:53:27,196 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2023-12-24 21:53:27,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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:53:27,196 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2023-12-24 21:53:27,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-24 21:53:27,196 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:53:27,197 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:53:27,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-24 21:53:27,403 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:53:27,404 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:53:27,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:53:27,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1057364243, now seen corresponding path program 1 times [2023-12-24 21:53:27,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:53:27,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836753050] [2023-12-24 21:53:27,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:53:27,405 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:53:27,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:53:27,412 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:53:27,416 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:53:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-24 21:53:27,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-24 21:53:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-24 21:53:28,003 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-24 21:53:28,004 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-24 21:53:28,004 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 21:53:28,014 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 (8)] Ended with exit code 0 [2023-12-24 21:53:28,206 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:53:28,209 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-12-24 21:53:28,211 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 21:53:28,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 09:53:28 BoogieIcfgContainer [2023-12-24 21:53:28,246 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 21:53:28,246 INFO L158 Benchmark]: Toolchain (without parser) took 34653.76ms. Allocated memory was 213.9MB in the beginning and 265.3MB in the end (delta: 51.4MB). Free memory was 157.0MB in the beginning and 174.4MB in the end (delta: -17.4MB). Peak memory consumption was 35.4MB. Max. memory is 8.0GB. [2023-12-24 21:53:28,246 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 213.9MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 21:53:28,246 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.38ms. Allocated memory is still 213.9MB. Free memory was 156.8MB in the beginning and 137.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-24 21:53:28,246 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.40ms. Allocated memory is still 213.9MB. Free memory was 137.9MB in the beginning and 135.8MB in the end (delta: 2.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 21:53:28,247 INFO L158 Benchmark]: Boogie Preprocessor took 62.27ms. Allocated memory is still 213.9MB. Free memory was 135.5MB in the beginning and 183.3MB in the end (delta: -47.7MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. [2023-12-24 21:53:28,247 INFO L158 Benchmark]: RCFGBuilder took 759.66ms. Allocated memory is still 213.9MB. Free memory was 183.3MB in the beginning and 165.5MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-24 21:53:28,247 INFO L158 Benchmark]: TraceAbstraction took 33482.14ms. Allocated memory was 213.9MB in the beginning and 265.3MB in the end (delta: 51.4MB). Free memory was 164.4MB in the beginning and 174.4MB in the end (delta: -10.0MB). Peak memory consumption was 41.4MB. Max. memory is 8.0GB. [2023-12-24 21:53:28,248 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.49ms. Allocated memory is still 213.9MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 312.38ms. Allocated memory is still 213.9MB. Free memory was 156.8MB in the beginning and 137.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.40ms. Allocated memory is still 213.9MB. Free memory was 137.9MB in the beginning and 135.8MB in the end (delta: 2.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.27ms. Allocated memory is still 213.9MB. Free memory was 135.5MB in the beginning and 183.3MB in the end (delta: -47.7MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. * RCFGBuilder took 759.66ms. Allocated memory is still 213.9MB. Free memory was 183.3MB in the beginning and 165.5MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 33482.14ms. Allocated memory was 213.9MB in the beginning and 265.3MB in the end (delta: 51.4MB). Free memory was 164.4MB in the beginning and 174.4MB in the end (delta: -10.0MB). Peak memory consumption was 41.4MB. 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 - CounterExampleResult [Line: 616]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L599] const int len = 5; [L600] CALL, EXPR dll_create(len) [L579] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE, EXPR !(((void *)0) == new_head) [L585] EXPR new_head->data_0 = 0 [L586] EXPR new_head->data_1 = 0 [L587] EXPR new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] EXPR new_head->next = head [L589] EXPR new_head->prev = ((void *)0) [L590] COND FALSE, EXPR !(\read(head)) [L593] EXPR head = new_head [L594] EXPR len-- [L580-L595] { DLL new_head = (DLL) malloc(sizeof(struct node)); if(((void *)0) == new_head) { myexit(1); } new_head->data_0 = 0; new_head->data_1 = 0; new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0; new_head->next = head; new_head->prev = ((void *)0); if(head) { head->prev = new_head; } head = new_head; len--; } [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE, EXPR !(((void *)0) == new_head) [L585] EXPR new_head->data_0 = 0 [L586] EXPR new_head->data_1 = 0 [L587] EXPR new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] EXPR new_head->next = head [L589] EXPR new_head->prev = ((void *)0) [L590] COND TRUE, EXPR \read(head) [L591] EXPR head->prev = new_head [L593] EXPR head = new_head [L594] EXPR len-- [L580-L595] { DLL new_head = (DLL) malloc(sizeof(struct node)); if(((void *)0) == new_head) { myexit(1); } new_head->data_0 = 0; new_head->data_1 = 0; new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0; new_head->next = head; new_head->prev = ((void *)0); if(head) { head->prev = new_head; } head = new_head; len--; } [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE, EXPR !(((void *)0) == new_head) [L585] EXPR new_head->data_0 = 0 [L586] EXPR new_head->data_1 = 0 [L587] EXPR new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] EXPR new_head->next = head [L589] EXPR new_head->prev = ((void *)0) [L590] COND TRUE, EXPR \read(head) [L591] EXPR head->prev = new_head [L593] EXPR head = new_head [L594] EXPR len-- [L580-L595] { DLL new_head = (DLL) malloc(sizeof(struct node)); if(((void *)0) == new_head) { myexit(1); } new_head->data_0 = 0; new_head->data_1 = 0; new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0; new_head->next = head; new_head->prev = ((void *)0); if(head) { head->prev = new_head; } head = new_head; len--; } [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE, EXPR !(((void *)0) == new_head) [L585] EXPR new_head->data_0 = 0 [L586] EXPR new_head->data_1 = 0 [L587] EXPR new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] EXPR new_head->next = head [L589] EXPR new_head->prev = ((void *)0) [L590] COND TRUE, EXPR \read(head) [L591] EXPR head->prev = new_head [L593] EXPR head = new_head [L594] EXPR len-- [L580-L595] { DLL new_head = (DLL) malloc(sizeof(struct node)); if(((void *)0) == new_head) { myexit(1); } new_head->data_0 = 0; new_head->data_1 = 0; new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0; new_head->next = head; new_head->prev = ((void *)0); if(head) { head->prev = new_head; } head = new_head; len--; } [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE, EXPR !(((void *)0) == new_head) [L585] EXPR new_head->data_0 = 0 [L586] EXPR new_head->data_1 = 0 [L587] EXPR new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] EXPR new_head->next = head [L589] EXPR new_head->prev = ((void *)0) [L590] COND TRUE, EXPR \read(head) [L591] EXPR head->prev = new_head [L593] EXPR head = new_head [L594] EXPR len-- [L580-L595] { DLL new_head = (DLL) malloc(sizeof(struct node)); if(((void *)0) == new_head) { myexit(1); } new_head->data_0 = 0; new_head->data_1 = 0; new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0; new_head->next = head; new_head->prev = ((void *)0); if(head) { head->prev = new_head; } head = new_head; len--; } [L580] COND FALSE !(len > 0) VAL [\old(len)=5, head={10:0}, len=0] [L596] return head; [L600] RET, EXPR dll_create(len) [L600] DLL head = dll_create(len); [L601] head->next [L601] COND TRUE head->next [L602] EXPR head->data_0 [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [head={10:0}, len=5] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 [L602] EXPR head->data_1 [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [head={10:0}, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [head={10:0}, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L602] EXPR head->data_2 [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [head={10:0}, len=5] [L602] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L616] reach_error() VAL [head={10:0}, len=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.4s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 28.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 28.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 591 SdHoareTripleChecker+Invalid, 27.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 38 IncrementalHoareTripleChecker+Unchecked, 466 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 545 IncrementalHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 125 mSDtfsCounter, 545 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 173 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=6, InterpolantAutomatonStates: 42, 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, 6 MinimizatonAttempts, 26 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 214 ConstructedInterpolants, 2 QuantifiedInterpolants, 971 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1084 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 165/239 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 proved your program to be incorrect! [2023-12-24 21:53:28,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...