/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/loop-zilu/benchmark17_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 00:00:46,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 00:00:46,881 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-25 00:00:46,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 00:00:46,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 00:00:46,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 00:00:46,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 00:00:46,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 00:00:46,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 00:00:46,919 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 00:00:46,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 00:00:46,920 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 00:00:46,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 00:00:46,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 00:00:46,921 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 00:00:46,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 00:00:46,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 00:00:46,922 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 00:00:46,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 00:00:46,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 00:00:46,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 00:00:46,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 00:00:46,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 00:00:46,924 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 00:00:46,925 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 00:00:46,925 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 00:00:46,925 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 00:00:46,925 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 00:00:46,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 00:00:46,925 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 00:00:46,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 00:00:46,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 00:00:46,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 00:00:46,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 00:00:46,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:00:46,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 00:00:46,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 00:00:46,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 00:00:46,927 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 00:00:46,927 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 00:00:46,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 00:00:46,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 00:00:46,928 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 00:00:46,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 00:00:46,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 00:00:46,929 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 00:00:46,929 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-25 00:00:47,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 00:00:47,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 00:00:47,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 00:00:47,183 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 00:00:47,184 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 00:00:47,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark17_conjunctive.i [2023-12-25 00:00:48,362 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 00:00:48,471 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 00:00:48,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark17_conjunctive.i [2023-12-25 00:00:48,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00d94f92d/cf663d18e9ac4516ac168ff98975034f/FLAGb9a1cd8a7 [2023-12-25 00:00:48,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00d94f92d/cf663d18e9ac4516ac168ff98975034f [2023-12-25 00:00:48,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 00:00:48,493 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 00:00:48,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 00:00:48,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 00:00:48,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 00:00:48,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:00:48" (1/1) ... [2023-12-25 00:00:48,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@722aed91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:00:48, skipping insertion in model container [2023-12-25 00:00:48,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:00:48" (1/1) ... [2023-12-25 00:00:48,516 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 00:00:48,629 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark17_conjunctive.i[873,886] [2023-12-25 00:00:48,646 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:00:48,654 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 00:00:48,663 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark17_conjunctive.i[873,886] [2023-12-25 00:00:48,667 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:00:48,679 INFO L206 MainTranslator]: Completed translation [2023-12-25 00:00:48,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:00:48 WrapperNode [2023-12-25 00:00:48,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 00:00:48,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 00:00:48,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 00:00:48,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 00:00:48,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:00:48" (1/1) ... [2023-12-25 00:00:48,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:00:48" (1/1) ... [2023-12-25 00:00:48,702 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36 [2023-12-25 00:00:48,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 00:00:48,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 00:00:48,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 00:00:48,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 00:00:48,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:00:48" (1/1) ... [2023-12-25 00:00:48,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:00:48" (1/1) ... [2023-12-25 00:00:48,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:00:48" (1/1) ... [2023-12-25 00:00:48,719 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 00:00:48,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:00:48" (1/1) ... [2023-12-25 00:00:48,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:00:48" (1/1) ... [2023-12-25 00:00:48,722 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:00:48" (1/1) ... [2023-12-25 00:00:48,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:00:48" (1/1) ... [2023-12-25 00:00:48,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:00:48" (1/1) ... [2023-12-25 00:00:48,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:00:48" (1/1) ... [2023-12-25 00:00:48,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 00:00:48,726 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 00:00:48,726 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 00:00:48,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 00:00:48,727 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:00:48" (1/1) ... [2023-12-25 00:00:48,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:00:48,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 00:00:48,767 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-25 00:00:48,784 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-25 00:00:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 00:00:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 00:00:48,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 00:00:48,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 00:00:48,831 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 00:00:48,833 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 00:00:48,920 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 00:00:48,937 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 00:00:48,937 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 00:00:48,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:00:48 BoogieIcfgContainer [2023-12-25 00:00:48,937 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 00:00:48,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 00:00:48,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 00:00:48,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 00:00:48,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 12:00:48" (1/3) ... [2023-12-25 00:00:48,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fbacc95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:00:48, skipping insertion in model container [2023-12-25 00:00:48,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:00:48" (2/3) ... [2023-12-25 00:00:48,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fbacc95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:00:48, skipping insertion in model container [2023-12-25 00:00:48,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:00:48" (3/3) ... [2023-12-25 00:00:48,944 INFO L112 eAbstractionObserver]: Analyzing ICFG benchmark17_conjunctive.i [2023-12-25 00:00:48,957 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 00:00:48,957 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 00:00:48,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 00:00:49,004 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;@42c12968, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 00:00:49,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 00:00:49,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 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-25 00:00:49,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-25 00:00:49,025 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:00:49,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-25 00:00:49,027 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:00:49,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:00:49,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1839286506, now seen corresponding path program 1 times [2023-12-25 00:00:49,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:00:49,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479545723] [2023-12-25 00:00:49,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:00:49,043 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-25 00:00:49,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:00:49,046 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-25 00:00:49,047 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-25 00:00:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:00:49,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 00:00:49,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:00:49,133 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-25 00:00:49,133 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:00:49,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:00:49,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479545723] [2023-12-25 00:00:49,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479545723] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:00:49,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:00:49,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 00:00:49,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036999903] [2023-12-25 00:00:49,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:00:49,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 00:00:49,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:00:49,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 00:00:49,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 00:00:49,158 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-25 00:00:49,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:00:49,171 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2023-12-25 00:00:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 00:00:49,172 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-25 00:00:49,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:00:49,177 INFO L225 Difference]: With dead ends: 17 [2023-12-25 00:00:49,177 INFO L226 Difference]: Without dead ends: 7 [2023-12-25 00:00:49,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 00:00:49,181 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:00:49,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 00:00:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2023-12-25 00:00:49,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2023-12-25 00:00:49,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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-25 00:00:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2023-12-25 00:00:49,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 6 [2023-12-25 00:00:49,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:00:49,202 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2023-12-25 00:00:49,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-25 00:00:49,202 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2023-12-25 00:00:49,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-25 00:00:49,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:00:49,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-25 00:00:49,212 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-25 00:00:49,405 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-25 00:00:49,405 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:00:49,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:00:49,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1839167342, now seen corresponding path program 1 times [2023-12-25 00:00:49,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:00:49,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972984539] [2023-12-25 00:00:49,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:00:49,406 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-25 00:00:49,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:00:49,407 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-25 00:00:49,417 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-25 00:00:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:00:49,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 00:00:49,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:00:49,546 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-25 00:00:49,546 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:00:49,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:00:49,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972984539] [2023-12-25 00:00:49,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972984539] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:00:49,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:00:49,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 00:00:49,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462924597] [2023-12-25 00:00:49,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:00:49,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 00:00:49,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:00:49,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 00:00:49,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 00:00:49,549 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-25 00:00:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:00:49,610 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2023-12-25 00:00:49,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 00:00:49,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-25 00:00:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:00:49,612 INFO L225 Difference]: With dead ends: 12 [2023-12-25 00:00:49,612 INFO L226 Difference]: Without dead ends: 8 [2023-12-25 00:00:49,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-25 00:00:49,613 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 9 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-25 00:00:49,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 9 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 00:00:49,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-12-25 00:00:49,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-12-25 00:00:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-25 00:00:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-12-25 00:00:49,616 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2023-12-25 00:00:49,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:00:49,616 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-12-25 00:00:49,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-25 00:00:49,616 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-12-25 00:00:49,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-25 00:00:49,616 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:00:49,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:00:49,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 00:00:49,827 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-25 00:00:49,828 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:00:49,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:00:49,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1181278160, now seen corresponding path program 1 times [2023-12-25 00:00:49,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:00:49,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186365712] [2023-12-25 00:00:49,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:00:49,829 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-25 00:00:49,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:00:49,831 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-25 00:00:49,838 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-25 00:00:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:00:49,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 00:00:49,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:00:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:00:49,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:00:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:00:50,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:00:50,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186365712] [2023-12-25 00:00:50,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186365712] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:00:50,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:00:50,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-25 00:00:50,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310715127] [2023-12-25 00:00:50,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:00:50,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 00:00:50,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:00:50,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 00:00:50,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-25 00:00:50,023 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-25 00:00:50,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:00:50,217 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2023-12-25 00:00:50,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 00:00:50,218 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-25 00:00:50,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:00:50,218 INFO L225 Difference]: With dead ends: 19 [2023-12-25 00:00:50,219 INFO L226 Difference]: Without dead ends: 11 [2023-12-25 00:00:50,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2023-12-25 00:00:50,220 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 00:00:50,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 15 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 00:00:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-25 00:00:50,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-25 00:00:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-25 00:00:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-12-25 00:00:50,223 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2023-12-25 00:00:50,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:00:50,223 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-12-25 00:00:50,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-25 00:00:50,223 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-12-25 00:00:50,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-25 00:00:50,224 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:00:50,224 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-12-25 00:00:50,228 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-25 00:00:50,429 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-25 00:00:50,429 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:00:50,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:00:50,433 INFO L85 PathProgramCache]: Analyzing trace with hash 149389294, now seen corresponding path program 2 times [2023-12-25 00:00:50,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:00:50,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328604489] [2023-12-25 00:00:50,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 00:00:50,434 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-25 00:00:50,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:00:50,435 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-25 00:00:50,442 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-25 00:00:50,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 00:00:50,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 00:00:50,483 WARN L260 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 00:00:50,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:00:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:00:50,687 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:00:51,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:00:51,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:00:51,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328604489] [2023-12-25 00:00:51,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328604489] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:00:51,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:00:51,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-25 00:00:51,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273877713] [2023-12-25 00:00:51,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:00:51,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 00:00:51,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:00:51,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 00:00:51,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2023-12-25 00:00:51,135 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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-25 00:00:52,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:00:52,769 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2023-12-25 00:00:52,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-25 00:00:52,770 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-25 00:00:52,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:00:52,770 INFO L225 Difference]: With dead ends: 31 [2023-12-25 00:00:52,770 INFO L226 Difference]: Without dead ends: 17 [2023-12-25 00:00:52,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=271, Invalid=659, Unknown=0, NotChecked=0, Total=930 [2023-12-25 00:00:52,772 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 00:00:52,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 23 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 00:00:52,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-25 00:00:52,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-25 00:00:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-25 00:00:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2023-12-25 00:00:52,776 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2023-12-25 00:00:52,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:00:52,777 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2023-12-25 00:00:52,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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-25 00:00:52,777 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2023-12-25 00:00:52,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-25 00:00:52,777 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:00:52,777 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-12-25 00:00:52,791 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-25 00:00:52,982 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-25 00:00:52,982 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:00:52,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:00:52,983 INFO L85 PathProgramCache]: Analyzing trace with hash 443815086, now seen corresponding path program 3 times [2023-12-25 00:00:52,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:00:52,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596912429] [2023-12-25 00:00:52,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 00:00:52,984 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-25 00:00:52,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:00:52,985 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-25 00:00:53,013 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-25 00:00:53,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-25 00:00:53,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 00:00:53,030 WARN L260 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-25 00:00:53,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:00:53,260 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:00:53,260 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:00:54,011 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:00:54,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:00:54,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596912429] [2023-12-25 00:00:54,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596912429] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:00:54,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:00:54,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2023-12-25 00:00:54,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829347736] [2023-12-25 00:00:54,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:00:54,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-25 00:00:54,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:00:54,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-25 00:00:54,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2023-12-25 00:00:54,015 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 28 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:05,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:01:05,882 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2023-12-25 00:01:05,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-25 00:01:05,883 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-25 00:01:05,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:01:05,883 INFO L225 Difference]: With dead ends: 55 [2023-12-25 00:01:05,883 INFO L226 Difference]: Without dead ends: 29 [2023-12-25 00:01:05,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=1012, Invalid=2648, Unknown=0, NotChecked=0, Total=3660 [2023-12-25 00:01:05,885 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 139 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 00:01:05,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 31 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 00:01:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-25 00:01:05,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-25 00:01:05,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2023-12-25 00:01:05,891 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 16 [2023-12-25 00:01:05,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:01:05,891 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2023-12-25 00:01:05,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:05,892 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2023-12-25 00:01:05,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 00:01:05,895 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:01:05,895 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1] [2023-12-25 00:01:05,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 00:01:06,098 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-25 00:01:06,098 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:01:06,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:01:06,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1535217198, now seen corresponding path program 4 times [2023-12-25 00:01:06,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:01:06,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415741815] [2023-12-25 00:01:06,100 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 00:01:06,100 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-25 00:01:06,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:01:06,101 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-25 00:01:06,104 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-25 00:01:06,159 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 00:01:06,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 00:01:06,163 WARN L260 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 53 conjunts are in the unsatisfiable core [2023-12-25 00:01:06,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:01:06,758 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:06,758 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:01:11,464 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:11,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:01:11,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415741815] [2023-12-25 00:01:11,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415741815] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:01:11,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:01:11,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2023-12-25 00:01:11,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334777367] [2023-12-25 00:01:11,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:01:11,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-25 00:01:11,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:01:11,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-25 00:01:11,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=655, Invalid=1997, Unknown=0, NotChecked=0, Total=2652 [2023-12-25 00:01:11,467 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 52 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 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-25 00:01:26,737 WARN L293 SmtUtils]: Spent 13.94s on a formula simplification that was a NOOP. DAG size: 159 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:01:42,535 WARN L293 SmtUtils]: Spent 8.41s on a formula simplification. DAG size of input: 158 DAG size of output: 158 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:01:59,518 WARN L293 SmtUtils]: Spent 8.47s on a formula simplification. DAG size of input: 160 DAG size of output: 160 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:03:19,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:03:19,368 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2023-12-25 00:03:19,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-12-25 00:03:19,369 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-25 00:03:19,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:03:19,369 INFO L225 Difference]: With dead ends: 99 [2023-12-25 00:03:19,369 INFO L226 Difference]: Without dead ends: 53 [2023-12-25 00:03:19,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2921 ImplicationChecksByTransitivity, 130.1s TimeCoverageRelationStatistics Valid=3866, Invalid=10176, Unknown=0, NotChecked=0, Total=14042 [2023-12-25 00:03:19,374 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 540 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-25 00:03:19,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 53 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-25 00:03:19,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-25 00:03:19,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-25 00:03:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:03:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2023-12-25 00:03:19,397 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 28 [2023-12-25 00:03:19,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:03:19,397 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2023-12-25 00:03:19,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 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-25 00:03:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2023-12-25 00:03:19,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 00:03:19,398 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:03:19,398 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1] [2023-12-25 00:03:19,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-25 00:03:19,602 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-25 00:03:19,602 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:03:19,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:03:19,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1220689618, now seen corresponding path program 5 times [2023-12-25 00:03:19,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:03:19,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020630114] [2023-12-25 00:03:19,604 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 00:03:19,604 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-25 00:03:19,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:03:19,605 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-25 00:03:19,612 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-25 00:03:19,895 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2023-12-25 00:03:19,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 00:03:19,912 WARN L260 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 103 conjunts are in the unsatisfiable core [2023-12-25 00:03:19,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:03:21,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:03:21,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:03:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:03:38,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:03:38,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020630114] [2023-12-25 00:03:38,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020630114] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:03:38,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:03:38,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 100 [2023-12-25 00:03:38,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787444136] [2023-12-25 00:03:38,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:03:38,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2023-12-25 00:03:38,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:03:38,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2023-12-25 00:03:38,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2455, Invalid=7445, Unknown=0, NotChecked=0, Total=9900 [2023-12-25 00:03:38,439 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 100 states, 100 states have (on average 1.02) internal successors, (102), 100 states have internal predecessors, (102), 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-25 00:05:24,479 WARN L293 SmtUtils]: Spent 1.70m on a formula simplification that was a NOOP. DAG size: 327 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:05:25,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:06:05,345 WARN L293 SmtUtils]: Spent 36.56s on a formula simplification that was a NOOP. DAG size: 321 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:07:01,995 WARN L293 SmtUtils]: Spent 52.31s on a formula simplification. DAG size of input: 326 DAG size of output: 326 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:07:51,445 WARN L293 SmtUtils]: Spent 46.09s on a formula simplification that was a NOOP. DAG size: 314 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:08:09,078 WARN L293 SmtUtils]: Spent 14.47s on a formula simplification that was a NOOP. DAG size: 320 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:09:01,055 WARN L293 SmtUtils]: Spent 47.13s on a formula simplification. DAG size of input: 328 DAG size of output: 328 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:09:29,161 WARN L293 SmtUtils]: Spent 25.30s on a formula simplification that was a NOOP. DAG size: 307 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:09:42,920 WARN L293 SmtUtils]: Spent 11.05s on a formula simplification that was a NOOP. DAG size: 313 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:09:57,175 WARN L293 SmtUtils]: Spent 11.72s on a formula simplification that was a NOOP. DAG size: 322 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:10:35,194 WARN L293 SmtUtils]: Spent 34.98s on a formula simplification that was a NOOP. DAG size: 300 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:10:48,789 WARN L293 SmtUtils]: Spent 10.82s on a formula simplification that was a NOOP. DAG size: 306 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:11:05,923 WARN L293 SmtUtils]: Spent 14.59s on a formula simplification that was a NOOP. DAG size: 315 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:11:46,285 WARN L293 SmtUtils]: Spent 36.79s on a formula simplification that was a NOOP. DAG size: 293 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:12:04,526 WARN L293 SmtUtils]: Spent 14.40s on a formula simplification that was a NOOP. DAG size: 299 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:12:23,554 WARN L293 SmtUtils]: Spent 15.59s on a formula simplification that was a NOOP. DAG size: 308 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:12:59,246 WARN L293 SmtUtils]: Spent 32.15s on a formula simplification that was a NOOP. DAG size: 286 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:13:16,940 WARN L293 SmtUtils]: Spent 14.03s on a formula simplification that was a NOOP. DAG size: 292 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:13:33,194 WARN L293 SmtUtils]: Spent 12.70s on a formula simplification that was a NOOP. DAG size: 301 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:13:58,244 WARN L293 SmtUtils]: Spent 21.87s on a formula simplification that was a NOOP. DAG size: 279 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:14:11,964 WARN L293 SmtUtils]: Spent 10.44s on a formula simplification that was a NOOP. DAG size: 285 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:14:26,976 WARN L293 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 294 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:14:53,075 WARN L293 SmtUtils]: Spent 22.98s on a formula simplification that was a NOOP. DAG size: 272 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:15:06,886 WARN L293 SmtUtils]: Spent 10.61s on a formula simplification that was a NOOP. DAG size: 278 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:15:20,937 WARN L293 SmtUtils]: Spent 10.91s on a formula simplification that was a NOOP. DAG size: 287 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-25 00:15:35,915 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 00:15:35,916 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 00:15:36,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 00:15:37,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-12-25 00:15:37,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 715.3s TimeCoverageRelationStatistics Valid=4367, Invalid=11383, Unknown=0, NotChecked=0, Total=15750 [2023-12-25 00:15:37,113 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 660 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2571 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 2579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:15:37,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 2 Invalid, 2579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2571 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-12-25 00:15:37,117 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 00:15:37,119 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (53states) and FLOYD_HOARE automaton (currently 75 states, 100 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. [2023-12-25 00:15:37,128 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 00:15:37,141 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 137 [2023-12-25 00:15:37,142 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1] [2023-12-25 00:15:37,144 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 00:15:37,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 12:15:37 BoogieIcfgContainer [2023-12-25 00:15:37,145 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 00:15:37,146 INFO L158 Benchmark]: Toolchain (without parser) took 888652.78ms. Allocated memory was 264.2MB in the beginning and 317.7MB in the end (delta: 53.5MB). Free memory was 211.1MB in the beginning and 109.8MB in the end (delta: 101.3MB). Peak memory consumption was 153.9MB. Max. memory is 8.0GB. [2023-12-25 00:15:37,146 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 220.2MB. Free memory is still 168.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 00:15:37,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.17ms. Allocated memory is still 264.2MB. Free memory was 210.9MB in the beginning and 199.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 00:15:37,146 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.81ms. Allocated memory is still 264.2MB. Free memory was 199.8MB in the beginning and 198.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 00:15:37,146 INFO L158 Benchmark]: Boogie Preprocessor took 23.13ms. Allocated memory is still 264.2MB. Free memory was 198.3MB in the beginning and 196.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 00:15:37,146 INFO L158 Benchmark]: RCFGBuilder took 211.20ms. Allocated memory is still 264.2MB. Free memory was 196.6MB in the beginning and 186.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 00:15:37,147 INFO L158 Benchmark]: TraceAbstraction took 888206.41ms. Allocated memory was 264.2MB in the beginning and 317.7MB in the end (delta: 53.5MB). Free memory was 185.5MB in the beginning and 109.8MB in the end (delta: 75.7MB). Peak memory consumption was 128.8MB. Max. memory is 8.0GB. [2023-12-25 00:15:37,147 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.31ms. Allocated memory is still 220.2MB. Free memory is still 168.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 184.17ms. Allocated memory is still 264.2MB. Free memory was 210.9MB in the beginning and 199.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.81ms. Allocated memory is still 264.2MB. Free memory was 199.8MB in the beginning and 198.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.13ms. Allocated memory is still 264.2MB. Free memory was 198.3MB in the beginning and 196.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 211.20ms. Allocated memory is still 264.2MB. Free memory was 196.6MB in the beginning and 186.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 888206.41ms. Allocated memory was 264.2MB in the beginning and 317.7MB in the end (delta: 53.5MB). Free memory was 185.5MB in the beginning and 109.8MB in the end (delta: 75.7MB). Peak memory consumption was 128.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 16). Cancelled while NwaCegarLoop was constructing difference of abstraction (53states) and FLOYD_HOARE automaton (currently 75 states, 100 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 888.2s, OverallIterations: 7, TraceHistogramMax: 46, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 860.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1383 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1383 mSDsluCounter, 142 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 117 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3759 IncrementalHoareTripleChecker+Invalid, 3820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 25 mSDtfsCounter, 3759 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 376 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 859.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=6, InterpolantAutomatonStates: 184, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 25.8s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 2693 SizeOfPredicates, 29 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 0/2800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown