/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/ldv-regression/rule60_list2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:15:13,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:15:13,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 16:15:13,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:15:13,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:15:13,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:15:13,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:15:13,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:15:13,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:15:13,976 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:15:13,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:15:13,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:15:13,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:15:13,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:15:13,978 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:15:13,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:15:13,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:15:13,979 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:15:13,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:15:13,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:15:13,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:15:13,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:15:13,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:15:13,981 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:15:13,981 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:15:13,981 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:15:13,981 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:15:13,981 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:15:13,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:15:13,982 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:15:13,983 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:15:13,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:15:13,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:15:13,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:15:13,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:15:13,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:15:13,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:15:13,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:15:13,984 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:15:13,984 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:15:13,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:15:13,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:15:13,985 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:15:13,985 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:15:13,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:15:13,985 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:15:13,985 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 16:15:14,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:15:14,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:15:14,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:15:14,245 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:15:14,247 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:15:14,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list2.i [2023-12-16 16:15:15,487 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:15:15,719 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:15:15,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.i [2023-12-16 16:15:15,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b939be3e/ac6d240ca39a488d865336481ec79aae/FLAGf2ff4b545 [2023-12-16 16:15:15,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b939be3e/ac6d240ca39a488d865336481ec79aae [2023-12-16 16:15:15,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:15:15,746 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:15:15,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:15:15,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:15:15,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:15:15,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:15:15" (1/1) ... [2023-12-16 16:15:15,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef0f96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:15, skipping insertion in model container [2023-12-16 16:15:15,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:15:15" (1/1) ... [2023-12-16 16:15:15,792 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:15:15,943 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.i[292,305] [2023-12-16 16:15:16,048 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:15:16,073 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:15:16,086 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.i[292,305] [2023-12-16 16:15:16,136 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:15:16,175 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:15:16,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:16 WrapperNode [2023-12-16 16:15:16,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:15:16,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:15:16,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:15:16,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:15:16,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:16" (1/1) ... [2023-12-16 16:15:16,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:16" (1/1) ... [2023-12-16 16:15:16,213 INFO L138 Inliner]: procedures = 127, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 54 [2023-12-16 16:15:16,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:15:16,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:15:16,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:15:16,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:15:16,222 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:16" (1/1) ... [2023-12-16 16:15:16,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:16" (1/1) ... [2023-12-16 16:15:16,226 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:16" (1/1) ... [2023-12-16 16:15:16,245 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 0, 2]. 50 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 0, 2]. The 0 writes are split as follows [0, 0, 0]. [2023-12-16 16:15:16,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:16" (1/1) ... [2023-12-16 16:15:16,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:16" (1/1) ... [2023-12-16 16:15:16,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:16" (1/1) ... [2023-12-16 16:15:16,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:16" (1/1) ... [2023-12-16 16:15:16,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:16" (1/1) ... [2023-12-16 16:15:16,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:16" (1/1) ... [2023-12-16 16:15:16,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:15:16,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:15:16,261 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:15:16,261 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:15:16,262 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:16" (1/1) ... [2023-12-16 16:15:16,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:15:16,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:15:16,301 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 16:15:16,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 16:15:16,334 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2023-12-16 16:15:16,334 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2023-12-16 16:15:16,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:15:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-12-16 16:15:16,336 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-12-16 16:15:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-16 16:15:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-16 16:15:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-16 16:15:16,337 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2023-12-16 16:15:16,337 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2023-12-16 16:15:16,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:15:16,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 16:15:16,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 16:15:16,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:15:16,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:15:16,472 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:15:16,474 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:15:16,665 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:15:16,695 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:15:16,696 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-16 16:15:16,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:15:16 BoogieIcfgContainer [2023-12-16 16:15:16,696 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:15:16,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:15:16,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:15:16,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:15:16,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:15:15" (1/3) ... [2023-12-16 16:15:16,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e56bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:15:16, skipping insertion in model container [2023-12-16 16:15:16,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:16" (2/3) ... [2023-12-16 16:15:16,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e56bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:15:16, skipping insertion in model container [2023-12-16 16:15:16,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:15:16" (3/3) ... [2023-12-16 16:15:16,704 INFO L112 eAbstractionObserver]: Analyzing ICFG rule60_list2.i [2023-12-16 16:15:16,721 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:15:16,721 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:15:16,754 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:15:16,759 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;@63a62be2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:15:16,759 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:15:16,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.368421052631579) internal successors, (26), 23 states have internal predecessors, (26), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-16 16:15:16,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-16 16:15:16,771 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:16,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-16 16:15:16,775 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:16,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:16,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1025696134, now seen corresponding path program 1 times [2023-12-16 16:15:16,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:16,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055234428] [2023-12-16 16:15:16,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:16,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:16,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:16,798 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:15:16,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 16:15:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:15:16,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:15:16,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:16,946 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-16 16:15:16,946 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:15:16,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:16,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055234428] [2023-12-16 16:15:16,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055234428] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:15:16,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:15:16,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:15:16,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209967555] [2023-12-16 16:15:16,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:15:16,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:15:16,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:16,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:15:16,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:15:16,977 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.368421052631579) internal successors, (26), 23 states have internal predecessors, (26), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:15:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:17,047 INFO L93 Difference]: Finished difference Result 58 states and 80 transitions. [2023-12-16 16:15:17,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:15:17,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-16 16:15:17,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:17,057 INFO L225 Difference]: With dead ends: 58 [2023-12-16 16:15:17,057 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 16:15:17,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:15:17,065 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:17,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 76 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:15:17,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 16:15:17,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-16 16:15:17,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 16:15:17,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2023-12-16 16:15:17,108 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 6 [2023-12-16 16:15:17,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:17,109 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2023-12-16 16:15:17,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:15:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2023-12-16 16:15:17,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 16:15:17,113 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:17,113 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:17,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 16:15:17,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:17,318 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:17,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:17,318 INFO L85 PathProgramCache]: Analyzing trace with hash 754202811, now seen corresponding path program 1 times [2023-12-16 16:15:17,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:17,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854643091] [2023-12-16 16:15:17,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:17,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:17,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:17,321 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:15:17,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 16:15:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:15:17,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 16:15:17,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 16:15:17,549 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:15:17,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:17,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854643091] [2023-12-16 16:15:17,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854643091] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:15:17,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:15:17,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 16:15:17,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862198069] [2023-12-16 16:15:17,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:15:17,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:15:17,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:17,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:15:17,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:15:17,552 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 16:15:17,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:17,598 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2023-12-16 16:15:17,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:15:17,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-12-16 16:15:17,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:17,601 INFO L225 Difference]: With dead ends: 46 [2023-12-16 16:15:17,601 INFO L226 Difference]: Without dead ends: 29 [2023-12-16 16:15:17,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:15:17,603 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:17,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 140 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:15:17,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-16 16:15:17,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-16 16:15:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-16 16:15:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-12-16 16:15:17,610 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 23 [2023-12-16 16:15:17,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:17,610 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-12-16 16:15:17,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 16:15:17,611 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-12-16 16:15:17,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 16:15:17,611 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:17,612 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:17,616 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 (3)] Ended with exit code 0 [2023-12-16 16:15:17,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:17,816 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:17,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:17,816 INFO L85 PathProgramCache]: Analyzing trace with hash 361175801, now seen corresponding path program 1 times [2023-12-16 16:15:17,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:17,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351368196] [2023-12-16 16:15:17,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:17,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:17,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:17,819 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:15:17,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 16:15:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:15:17,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 16:15:17,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 16:15:17,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:15:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 16:15:18,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:18,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351368196] [2023-12-16 16:15:18,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351368196] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:15:18,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:15:18,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-12-16 16:15:18,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569201104] [2023-12-16 16:15:18,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:15:18,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:15:18,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:18,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:15:18,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:15:18,084 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:15:18,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:18,134 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2023-12-16 16:15:18,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:15:18,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-12-16 16:15:18,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:18,135 INFO L225 Difference]: With dead ends: 48 [2023-12-16 16:15:18,136 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 16:15:18,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:15:18,137 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:18,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 149 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:15:18,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 16:15:18,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-16 16:15:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 16:15:18,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-12-16 16:15:18,142 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2023-12-16 16:15:18,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:18,142 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-12-16 16:15:18,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:15:18,143 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-12-16 16:15:18,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 16:15:18,143 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:18,144 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:18,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 16:15:18,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:18,348 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:18,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:18,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1632968905, now seen corresponding path program 1 times [2023-12-16 16:15:18,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:18,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225296680] [2023-12-16 16:15:18,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:18,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:18,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:18,350 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:15:18,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 16:15:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:15:18,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-16 16:15:18,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 16:15:18,662 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:15:18,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:18,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225296680] [2023-12-16 16:15:18,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [225296680] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:15:18,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:15:18,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 16:15:18,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537553278] [2023-12-16 16:15:18,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:15:18,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 16:15:18,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:18,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 16:15:18,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:15:18,665 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:15:19,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:19,029 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2023-12-16 16:15:19,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 16:15:19,030 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-12-16 16:15:19,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:19,031 INFO L225 Difference]: With dead ends: 56 [2023-12-16 16:15:19,032 INFO L226 Difference]: Without dead ends: 47 [2023-12-16 16:15:19,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2023-12-16 16:15:19,033 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 35 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:19,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 98 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:15:19,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-16 16:15:19,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2023-12-16 16:15:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-16 16:15:19,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2023-12-16 16:15:19,041 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 23 [2023-12-16 16:15:19,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:19,042 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2023-12-16 16:15:19,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:15:19,042 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2023-12-16 16:15:19,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-16 16:15:19,043 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:19,043 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:19,049 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-16 16:15:19,243 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-16 16:15:19,244 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:19,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:19,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1410492652, now seen corresponding path program 1 times [2023-12-16 16:15:19,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:19,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410779348] [2023-12-16 16:15:19,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:19,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:19,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:19,246 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-16 16:15:19,247 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-16 16:15:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:15:19,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-16 16:15:19,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 16:15:19,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:15:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:15:20,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:20,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410779348] [2023-12-16 16:15:20,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410779348] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:15:20,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:15:20,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 27 [2023-12-16 16:15:20,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680840989] [2023-12-16 16:15:20,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:15:20,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-16 16:15:20,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:20,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-16 16:15:20,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2023-12-16 16:15:20,174 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 27 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 16:15:21,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:21,086 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2023-12-16 16:15:21,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 16:15:21,087 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 30 [2023-12-16 16:15:21,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:21,090 INFO L225 Difference]: With dead ends: 65 [2023-12-16 16:15:21,090 INFO L226 Difference]: Without dead ends: 56 [2023-12-16 16:15:21,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=1273, Unknown=0, NotChecked=0, Total=1406 [2023-12-16 16:15:21,100 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 60 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:21,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 124 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 16:15:21,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-16 16:15:21,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2023-12-16 16:15:21,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-16 16:15:21,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2023-12-16 16:15:21,112 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 30 [2023-12-16 16:15:21,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:21,112 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2023-12-16 16:15:21,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 16:15:21,112 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2023-12-16 16:15:21,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-16 16:15:21,113 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:21,113 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:21,123 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 (6)] Ended with exit code 0 [2023-12-16 16:15:21,319 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-16 16:15:21,319 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:21,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:21,320 INFO L85 PathProgramCache]: Analyzing trace with hash 601146026, now seen corresponding path program 1 times [2023-12-16 16:15:21,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:21,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324827067] [2023-12-16 16:15:21,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:21,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:21,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:21,322 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:15:21,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 16:15:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:15:21,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 16:15:21,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:21,598 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:15:21,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:15:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:15:21,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:21,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324827067] [2023-12-16 16:15:21,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324827067] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:15:21,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:15:21,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2023-12-16 16:15:21,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919363781] [2023-12-16 16:15:21,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:15:21,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-16 16:15:21,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:21,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-16 16:15:21,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2023-12-16 16:15:21,894 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 22 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 5 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 16:15:22,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:22,702 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2023-12-16 16:15:22,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 16:15:22,703 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 5 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2023-12-16 16:15:22,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:22,704 INFO L225 Difference]: With dead ends: 58 [2023-12-16 16:15:22,704 INFO L226 Difference]: Without dead ends: 55 [2023-12-16 16:15:22,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2023-12-16 16:15:22,706 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 69 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:22,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 61 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 16:15:22,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-16 16:15:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2023-12-16 16:15:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-16 16:15:22,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2023-12-16 16:15:22,716 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 30 [2023-12-16 16:15:22,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:22,716 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2023-12-16 16:15:22,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 5 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 16:15:22,717 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2023-12-16 16:15:22,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 16:15:22,718 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:22,718 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:22,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:15:22,921 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-16 16:15:22,922 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:22,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:22,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1870046549, now seen corresponding path program 1 times [2023-12-16 16:15:22,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:22,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150165034] [2023-12-16 16:15:22,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:22,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:22,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:22,924 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-16 16:15:22,925 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-16 16:15:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:15:23,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-16 16:15:23,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 16:15:23,251 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:15:23,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:23,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150165034] [2023-12-16 16:15:23,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150165034] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:15:23,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:15:23,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-16 16:15:23,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22218340] [2023-12-16 16:15:23,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:15:23,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 16:15:23,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:23,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 16:15:23,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2023-12-16 16:15:23,253 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 15 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-16 16:15:23,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:23,582 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2023-12-16 16:15:23,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 16:15:23,582 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 40 [2023-12-16 16:15:23,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:23,583 INFO L225 Difference]: With dead ends: 59 [2023-12-16 16:15:23,583 INFO L226 Difference]: Without dead ends: 52 [2023-12-16 16:15:23,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2023-12-16 16:15:23,584 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:23,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 106 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:15:23,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-16 16:15:23,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2023-12-16 16:15:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-16 16:15:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-12-16 16:15:23,594 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 40 [2023-12-16 16:15:23,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:23,594 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-12-16 16:15:23,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-16 16:15:23,594 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-12-16 16:15:23,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 16:15:23,595 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:23,595 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:23,600 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-16 16:15:23,799 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-16 16:15:23,800 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:23,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:23,800 INFO L85 PathProgramCache]: Analyzing trace with hash -649913385, now seen corresponding path program 1 times [2023-12-16 16:15:23,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:23,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878353253] [2023-12-16 16:15:23,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:23,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:23,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:23,802 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:15:23,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 16:15:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:15:23,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-16 16:15:23,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:24,171 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 16:15:24,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:15:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 16:15:24,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:24,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878353253] [2023-12-16 16:15:24,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878353253] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:15:24,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:15:24,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 27 [2023-12-16 16:15:24,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15028100] [2023-12-16 16:15:24,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:15:24,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-16 16:15:24,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:24,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-16 16:15:24,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2023-12-16 16:15:24,665 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 27 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 9 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-16 16:15:25,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:25,361 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2023-12-16 16:15:25,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 16:15:25,361 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 9 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 40 [2023-12-16 16:15:25,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:25,362 INFO L225 Difference]: With dead ends: 61 [2023-12-16 16:15:25,362 INFO L226 Difference]: Without dead ends: 41 [2023-12-16 16:15:25,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=1339, Unknown=0, NotChecked=0, Total=1482 [2023-12-16 16:15:25,363 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:25,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 146 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 16:15:25,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-16 16:15:25,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-12-16 16:15:25,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 16:15:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2023-12-16 16:15:25,369 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 40 [2023-12-16 16:15:25,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:25,370 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2023-12-16 16:15:25,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 9 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-16 16:15:25,370 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2023-12-16 16:15:25,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 16:15:25,371 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:25,371 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:25,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 16:15:25,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:25,575 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:25,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:25,575 INFO L85 PathProgramCache]: Analyzing trace with hash 51151193, now seen corresponding path program 1 times [2023-12-16 16:15:25,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:25,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918858071] [2023-12-16 16:15:25,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:25,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:25,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:25,577 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:15:25,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 16:15:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:15:25,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-16 16:15:25,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:25,985 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 16:15:25,985 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:15:26,240 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 16:15:26,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:26,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918858071] [2023-12-16 16:15:26,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918858071] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:15:26,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:15:26,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 17 [2023-12-16 16:15:26,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120130042] [2023-12-16 16:15:26,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:15:26,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-16 16:15:26,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:26,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-16 16:15:26,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2023-12-16 16:15:26,242 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-16 16:15:26,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:26,739 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2023-12-16 16:15:26,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 16:15:26,739 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) Word has length 40 [2023-12-16 16:15:26,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:26,740 INFO L225 Difference]: With dead ends: 41 [2023-12-16 16:15:26,740 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 16:15:26,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=697, Unknown=0, NotChecked=0, Total=812 [2023-12-16 16:15:26,741 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 32 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:26,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 46 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:15:26,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 16:15:26,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 16:15:26,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-16 16:15:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 16:15:26,742 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2023-12-16 16:15:26,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:26,742 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 16:15:26,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-16 16:15:26,742 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 16:15:26,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 16:15:26,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:15:26,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 16:15:26,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:26,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 16:15:27,210 INFO L899 garLoopResultBuilder]: For program point __getMemory_returnLabel#1(lines 520 527) no Hoare annotation was computed. [2023-12-16 16:15:27,210 INFO L899 garLoopResultBuilder]: For program point L524(lines 524 525) no Hoare annotation was computed. [2023-12-16 16:15:27,211 INFO L899 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2023-12-16 16:15:27,211 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 528 530) the Hoare annotation is: (let ((.cse0 (not (= ~elem~0.offset (_ bv0 32)))) (.cse1 (not (= |my_malloc_#in~size#1| (_ bv8 32)))) (.cse2 (= ~guard_malloc_counter~0.base (_ bv0 32))) (.cse3 (not (= |old(~guard_malloc_counter~0.base)| (_ bv0 32))))) (and (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| (_ bv1 32))) .cse1 (and (= ~guard_malloc_counter~0.offset (_ bv1 32)) .cse2) .cse3) (or .cse0 .cse1 (not (= |old(~guard_malloc_counter~0.offset)| (_ bv0 32))) (and .cse2 (= ~guard_malloc_counter~0.offset (_ bv0 32))) .cse3))) [2023-12-16 16:15:27,211 INFO L895 garLoopResultBuilder]: At program point L522-2(line 522) the Hoare annotation is: (not (= |my_malloc_#in~size#1| (_ bv8 32))) [2023-12-16 16:15:27,211 INFO L899 garLoopResultBuilder]: For program point L522-3(line 522) no Hoare annotation was computed. [2023-12-16 16:15:27,211 INFO L899 garLoopResultBuilder]: For program point my_mallocEXIT(lines 528 530) no Hoare annotation was computed. [2023-12-16 16:15:27,211 INFO L899 garLoopResultBuilder]: For program point L537(lines 537 538) no Hoare annotation was computed. [2023-12-16 16:15:27,211 INFO L899 garLoopResultBuilder]: For program point L536(line 536) no Hoare annotation was computed. [2023-12-16 16:15:27,211 INFO L899 garLoopResultBuilder]: For program point L537-2(lines 535 539) no Hoare annotation was computed. [2023-12-16 16:15:27,212 INFO L895 garLoopResultBuilder]: At program point L536-2(line 536) the Hoare annotation is: (= |list_add_#in~new.offset| |old(~elem~0.offset)|) [2023-12-16 16:15:27,212 INFO L899 garLoopResultBuilder]: For program point L536-3(line 536) no Hoare annotation was computed. [2023-12-16 16:15:27,212 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 535 539) the Hoare annotation is: (let ((.cse0 (= ~elem~0.base |old(~elem~0.base)|))) (and (or .cse0 (not (= |old(~elem~0.offset)| (_ bv0 32))) (not (= |list_add_#in~new.offset| (_ bv2 32)))) (or (= |list_add_#in~new.offset| |old(~elem~0.offset)|) (= |old(~elem~0.offset)| ~elem~0.offset)) (or (not (= (_ bv2 32) |old(~elem~0.offset)|)) (not (= |list_add_#in~new.offset| (_ bv1 32))) .cse0))) [2023-12-16 16:15:27,212 INFO L899 garLoopResultBuilder]: For program point list_addEXIT(lines 535 539) no Hoare annotation was computed. [2023-12-16 16:15:27,212 INFO L899 garLoopResultBuilder]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2023-12-16 16:15:27,212 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 4 7) the Hoare annotation is: true [2023-12-16 16:15:27,212 INFO L899 garLoopResultBuilder]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2023-12-16 16:15:27,212 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 16:15:27,212 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 542) no Hoare annotation was computed. [2023-12-16 16:15:27,212 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 16:15:27,212 INFO L895 garLoopResultBuilder]: At program point L550(line 550) the Hoare annotation is: (and (= |ULTIMATE.start_main_~dev2~0#1.offset| (_ bv2 32)) (= |ULTIMATE.start_main_~dev1~0#1.offset| (_ bv1 32)) (not (= ~guard_malloc_counter~0.offset (_ bv0 32))) (= |ULTIMATE.start_main_~dev2~0#1.base| (_ bv0 32)) (= ~elem~0.offset (_ bv0 32))) [2023-12-16 16:15:27,213 INFO L895 garLoopResultBuilder]: At program point L550-1(line 550) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~dev2~0#1.offset| (_ bv2 32))) (.cse1 (= |ULTIMATE.start_main_~dev1~0#1.offset| (_ bv1 32))) (.cse2 (not (= ~guard_malloc_counter~0.offset (_ bv0 32))))) (or (and .cse0 .cse1 .cse2 (= ~elem~0.offset (_ bv0 32))) (and .cse0 (= (_ bv2 32) ~elem~0.offset) .cse1 .cse2 (= |ULTIMATE.start_main_~dev2~0#1.base| (_ bv0 32)) (= ~elem~0.base (_ bv0 32))))) [2023-12-16 16:15:27,213 INFO L895 garLoopResultBuilder]: At program point L548(line 548) the Hoare annotation is: (or (and (= ~guard_malloc_counter~0.offset (_ bv1 32)) (= ~guard_malloc_counter~0.base (_ bv0 32)) (= |ULTIMATE.start_main_~dev1~0#1.offset| (_ bv1 32)) (= ~elem~0.offset (_ bv0 32))) (and (= |ULTIMATE.start_main_~dev1~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~dev1~0#1.base| (_ bv0 32)))) [2023-12-16 16:15:27,213 INFO L899 garLoopResultBuilder]: For program point L548-1(line 548) no Hoare annotation was computed. [2023-12-16 16:15:27,213 INFO L899 garLoopResultBuilder]: For program point L540(lines 540 543) no Hoare annotation was computed. [2023-12-16 16:15:27,213 INFO L895 garLoopResultBuilder]: At program point L553(line 553) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~dev2~0#1.offset| (_ bv2 32)))) (or (and .cse0 (= ~elem~0.offset (_ bv0 32))) (and (not (= (_ bv2 32) ~elem~0.offset)) .cse0 (= |ULTIMATE.start_main_~dev1~0#1.offset| (_ bv1 32)) (not (= ~guard_malloc_counter~0.offset (_ bv0 32)))))) [2023-12-16 16:15:27,213 INFO L899 garLoopResultBuilder]: For program point L551(line 551) no Hoare annotation was computed. [2023-12-16 16:15:27,213 INFO L899 garLoopResultBuilder]: For program point L549(lines 549 554) no Hoare annotation was computed. [2023-12-16 16:15:27,213 INFO L899 garLoopResultBuilder]: For program point L549-1(lines 549 554) no Hoare annotation was computed. [2023-12-16 16:15:27,213 INFO L895 garLoopResultBuilder]: At program point L547(line 547) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base (_ bv0 32)) (= ~guard_malloc_counter~0.offset (_ bv0 32)) (= ~elem~0.offset (_ bv0 32))) [2023-12-16 16:15:27,213 INFO L899 garLoopResultBuilder]: For program point L547-1(line 547) no Hoare annotation was computed. [2023-12-16 16:15:27,216 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:27,218 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:15:27,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:15:27 BoogieIcfgContainer [2023-12-16 16:15:27,221 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:15:27,222 INFO L158 Benchmark]: Toolchain (without parser) took 11475.62ms. Allocated memory was 366.0MB in the beginning and 464.5MB in the end (delta: 98.6MB). Free memory was 317.3MB in the beginning and 393.8MB in the end (delta: -76.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-16 16:15:27,222 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 203.4MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:15:27,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.91ms. Allocated memory is still 366.0MB. Free memory was 317.3MB in the beginning and 299.0MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 16:15:27,222 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.14ms. Allocated memory is still 366.0MB. Free memory was 299.0MB in the beginning and 296.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:15:27,222 INFO L158 Benchmark]: Boogie Preprocessor took 45.92ms. Allocated memory is still 366.0MB. Free memory was 296.9MB in the beginning and 294.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 16:15:27,223 INFO L158 Benchmark]: RCFGBuilder took 435.53ms. Allocated memory is still 366.0MB. Free memory was 294.2MB in the beginning and 278.0MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 16:15:27,223 INFO L158 Benchmark]: TraceAbstraction took 10523.00ms. Allocated memory was 366.0MB in the beginning and 464.5MB in the end (delta: 98.6MB). Free memory was 277.5MB in the beginning and 393.8MB in the end (delta: -116.3MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:15:27,226 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.19ms. Allocated memory is still 203.4MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 428.91ms. Allocated memory is still 366.0MB. Free memory was 317.3MB in the beginning and 299.0MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.14ms. Allocated memory is still 366.0MB. Free memory was 299.0MB in the beginning and 296.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.92ms. Allocated memory is still 366.0MB. Free memory was 296.9MB in the beginning and 294.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 435.53ms. Allocated memory is still 366.0MB. Free memory was 294.2MB in the beginning and 278.0MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 10523.00ms. Allocated memory was 366.0MB in the beginning and 464.5MB in the end (delta: 98.6MB). Free memory was 277.5MB in the beginning and 393.8MB in the end (delta: -116.3MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 6]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 273 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 272 mSDsluCounter, 946 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 789 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2775 IncrementalHoareTripleChecker+Invalid, 2863 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 157 mSDtfsCounter, 2775 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 477 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=7, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 20 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 57 PreInvPairs, 65 NumberOfFragments, 195 HoareAnnotationTreeSize, 57 FormulaSimplifications, 501 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FormulaSimplificationsInter, 207 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 1691 SizeOfPredicates, 46 NumberOfNonLiveVariables, 887 ConjunctsInSsa, 160 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 98/136 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-16 16:15:27,254 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...