/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver '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' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/bitvector/s3_srvr_1a.BV.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 09:00:47,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 09:00:47,438 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-03 09:00:47,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 09:00:47,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 09:00:47,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 09:00:47,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 09:00:47,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 09:00:47,462 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 09:00:47,463 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 09:00:47,463 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 09:00:47,463 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 09:00:47,464 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 09:00:47,464 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 09:00:47,465 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 09:00:47,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 09:00:47,465 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 09:00:47,466 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 09:00:47,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 09:00:47,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 09:00:47,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 09:00:47,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 09:00:47,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 09:00:47,470 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 09:00:47,471 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 09:00:47,471 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 09:00:47,471 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 09:00:47,471 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 09:00:47,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 09:00:47,472 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 09:00:47,472 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 09:00:47,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 09:00:47,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 09:00:47,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 09:00:47,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 09:00:47,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 09:00:47,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 09:00:47,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 09:00:47,477 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 09:00:47,477 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 09:00:47,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 09:00:47,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 09:00:47,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 09:00:47,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 09:00:47,478 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> 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 [2024-11-03 09:00:47,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 09:00:47,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 09:00:47,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 09:00:47,728 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 09:00:47,729 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 09:00:47,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_srvr_1a.BV.c.cil.c [2024-11-03 09:00:49,131 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 09:00:49,331 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 09:00:49,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_1a.BV.c.cil.c [2024-11-03 09:00:49,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b429c242/39c5384c13ee4f8480cf584720a2aa43/FLAGb7ccb8a3c [2024-11-03 09:00:49,357 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b429c242/39c5384c13ee4f8480cf584720a2aa43 [2024-11-03 09:00:49,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 09:00:49,360 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 09:00:49,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 09:00:49,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 09:00:49,365 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 09:00:49,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:00:49" (1/1) ... [2024-11-03 09:00:49,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9ab84e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:49, skipping insertion in model container [2024-11-03 09:00:49,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:00:49" (1/1) ... [2024-11-03 09:00:49,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 09:00:49,598 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2024-11-03 09:00:49,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 09:00:49,625 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 09:00:49,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2024-11-03 09:00:49,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 09:00:49,685 INFO L204 MainTranslator]: Completed translation [2024-11-03 09:00:49,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:49 WrapperNode [2024-11-03 09:00:49,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 09:00:49,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 09:00:49,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 09:00:49,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 09:00:49,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:49" (1/1) ... [2024-11-03 09:00:49,702 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:49" (1/1) ... [2024-11-03 09:00:49,726 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 514 [2024-11-03 09:00:49,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 09:00:49,727 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 09:00:49,727 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 09:00:49,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 09:00:49,736 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:49" (1/1) ... [2024-11-03 09:00:49,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:49" (1/1) ... [2024-11-03 09:00:49,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:49" (1/1) ... [2024-11-03 09:00:49,754 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]. [2024-11-03 09:00:49,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:49" (1/1) ... [2024-11-03 09:00:49,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:49" (1/1) ... [2024-11-03 09:00:49,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:49" (1/1) ... [2024-11-03 09:00:49,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:49" (1/1) ... [2024-11-03 09:00:49,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:49" (1/1) ... [2024-11-03 09:00:49,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:49" (1/1) ... [2024-11-03 09:00:49,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 09:00:49,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 09:00:49,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 09:00:49,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 09:00:49,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:49" (1/1) ... [2024-11-03 09:00:49,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 09:00:49,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 09:00:49,824 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) [2024-11-03 09:00:49,832 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 [2024-11-03 09:00:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 09:00:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 09:00:49,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 09:00:49,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 09:00:49,947 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 09:00:49,950 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 09:00:49,967 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-03 09:00:50,463 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2024-11-03 09:00:50,463 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2024-11-03 09:00:50,506 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-03 09:00:50,506 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 09:00:50,519 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 09:00:50,519 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-03 09:00:50,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:00:50 BoogieIcfgContainer [2024-11-03 09:00:50,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 09:00:50,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 09:00:50,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 09:00:50,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 09:00:50,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 09:00:49" (1/3) ... [2024-11-03 09:00:50,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e87ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:00:50, skipping insertion in model container [2024-11-03 09:00:50,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:49" (2/3) ... [2024-11-03 09:00:50,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e87ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:00:50, skipping insertion in model container [2024-11-03 09:00:50,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:00:50" (3/3) ... [2024-11-03 09:00:50,526 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2024-11-03 09:00:50,543 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 09:00:50,543 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 09:00:50,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 09:00:50,598 INFO L333 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, 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;@60b1c0fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 09:00:50,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 09:00:50,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 138 states have (on average 1.7318840579710144) internal successors, (239), 139 states have internal predecessors, (239), 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) [2024-11-03 09:00:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-03 09:00:50,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:50,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:50,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:50,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:50,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1632000041, now seen corresponding path program 1 times [2024-11-03 09:00:50,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:50,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [740748447] [2024-11-03 09:00:50,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:50,625 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 [2024-11-03 09:00:50,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:50,627 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) [2024-11-03 09:00:50,629 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 [2024-11-03 09:00:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:50,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-03 09:00:50,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:50,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:50,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:50,832 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:50,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [740748447] [2024-11-03 09:00:50,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [740748447] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:50,836 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:50,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:50,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048690825] [2024-11-03 09:00:50,838 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:50,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:50,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:50,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:50,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:50,866 INFO L87 Difference]: Start difference. First operand has 140 states, 138 states have (on average 1.7318840579710144) internal successors, (239), 139 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:00:51,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:51,063 INFO L93 Difference]: Finished difference Result 295 states and 506 transitions. [2024-11-03 09:00:51,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:51,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-03 09:00:51,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:51,074 INFO L225 Difference]: With dead ends: 295 [2024-11-03 09:00:51,074 INFO L226 Difference]: Without dead ends: 144 [2024-11-03 09:00:51,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:51,081 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 24 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:51,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 367 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 09:00:51,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-03 09:00:51,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-03 09:00:51,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 states have internal predecessors, (218), 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) [2024-11-03 09:00:51,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 218 transitions. [2024-11-03 09:00:51,121 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 218 transitions. Word has length 44 [2024-11-03 09:00:51,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:51,121 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 218 transitions. [2024-11-03 09:00:51,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:00:51,122 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 218 transitions. [2024-11-03 09:00:51,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-03 09:00:51,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:51,126 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:51,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-03 09:00:51,327 WARN L453 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 [2024-11-03 09:00:51,327 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:51,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:51,329 INFO L85 PathProgramCache]: Analyzing trace with hash -193922812, now seen corresponding path program 1 times [2024-11-03 09:00:51,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:51,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [334270432] [2024-11-03 09:00:51,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:51,329 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 [2024-11-03 09:00:51,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:51,331 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) [2024-11-03 09:00:51,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-03 09:00:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:51,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:51,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:51,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:51,440 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:51,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [334270432] [2024-11-03 09:00:51,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [334270432] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:51,441 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:51,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:51,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734792922] [2024-11-03 09:00:51,441 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:51,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:51,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:51,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:51,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:51,443 INFO L87 Difference]: Start difference. First operand 144 states and 218 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2024-11-03 09:00:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:51,575 INFO L93 Difference]: Finished difference Result 301 states and 462 transitions. [2024-11-03 09:00:51,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:51,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2024-11-03 09:00:51,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:51,578 INFO L225 Difference]: With dead ends: 301 [2024-11-03 09:00:51,578 INFO L226 Difference]: Without dead ends: 165 [2024-11-03 09:00:51,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:51,580 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 9 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:51,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 290 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:00:51,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-03 09:00:51,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-03 09:00:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4878048780487805) internal successors, (244), 164 states have internal predecessors, (244), 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) [2024-11-03 09:00:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2024-11-03 09:00:51,598 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 60 [2024-11-03 09:00:51,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:51,598 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2024-11-03 09:00:51,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2024-11-03 09:00:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2024-11-03 09:00:51,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-03 09:00:51,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:51,601 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:51,605 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 [2024-11-03 09:00:51,802 WARN L453 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 [2024-11-03 09:00:51,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:51,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:51,804 INFO L85 PathProgramCache]: Analyzing trace with hash -751274889, now seen corresponding path program 1 times [2024-11-03 09:00:51,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:51,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [578918017] [2024-11-03 09:00:51,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:51,804 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 [2024-11-03 09:00:51,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:51,807 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) [2024-11-03 09:00:51,812 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 [2024-11-03 09:00:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:51,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:51,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-03 09:00:51,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-03 09:00:52,056 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:52,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [578918017] [2024-11-03 09:00:52,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [578918017] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:52,056 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:52,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:52,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335968676] [2024-11-03 09:00:52,056 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:52,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:52,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:52,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:52,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:52,059 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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) [2024-11-03 09:00:52,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:52,225 INFO L93 Difference]: Finished difference Result 364 states and 554 transitions. [2024-11-03 09:00:52,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:52,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 81 [2024-11-03 09:00:52,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:52,227 INFO L225 Difference]: With dead ends: 364 [2024-11-03 09:00:52,227 INFO L226 Difference]: Without dead ends: 207 [2024-11-03 09:00:52,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:52,228 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 10 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:52,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 287 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 09:00:52,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-03 09:00:52,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-03 09:00:52,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.412621359223301) internal successors, (291), 206 states have internal predecessors, (291), 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) [2024-11-03 09:00:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 291 transitions. [2024-11-03 09:00:52,246 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 291 transitions. Word has length 81 [2024-11-03 09:00:52,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:52,246 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 291 transitions. [2024-11-03 09:00:52,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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) [2024-11-03 09:00:52,246 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 291 transitions. [2024-11-03 09:00:52,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-03 09:00:52,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:52,248 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:52,257 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 [2024-11-03 09:00:52,452 WARN L453 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 [2024-11-03 09:00:52,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:52,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:52,454 INFO L85 PathProgramCache]: Analyzing trace with hash -503128395, now seen corresponding path program 1 times [2024-11-03 09:00:52,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:52,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [60982258] [2024-11-03 09:00:52,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:52,455 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 [2024-11-03 09:00:52,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:52,460 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) [2024-11-03 09:00:52,461 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 [2024-11-03 09:00:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:52,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:52,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:52,532 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-03 09:00:52,532 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:52,553 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-03 09:00:52,554 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:52,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [60982258] [2024-11-03 09:00:52,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [60982258] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:52,554 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:52,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:52,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074088424] [2024-11-03 09:00:52,554 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:52,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:52,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:52,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:52,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:52,555 INFO L87 Difference]: Start difference. First operand 207 states and 291 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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) [2024-11-03 09:00:52,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:52,670 INFO L93 Difference]: Finished difference Result 429 states and 612 transitions. [2024-11-03 09:00:52,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:52,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 81 [2024-11-03 09:00:52,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:52,672 INFO L225 Difference]: With dead ends: 429 [2024-11-03 09:00:52,672 INFO L226 Difference]: Without dead ends: 230 [2024-11-03 09:00:52,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:52,673 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 9 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:52,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 306 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:00:52,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-03 09:00:52,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2024-11-03 09:00:52,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.3930131004366813) internal successors, (319), 229 states have internal predecessors, (319), 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) [2024-11-03 09:00:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 319 transitions. [2024-11-03 09:00:52,680 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 319 transitions. Word has length 81 [2024-11-03 09:00:52,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:52,681 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 319 transitions. [2024-11-03 09:00:52,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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) [2024-11-03 09:00:52,681 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 319 transitions. [2024-11-03 09:00:52,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-03 09:00:52,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:52,683 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:52,686 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 [2024-11-03 09:00:52,883 WARN L453 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 [2024-11-03 09:00:52,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:52,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:52,884 INFO L85 PathProgramCache]: Analyzing trace with hash 356294499, now seen corresponding path program 1 times [2024-11-03 09:00:52,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:52,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [355575185] [2024-11-03 09:00:52,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:52,884 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 [2024-11-03 09:00:52,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:52,888 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) [2024-11-03 09:00:52,889 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 [2024-11-03 09:00:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:52,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:52,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:52,965 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-03 09:00:52,965 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-03 09:00:52,989 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:52,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [355575185] [2024-11-03 09:00:52,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [355575185] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:52,990 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:52,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:52,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142534548] [2024-11-03 09:00:52,990 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:52,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:52,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:52,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:52,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:52,991 INFO L87 Difference]: Start difference. First operand 230 states and 319 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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) [2024-11-03 09:00:53,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:53,098 INFO L93 Difference]: Finished difference Result 477 states and 672 transitions. [2024-11-03 09:00:53,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:53,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 101 [2024-11-03 09:00:53,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:53,100 INFO L225 Difference]: With dead ends: 477 [2024-11-03 09:00:53,100 INFO L226 Difference]: Without dead ends: 255 [2024-11-03 09:00:53,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:53,101 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 9 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:53,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 305 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:00:53,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-03 09:00:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2024-11-03 09:00:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.374015748031496) internal successors, (349), 254 states have internal predecessors, (349), 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) [2024-11-03 09:00:53,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 349 transitions. [2024-11-03 09:00:53,113 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 349 transitions. Word has length 101 [2024-11-03 09:00:53,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:53,113 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 349 transitions. [2024-11-03 09:00:53,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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) [2024-11-03 09:00:53,114 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 349 transitions. [2024-11-03 09:00:53,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-03 09:00:53,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:53,119 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:53,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-03 09:00:53,319 WARN L453 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 [2024-11-03 09:00:53,319 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:53,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:53,320 INFO L85 PathProgramCache]: Analyzing trace with hash 112174862, now seen corresponding path program 1 times [2024-11-03 09:00:53,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:53,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [760849064] [2024-11-03 09:00:53,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:53,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 09:00:53,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:53,321 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) [2024-11-03 09:00:53,323 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 [2024-11-03 09:00:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:53,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:53,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:53,479 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-03 09:00:53,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:53,539 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-03 09:00:53,539 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:53,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [760849064] [2024-11-03 09:00:53,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [760849064] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:53,540 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:53,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 09:00:53,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452764302] [2024-11-03 09:00:53,540 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:53,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:00:53,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:53,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:00:53,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:00:53,543 INFO L87 Difference]: Start difference. First operand 255 states and 349 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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) [2024-11-03 09:00:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:53,589 INFO L93 Difference]: Finished difference Result 984 states and 1347 transitions. [2024-11-03 09:00:53,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 09:00:53,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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 121 [2024-11-03 09:00:53,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:53,593 INFO L225 Difference]: With dead ends: 984 [2024-11-03 09:00:53,593 INFO L226 Difference]: Without dead ends: 737 [2024-11-03 09:00:53,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:00:53,594 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 277 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:53,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 624 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:00:53,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-11-03 09:00:53,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2024-11-03 09:00:53,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 736 states have (on average 1.3627717391304348) internal successors, (1003), 736 states have internal predecessors, (1003), 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) [2024-11-03 09:00:53,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1003 transitions. [2024-11-03 09:00:53,618 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1003 transitions. Word has length 121 [2024-11-03 09:00:53,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:53,619 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1003 transitions. [2024-11-03 09:00:53,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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) [2024-11-03 09:00:53,620 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1003 transitions. [2024-11-03 09:00:53,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-03 09:00:53,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:53,621 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:53,627 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 [2024-11-03 09:00:53,824 WARN L453 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 [2024-11-03 09:00:53,825 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:53,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:53,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1428032826, now seen corresponding path program 1 times [2024-11-03 09:00:53,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:53,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2026350640] [2024-11-03 09:00:53,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:53,826 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 [2024-11-03 09:00:53,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:53,829 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) [2024-11-03 09:00:53,830 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 [2024-11-03 09:00:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:53,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:53,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-03 09:00:53,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:54,000 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-03 09:00:54,001 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:54,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2026350640] [2024-11-03 09:00:54,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2026350640] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:54,001 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:54,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:54,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072181598] [2024-11-03 09:00:54,001 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:54,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:54,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:54,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:54,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:54,004 INFO L87 Difference]: Start difference. First operand 737 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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) [2024-11-03 09:00:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:54,037 INFO L93 Difference]: Finished difference Result 1709 states and 2327 transitions. [2024-11-03 09:00:54,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:54,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 122 [2024-11-03 09:00:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:54,041 INFO L225 Difference]: With dead ends: 1709 [2024-11-03 09:00:54,042 INFO L226 Difference]: Without dead ends: 980 [2024-11-03 09:00:54,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:54,044 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 133 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:54,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 492 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:00:54,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2024-11-03 09:00:54,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 980. [2024-11-03 09:00:54,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 1.3595505617977528) internal successors, (1331), 979 states have internal predecessors, (1331), 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) [2024-11-03 09:00:54,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1331 transitions. [2024-11-03 09:00:54,084 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1331 transitions. Word has length 122 [2024-11-03 09:00:54,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:54,084 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1331 transitions. [2024-11-03 09:00:54,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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) [2024-11-03 09:00:54,084 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1331 transitions. [2024-11-03 09:00:54,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-03 09:00:54,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:54,086 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:54,092 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 [2024-11-03 09:00:54,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 09:00:54,288 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:54,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:54,289 INFO L85 PathProgramCache]: Analyzing trace with hash -990451652, now seen corresponding path program 1 times [2024-11-03 09:00:54,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:54,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1153668646] [2024-11-03 09:00:54,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:54,289 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 [2024-11-03 09:00:54,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:54,292 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 09:00:54,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-03 09:00:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:54,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:54,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:54,367 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-03 09:00:54,367 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-03 09:00:54,394 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:54,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1153668646] [2024-11-03 09:00:54,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1153668646] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:54,394 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:54,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:54,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405282728] [2024-11-03 09:00:54,395 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:54,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:54,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:54,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:54,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:54,395 INFO L87 Difference]: Start difference. First operand 980 states and 1331 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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) [2024-11-03 09:00:54,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:54,416 INFO L93 Difference]: Finished difference Result 1976 states and 2680 transitions. [2024-11-03 09:00:54,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:54,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 122 [2024-11-03 09:00:54,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:54,420 INFO L225 Difference]: With dead ends: 1976 [2024-11-03 09:00:54,420 INFO L226 Difference]: Without dead ends: 1004 [2024-11-03 09:00:54,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:54,422 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 10 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:54,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 386 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:00:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2024-11-03 09:00:54,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 1004. [2024-11-03 09:00:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 1003 states have (on average 1.3559322033898304) internal successors, (1360), 1003 states have internal predecessors, (1360), 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) [2024-11-03 09:00:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1360 transitions. [2024-11-03 09:00:54,437 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1360 transitions. Word has length 122 [2024-11-03 09:00:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:54,438 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1360 transitions. [2024-11-03 09:00:54,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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) [2024-11-03 09:00:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1360 transitions. [2024-11-03 09:00:54,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-03 09:00:54,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:54,439 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:54,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-03 09:00:54,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 09:00:54,642 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:54,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:54,642 INFO L85 PathProgramCache]: Analyzing trace with hash 398842362, now seen corresponding path program 1 times [2024-11-03 09:00:54,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:54,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1769866738] [2024-11-03 09:00:54,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:54,642 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 [2024-11-03 09:00:54,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:54,645 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 09:00:54,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-03 09:00:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:54,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:54,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:54,717 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-03 09:00:54,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:54,739 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-03 09:00:54,740 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:54,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1769866738] [2024-11-03 09:00:54,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1769866738] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:54,740 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:54,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:54,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878086695] [2024-11-03 09:00:54,740 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:54,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:54,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:54,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:54,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:54,741 INFO L87 Difference]: Start difference. First operand 1004 states and 1360 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2024-11-03 09:00:54,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:54,769 INFO L93 Difference]: Finished difference Result 2013 states and 2722 transitions. [2024-11-03 09:00:54,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:54,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 122 [2024-11-03 09:00:54,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:54,774 INFO L225 Difference]: With dead ends: 2013 [2024-11-03 09:00:54,774 INFO L226 Difference]: Without dead ends: 1017 [2024-11-03 09:00:54,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:54,777 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 6 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:54,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 366 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:00:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2024-11-03 09:00:54,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1017. [2024-11-03 09:00:54,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 1016 states have (on average 1.3513779527559056) internal successors, (1373), 1016 states have internal predecessors, (1373), 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) [2024-11-03 09:00:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1373 transitions. [2024-11-03 09:00:54,794 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1373 transitions. Word has length 122 [2024-11-03 09:00:54,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:54,795 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1373 transitions. [2024-11-03 09:00:54,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2024-11-03 09:00:54,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1373 transitions. [2024-11-03 09:00:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-03 09:00:54,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:54,797 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:54,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-03 09:00:54,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 09:00:54,998 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:54,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:54,998 INFO L85 PathProgramCache]: Analyzing trace with hash -541828422, now seen corresponding path program 1 times [2024-11-03 09:00:54,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:54,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1894047613] [2024-11-03 09:00:54,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:54,998 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 [2024-11-03 09:00:54,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:55,001 INFO L229 MonitoredProcess]: Starting monitored process 11 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) [2024-11-03 09:00:55,002 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 (11)] Waiting until timeout for monitored process [2024-11-03 09:00:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:55,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:55,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-03 09:00:55,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:55,175 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-03 09:00:55,176 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:55,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1894047613] [2024-11-03 09:00:55,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1894047613] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:55,176 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:55,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 09:00:55,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424134981] [2024-11-03 09:00:55,176 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:55,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:00:55,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:55,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:00:55,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:00:55,177 INFO L87 Difference]: Start difference. First operand 1017 states and 1373 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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) [2024-11-03 09:00:55,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:55,381 INFO L93 Difference]: Finished difference Result 2291 states and 3249 transitions. [2024-11-03 09:00:55,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 09:00:55,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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 159 [2024-11-03 09:00:55,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:55,386 INFO L225 Difference]: With dead ends: 2291 [2024-11-03 09:00:55,386 INFO L226 Difference]: Without dead ends: 1295 [2024-11-03 09:00:55,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:00:55,388 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 57 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:55,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 308 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 09:00:55,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2024-11-03 09:00:55,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1295. [2024-11-03 09:00:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 1294 states have (on average 1.3894899536321483) internal successors, (1798), 1294 states have internal predecessors, (1798), 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) [2024-11-03 09:00:55,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1798 transitions. [2024-11-03 09:00:55,409 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1798 transitions. Word has length 159 [2024-11-03 09:00:55,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:55,409 INFO L471 AbstractCegarLoop]: Abstraction has 1295 states and 1798 transitions. [2024-11-03 09:00:55,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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) [2024-11-03 09:00:55,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1798 transitions. [2024-11-03 09:00:55,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-03 09:00:55,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:55,412 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:55,415 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 (11)] Ended with exit code 0 [2024-11-03 09:00:55,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 [2024-11-03 09:00:55,612 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:55,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:55,613 INFO L85 PathProgramCache]: Analyzing trace with hash -640990187, now seen corresponding path program 1 times [2024-11-03 09:00:55,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:55,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1039561222] [2024-11-03 09:00:55,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:55,614 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 [2024-11-03 09:00:55,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:55,617 INFO L229 MonitoredProcess]: Starting monitored process 12 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) [2024-11-03 09:00:55,618 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 (12)] Waiting until timeout for monitored process [2024-11-03 09:00:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:55,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:55,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-03 09:00:55,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-03 09:00:55,774 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:55,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1039561222] [2024-11-03 09:00:55,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1039561222] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:55,774 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:55,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:55,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739711675] [2024-11-03 09:00:55,774 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:55,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:55,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:55,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:55,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:55,776 INFO L87 Difference]: Start difference. First operand 1295 states and 1798 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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) [2024-11-03 09:00:55,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:55,906 INFO L93 Difference]: Finished difference Result 2693 states and 3803 transitions. [2024-11-03 09:00:55,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:55,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 203 [2024-11-03 09:00:55,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:55,911 INFO L225 Difference]: With dead ends: 2693 [2024-11-03 09:00:55,911 INFO L226 Difference]: Without dead ends: 1419 [2024-11-03 09:00:55,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:55,914 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:55,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 303 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:00:55,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2024-11-03 09:00:55,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1419. [2024-11-03 09:00:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1418 states have (on average 1.369534555712271) internal successors, (1942), 1418 states have internal predecessors, (1942), 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) [2024-11-03 09:00:55,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1942 transitions. [2024-11-03 09:00:55,943 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1942 transitions. Word has length 203 [2024-11-03 09:00:55,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:55,943 INFO L471 AbstractCegarLoop]: Abstraction has 1419 states and 1942 transitions. [2024-11-03 09:00:55,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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) [2024-11-03 09:00:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1942 transitions. [2024-11-03 09:00:55,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-03 09:00:55,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:55,947 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:55,950 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 (12)] Forceful destruction successful, exit code 0 [2024-11-03 09:00:56,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 [2024-11-03 09:00:56,148 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:56,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:56,148 INFO L85 PathProgramCache]: Analyzing trace with hash -890289059, now seen corresponding path program 1 times [2024-11-03 09:00:56,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:56,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [152855371] [2024-11-03 09:00:56,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:56,149 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 [2024-11-03 09:00:56,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:56,152 INFO L229 MonitoredProcess]: Starting monitored process 13 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) [2024-11-03 09:00:56,153 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 (13)] Waiting until timeout for monitored process [2024-11-03 09:00:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:56,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:56,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-03 09:00:56,280 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-03 09:00:56,327 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:56,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [152855371] [2024-11-03 09:00:56,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [152855371] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:56,327 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:56,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 09:00:56,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079361689] [2024-11-03 09:00:56,328 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:56,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:00:56,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:56,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:00:56,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:00:56,329 INFO L87 Difference]: Start difference. First operand 1419 states and 1942 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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) [2024-11-03 09:00:56,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:56,521 INFO L93 Difference]: Finished difference Result 2856 states and 4041 transitions. [2024-11-03 09:00:56,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 09:00:56,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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 231 [2024-11-03 09:00:56,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:56,525 INFO L225 Difference]: With dead ends: 2856 [2024-11-03 09:00:56,525 INFO L226 Difference]: Without dead ends: 1280 [2024-11-03 09:00:56,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:00:56,527 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 49 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:56,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 249 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 09:00:56,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2024-11-03 09:00:56,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1280. [2024-11-03 09:00:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 1.3940578577013292) internal successors, (1783), 1279 states have internal predecessors, (1783), 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) [2024-11-03 09:00:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1783 transitions. [2024-11-03 09:00:56,548 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1783 transitions. Word has length 231 [2024-11-03 09:00:56,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:56,548 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1783 transitions. [2024-11-03 09:00:56,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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) [2024-11-03 09:00:56,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1783 transitions. [2024-11-03 09:00:56,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-03 09:00:56,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:56,550 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:56,554 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 (13)] Forceful destruction successful, exit code 0 [2024-11-03 09:00:56,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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 [2024-11-03 09:00:56,751 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:56,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:56,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1829254476, now seen corresponding path program 1 times [2024-11-03 09:00:56,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:56,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1155875851] [2024-11-03 09:00:56,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:56,752 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 [2024-11-03 09:00:56,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:56,755 INFO L229 MonitoredProcess]: Starting monitored process 14 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) [2024-11-03 09:00:56,756 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 (14)] Waiting until timeout for monitored process [2024-11-03 09:00:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:56,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:56,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:56,985 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-03 09:00:56,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:57,137 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-03 09:00:57,137 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:57,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1155875851] [2024-11-03 09:00:57,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1155875851] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:57,137 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:57,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:57,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537318245] [2024-11-03 09:00:57,138 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:57,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:57,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:57,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:57,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:57,139 INFO L87 Difference]: Start difference. First operand 1280 states and 1783 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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) [2024-11-03 09:00:57,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:57,182 INFO L93 Difference]: Finished difference Result 3591 states and 5060 transitions. [2024-11-03 09:00:57,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:57,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 271 [2024-11-03 09:00:57,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:57,187 INFO L225 Difference]: With dead ends: 3591 [2024-11-03 09:00:57,187 INFO L226 Difference]: Without dead ends: 1606 [2024-11-03 09:00:57,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:57,190 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 116 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:57,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 514 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:00:57,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2024-11-03 09:00:57,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1566. [2024-11-03 09:00:57,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1565 states have (on average 1.392332268370607) internal successors, (2179), 1565 states have internal predecessors, (2179), 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) [2024-11-03 09:00:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2179 transitions. [2024-11-03 09:00:57,217 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2179 transitions. Word has length 271 [2024-11-03 09:00:57,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:57,217 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2179 transitions. [2024-11-03 09:00:57,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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) [2024-11-03 09:00:57,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2179 transitions. [2024-11-03 09:00:57,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2024-11-03 09:00:57,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:57,220 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:57,225 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 (14)] Ended with exit code 0 [2024-11-03 09:00:57,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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 [2024-11-03 09:00:57,421 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:57,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:57,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1891635766, now seen corresponding path program 1 times [2024-11-03 09:00:57,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:57,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1607217985] [2024-11-03 09:00:57,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:57,422 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 [2024-11-03 09:00:57,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:57,425 INFO L229 MonitoredProcess]: Starting monitored process 15 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) [2024-11-03 09:00:57,426 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 (15)] Waiting until timeout for monitored process [2024-11-03 09:00:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:57,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:57,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 500 proven. 0 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-11-03 09:00:57,542 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 500 proven. 0 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-11-03 09:00:57,570 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:57,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1607217985] [2024-11-03 09:00:57,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1607217985] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:57,571 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:57,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:57,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152788037] [2024-11-03 09:00:57,571 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:57,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:57,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:57,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:57,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:57,572 INFO L87 Difference]: Start difference. First operand 1566 states and 2179 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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) [2024-11-03 09:00:57,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:57,709 INFO L93 Difference]: Finished difference Result 3219 states and 4529 transitions. [2024-11-03 09:00:57,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:57,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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 317 [2024-11-03 09:00:57,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:57,715 INFO L225 Difference]: With dead ends: 3219 [2024-11-03 09:00:57,715 INFO L226 Difference]: Without dead ends: 1674 [2024-11-03 09:00:57,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 631 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:57,717 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 9 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:57,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 300 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:00:57,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2024-11-03 09:00:57,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1674. [2024-11-03 09:00:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1673 states have (on average 1.3789599521817095) internal successors, (2307), 1673 states have internal predecessors, (2307), 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) [2024-11-03 09:00:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2307 transitions. [2024-11-03 09:00:57,748 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2307 transitions. Word has length 317 [2024-11-03 09:00:57,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:57,748 INFO L471 AbstractCegarLoop]: Abstraction has 1674 states and 2307 transitions. [2024-11-03 09:00:57,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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) [2024-11-03 09:00:57,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2307 transitions. [2024-11-03 09:00:57,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-11-03 09:00:57,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:57,753 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:57,757 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 (15)] Forceful destruction successful, exit code 0 [2024-11-03 09:00:57,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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 [2024-11-03 09:00:57,953 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:57,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:57,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1795423714, now seen corresponding path program 1 times [2024-11-03 09:00:57,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:57,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1939576519] [2024-11-03 09:00:57,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:57,954 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 [2024-11-03 09:00:57,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:57,956 INFO L229 MonitoredProcess]: Starting monitored process 16 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) [2024-11-03 09:00:57,962 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 (16)] Waiting until timeout for monitored process [2024-11-03 09:00:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:58,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:58,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:58,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1151 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2024-11-03 09:00:58,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1151 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2024-11-03 09:00:58,113 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:58,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1939576519] [2024-11-03 09:00:58,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1939576519] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:58,113 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:58,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:58,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264248981] [2024-11-03 09:00:58,114 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:58,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:58,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:58,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:58,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:58,115 INFO L87 Difference]: Start difference. First operand 1674 states and 2307 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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) [2024-11-03 09:00:58,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:58,232 INFO L93 Difference]: Finished difference Result 3443 states and 4801 transitions. [2024-11-03 09:00:58,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:58,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 340 [2024-11-03 09:00:58,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:58,238 INFO L225 Difference]: With dead ends: 3443 [2024-11-03 09:00:58,238 INFO L226 Difference]: Without dead ends: 1790 [2024-11-03 09:00:58,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 677 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:58,241 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 9 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:58,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 300 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:00:58,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2024-11-03 09:00:58,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1790. [2024-11-03 09:00:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1790 states, 1789 states have (on average 1.3655673560648407) internal successors, (2443), 1789 states have internal predecessors, (2443), 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) [2024-11-03 09:00:58,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2443 transitions. [2024-11-03 09:00:58,267 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2443 transitions. Word has length 340 [2024-11-03 09:00:58,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:58,268 INFO L471 AbstractCegarLoop]: Abstraction has 1790 states and 2443 transitions. [2024-11-03 09:00:58,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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) [2024-11-03 09:00:58,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2443 transitions. [2024-11-03 09:00:58,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2024-11-03 09:00:58,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:58,272 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:58,275 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 (16)] Forceful destruction successful, exit code 0 [2024-11-03 09:00:58,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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 [2024-11-03 09:00:58,472 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:58,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:58,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1520948552, now seen corresponding path program 1 times [2024-11-03 09:00:58,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:58,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1565544273] [2024-11-03 09:00:58,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:58,473 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 [2024-11-03 09:00:58,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:58,477 INFO L229 MonitoredProcess]: Starting monitored process 17 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) [2024-11-03 09:00:58,486 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 (17)] Waiting until timeout for monitored process [2024-11-03 09:00:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:58,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:58,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:58,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2024-11-03 09:00:58,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2024-11-03 09:00:58,727 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:58,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1565544273] [2024-11-03 09:00:58,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1565544273] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:58,727 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:58,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:58,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073075723] [2024-11-03 09:00:58,727 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:58,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:58,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:58,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:58,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:58,729 INFO L87 Difference]: Start difference. First operand 1790 states and 2443 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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) [2024-11-03 09:00:58,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:58,759 INFO L93 Difference]: Finished difference Result 5320 states and 7267 transitions. [2024-11-03 09:00:58,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:58,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 373 [2024-11-03 09:00:58,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:58,769 INFO L225 Difference]: With dead ends: 5320 [2024-11-03 09:00:58,769 INFO L226 Difference]: Without dead ends: 3551 [2024-11-03 09:00:58,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 743 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:58,772 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 144 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:58,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 412 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:00:58,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3551 states. [2024-11-03 09:00:58,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3551 to 3549. [2024-11-03 09:00:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3549 states, 3548 states have (on average 1.3641488162344984) internal successors, (4840), 3548 states have internal predecessors, (4840), 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) [2024-11-03 09:00:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 4840 transitions. [2024-11-03 09:00:58,829 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 4840 transitions. Word has length 373 [2024-11-03 09:00:58,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:58,829 INFO L471 AbstractCegarLoop]: Abstraction has 3549 states and 4840 transitions. [2024-11-03 09:00:58,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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) [2024-11-03 09:00:58,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 4840 transitions. [2024-11-03 09:00:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2024-11-03 09:00:58,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:58,833 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:58,838 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 (17)] Ended with exit code 0 [2024-11-03 09:00:59,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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 [2024-11-03 09:00:59,036 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:59,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:59,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1193592354, now seen corresponding path program 1 times [2024-11-03 09:00:59,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:59,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [186458622] [2024-11-03 09:00:59,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:59,037 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 [2024-11-03 09:00:59,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:59,039 INFO L229 MonitoredProcess]: Starting monitored process 18 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) [2024-11-03 09:00:59,048 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 (18)] Waiting until timeout for monitored process [2024-11-03 09:00:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:59,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 09:00:59,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:59,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 876 proven. 26 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-03 09:00:59,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:59,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 876 proven. 26 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-03 09:00:59,311 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:59,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [186458622] [2024-11-03 09:00:59,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [186458622] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:00:59,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:00:59,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2024-11-03 09:00:59,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258404628] [2024-11-03 09:00:59,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:00:59,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:00:59,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:59,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:00:59,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:00:59,313 INFO L87 Difference]: Start difference. First operand 3549 states and 4840 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 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) [2024-11-03 09:00:59,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:59,543 INFO L93 Difference]: Finished difference Result 10517 states and 14306 transitions. [2024-11-03 09:00:59,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 09:00:59,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 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 374 [2024-11-03 09:00:59,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:59,562 INFO L225 Difference]: With dead ends: 10517 [2024-11-03 09:00:59,562 INFO L226 Difference]: Without dead ends: 6989 [2024-11-03 09:00:59,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 748 GetRequests, 745 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-03 09:00:59,567 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 157 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:59,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 631 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:00:59,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6989 states. [2024-11-03 09:00:59,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6989 to 4739. [2024-11-03 09:00:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4739 states, 4738 states have (on average 1.3925707049387928) internal successors, (6598), 4738 states have internal predecessors, (6598), 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) [2024-11-03 09:00:59,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4739 states to 4739 states and 6598 transitions. [2024-11-03 09:00:59,667 INFO L78 Accepts]: Start accepts. Automaton has 4739 states and 6598 transitions. Word has length 374 [2024-11-03 09:00:59,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:59,668 INFO L471 AbstractCegarLoop]: Abstraction has 4739 states and 6598 transitions. [2024-11-03 09:00:59,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 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) [2024-11-03 09:00:59,668 INFO L276 IsEmpty]: Start isEmpty. Operand 4739 states and 6598 transitions. [2024-11-03 09:00:59,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2024-11-03 09:00:59,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:59,672 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:59,677 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 (18)] Forceful destruction successful, exit code 0 [2024-11-03 09:00:59,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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 [2024-11-03 09:00:59,873 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:59,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:59,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1453642420, now seen corresponding path program 1 times [2024-11-03 09:00:59,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:59,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [240349659] [2024-11-03 09:00:59,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:59,874 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 [2024-11-03 09:00:59,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:59,878 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2024-11-03 09:00:59,878 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 (19)] Waiting until timeout for monitored process [2024-11-03 09:00:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:59,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:59,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:59,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1671 backedges. 917 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2024-11-03 09:00:59,986 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:00,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1671 backedges. 917 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2024-11-03 09:01:00,007 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:00,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [240349659] [2024-11-03 09:01:00,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [240349659] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:01:00,007 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:01:00,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:01:00,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828752755] [2024-11-03 09:01:00,009 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:01:00,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:01:00,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:00,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:01:00,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:01:00,010 INFO L87 Difference]: Start difference. First operand 4739 states and 6598 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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) [2024-11-03 09:01:00,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:00,128 INFO L93 Difference]: Finished difference Result 9777 states and 13731 transitions. [2024-11-03 09:01:00,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:01:00,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 404 [2024-11-03 09:01:00,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:00,149 INFO L225 Difference]: With dead ends: 9777 [2024-11-03 09:01:00,149 INFO L226 Difference]: Without dead ends: 5059 [2024-11-03 09:01:00,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 806 GetRequests, 805 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:01:00,160 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 9 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:00,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 302 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:01:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5059 states. [2024-11-03 09:01:00,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5059 to 4899. [2024-11-03 09:01:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4899 states, 4898 states have (on average 1.3879134340547161) internal successors, (6798), 4898 states have internal predecessors, (6798), 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) [2024-11-03 09:01:00,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4899 states to 4899 states and 6798 transitions. [2024-11-03 09:01:00,297 INFO L78 Accepts]: Start accepts. Automaton has 4899 states and 6798 transitions. Word has length 404 [2024-11-03 09:01:00,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:00,298 INFO L471 AbstractCegarLoop]: Abstraction has 4899 states and 6798 transitions. [2024-11-03 09:01:00,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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) [2024-11-03 09:01:00,298 INFO L276 IsEmpty]: Start isEmpty. Operand 4899 states and 6798 transitions. [2024-11-03 09:01:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2024-11-03 09:01:00,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:00,303 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:01:00,307 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 (19)] Forceful destruction successful, exit code 0 [2024-11-03 09:01:00,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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 [2024-11-03 09:01:00,503 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:00,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:00,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1756109688, now seen corresponding path program 1 times [2024-11-03 09:01:00,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:00,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1734858841] [2024-11-03 09:01:00,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:00,504 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 [2024-11-03 09:01:00,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:00,507 INFO L229 MonitoredProcess]: Starting monitored process 20 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) [2024-11-03 09:01:00,508 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 (20)] Waiting until timeout for monitored process [2024-11-03 09:01:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:00,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:01:00,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:00,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1671 backedges. 984 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2024-11-03 09:01:00,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:00,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1671 backedges. 984 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2024-11-03 09:01:00,664 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:00,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1734858841] [2024-11-03 09:01:00,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1734858841] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:01:00,664 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:01:00,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:01:00,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507627373] [2024-11-03 09:01:00,664 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:01:00,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:01:00,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:00,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:01:00,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:01:00,665 INFO L87 Difference]: Start difference. First operand 4899 states and 6798 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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) [2024-11-03 09:01:00,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:00,809 INFO L93 Difference]: Finished difference Result 10321 states and 14579 transitions. [2024-11-03 09:01:00,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:01:00,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 405 [2024-11-03 09:01:00,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:00,819 INFO L225 Difference]: With dead ends: 10321 [2024-11-03 09:01:00,819 INFO L226 Difference]: Without dead ends: 5443 [2024-11-03 09:01:00,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 807 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:01:00,825 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 9 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:00,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 300 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:01:00,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5443 states. [2024-11-03 09:01:00,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5443 to 5443. [2024-11-03 09:01:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5443 states, 5442 states have (on average 1.3638368246968027) internal successors, (7422), 5442 states have internal predecessors, (7422), 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) [2024-11-03 09:01:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5443 states to 5443 states and 7422 transitions. [2024-11-03 09:01:00,962 INFO L78 Accepts]: Start accepts. Automaton has 5443 states and 7422 transitions. Word has length 405 [2024-11-03 09:01:00,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:00,962 INFO L471 AbstractCegarLoop]: Abstraction has 5443 states and 7422 transitions. [2024-11-03 09:01:00,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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) [2024-11-03 09:01:00,963 INFO L276 IsEmpty]: Start isEmpty. Operand 5443 states and 7422 transitions. [2024-11-03 09:01:00,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2024-11-03 09:01:00,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:00,976 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 7, 6, 6, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:01:00,981 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 (20)] Ended with exit code 0 [2024-11-03 09:01:01,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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 [2024-11-03 09:01:01,179 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:01,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:01,179 INFO L85 PathProgramCache]: Analyzing trace with hash -11640254, now seen corresponding path program 1 times [2024-11-03 09:01:01,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:01,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1192442466] [2024-11-03 09:01:01,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:01,180 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 [2024-11-03 09:01:01,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:01,185 INFO L229 MonitoredProcess]: Starting monitored process 21 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) [2024-11-03 09:01:01,186 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 (21)] Waiting until timeout for monitored process [2024-11-03 09:01:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:01,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:01:01,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1982 backedges. 1163 proven. 0 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2024-11-03 09:01:01,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:01,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1982 backedges. 1163 proven. 0 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2024-11-03 09:01:01,378 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:01,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1192442466] [2024-11-03 09:01:01,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1192442466] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:01:01,378 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:01:01,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:01:01,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235920632] [2024-11-03 09:01:01,379 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:01:01,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:01:01,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:01,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:01:01,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:01:01,380 INFO L87 Difference]: Start difference. First operand 5443 states and 7422 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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) [2024-11-03 09:01:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:01,556 INFO L93 Difference]: Finished difference Result 11441 states and 15891 transitions. [2024-11-03 09:01:01,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:01:01,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 436 [2024-11-03 09:01:01,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:01,567 INFO L225 Difference]: With dead ends: 11441 [2024-11-03 09:01:01,567 INFO L226 Difference]: Without dead ends: 6019 [2024-11-03 09:01:01,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 870 GetRequests, 869 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:01:01,575 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 9 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:01,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 300 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:01:01,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6019 states. [2024-11-03 09:01:01,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6019 to 6019. [2024-11-03 09:01:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6019 states, 6018 states have (on average 1.34230641409106) internal successors, (8078), 6018 states have internal predecessors, (8078), 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) [2024-11-03 09:01:01,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6019 states to 6019 states and 8078 transitions. [2024-11-03 09:01:01,662 INFO L78 Accepts]: Start accepts. Automaton has 6019 states and 8078 transitions. Word has length 436 [2024-11-03 09:01:01,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:01,663 INFO L471 AbstractCegarLoop]: Abstraction has 6019 states and 8078 transitions. [2024-11-03 09:01:01,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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) [2024-11-03 09:01:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 6019 states and 8078 transitions. [2024-11-03 09:01:01,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2024-11-03 09:01:01,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:01,669 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:01:01,674 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 (21)] Forceful destruction successful, exit code 0 [2024-11-03 09:01:01,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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 [2024-11-03 09:01:01,870 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:01,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:01,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1411824547, now seen corresponding path program 1 times [2024-11-03 09:01:01,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:01,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [11902861] [2024-11-03 09:01:01,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:01,871 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 [2024-11-03 09:01:01,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:01,874 INFO L229 MonitoredProcess]: Starting monitored process 22 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) [2024-11-03 09:01:01,874 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 (22)] Waiting until timeout for monitored process [2024-11-03 09:01:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:01,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:01:01,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2332 backedges. 1352 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-11-03 09:01:02,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2332 backedges. 1352 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-11-03 09:01:02,141 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:02,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [11902861] [2024-11-03 09:01:02,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [11902861] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:01:02,142 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:01:02,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:01:02,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393601819] [2024-11-03 09:01:02,142 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:01:02,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:01:02,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:02,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:01:02,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:01:02,143 INFO L87 Difference]: Start difference. First operand 6019 states and 8078 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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) [2024-11-03 09:01:02,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:02,332 INFO L93 Difference]: Finished difference Result 11257 states and 14961 transitions. [2024-11-03 09:01:02,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:01:02,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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 469 [2024-11-03 09:01:02,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:02,339 INFO L225 Difference]: With dead ends: 11257 [2024-11-03 09:01:02,340 INFO L226 Difference]: Without dead ends: 4809 [2024-11-03 09:01:02,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 935 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:01:02,347 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 9 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:02,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 300 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:01:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2024-11-03 09:01:02,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4343. [2024-11-03 09:01:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4343 states, 4342 states have (on average 1.2584062643942884) internal successors, (5464), 4342 states have internal predecessors, (5464), 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) [2024-11-03 09:01:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4343 states to 4343 states and 5464 transitions. [2024-11-03 09:01:02,405 INFO L78 Accepts]: Start accepts. Automaton has 4343 states and 5464 transitions. Word has length 469 [2024-11-03 09:01:02,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:02,405 INFO L471 AbstractCegarLoop]: Abstraction has 4343 states and 5464 transitions. [2024-11-03 09:01:02,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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) [2024-11-03 09:01:02,405 INFO L276 IsEmpty]: Start isEmpty. Operand 4343 states and 5464 transitions. [2024-11-03 09:01:02,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2024-11-03 09:01:02,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:02,410 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 9, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:01:02,416 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 (22)] Ended with exit code 0 [2024-11-03 09:01:02,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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 [2024-11-03 09:01:02,611 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:02,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:02,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2021178619, now seen corresponding path program 1 times [2024-11-03 09:01:02,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:02,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1530695350] [2024-11-03 09:01:02,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:02,613 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 [2024-11-03 09:01:02,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:02,616 INFO L229 MonitoredProcess]: Starting monitored process 23 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) [2024-11-03 09:01:02,618 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 (23)] Waiting until timeout for monitored process [2024-11-03 09:01:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:02,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 09:01:02,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:02,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2728 backedges. 1309 proven. 26 refuted. 0 times theorem prover too weak. 1393 trivial. 0 not checked. [2024-11-03 09:01:02,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:02,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2728 backedges. 1309 proven. 26 refuted. 0 times theorem prover too weak. 1393 trivial. 0 not checked. [2024-11-03 09:01:02,864 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:02,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1530695350] [2024-11-03 09:01:02,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1530695350] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:01:02,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:01:02,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-03 09:01:02,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829265497] [2024-11-03 09:01:02,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:01:02,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 09:01:02,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:02,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 09:01:02,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-03 09:01:02,867 INFO L87 Difference]: Start difference. First operand 4343 states and 5464 transitions. Second operand has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 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) [2024-11-03 09:01:03,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:03,161 INFO L93 Difference]: Finished difference Result 5670 states and 7101 transitions. [2024-11-03 09:01:03,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-03 09:01:03,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 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 507 [2024-11-03 09:01:03,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:03,163 INFO L225 Difference]: With dead ends: 5670 [2024-11-03 09:01:03,163 INFO L226 Difference]: Without dead ends: 0 [2024-11-03 09:01:03,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1018 GetRequests, 1011 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-03 09:01:03,166 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 185 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:03,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 651 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-03 09:01:03,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-03 09:01:03,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-03 09:01:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:01:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-03 09:01:03,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 507 [2024-11-03 09:01:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:03,168 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-03 09:01:03,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 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) [2024-11-03 09:01:03,168 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-03 09:01:03,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-03 09:01:03,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-03 09:01:03,176 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 (23)] Ended with exit code 0 [2024-11-03 09:01:03,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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 [2024-11-03 09:01:03,373 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:01:03,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-03 09:01:04,137 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-03 09:01:04,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 09:01:04 BoogieIcfgContainer [2024-11-03 09:01:04,158 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-03 09:01:04,159 INFO L158 Benchmark]: Toolchain (without parser) took 14798.86ms. Allocated memory was 282.1MB in the beginning and 449.8MB in the end (delta: 167.8MB). Free memory was 233.6MB in the beginning and 227.9MB in the end (delta: 5.8MB). Peak memory consumption was 260.2MB. Max. memory is 8.0GB. [2024-11-03 09:01:04,159 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 212.9MB. Free memory is still 166.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 09:01:04,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.71ms. Allocated memory is still 282.1MB. Free memory was 233.6MB in the beginning and 215.5MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-11-03 09:01:04,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.52ms. Allocated memory is still 282.1MB. Free memory was 215.5MB in the beginning and 212.7MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-03 09:01:04,159 INFO L158 Benchmark]: Boogie Preprocessor took 58.74ms. Allocated memory is still 282.1MB. Free memory was 212.7MB in the beginning and 209.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-03 09:01:04,160 INFO L158 Benchmark]: RCFGBuilder took 733.06ms. Allocated memory is still 282.1MB. Free memory was 209.2MB in the beginning and 238.6MB in the end (delta: -29.4MB). Peak memory consumption was 30.9MB. Max. memory is 8.0GB. [2024-11-03 09:01:04,160 INFO L158 Benchmark]: TraceAbstraction took 13637.40ms. Allocated memory was 282.1MB in the beginning and 449.8MB in the end (delta: 167.8MB). Free memory was 237.5MB in the beginning and 227.9MB in the end (delta: 9.7MB). Peak memory consumption was 262.9MB. Max. memory is 8.0GB. [2024-11-03 09:01:04,161 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 212.9MB. Free memory is still 166.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 324.71ms. Allocated memory is still 282.1MB. Free memory was 233.6MB in the beginning and 215.5MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.52ms. Allocated memory is still 282.1MB. Free memory was 215.5MB in the beginning and 212.7MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.74ms. Allocated memory is still 282.1MB. Free memory was 212.7MB in the beginning and 209.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 733.06ms. Allocated memory is still 282.1MB. Free memory was 209.2MB in the beginning and 238.6MB in the end (delta: -29.4MB). Peak memory consumption was 30.9MB. Max. memory is 8.0GB. * TraceAbstraction took 13637.40ms. Allocated memory was 282.1MB in the beginning and 449.8MB in the end (delta: 167.8MB). Free memory was 237.5MB in the beginning and 227.9MB in the end (delta: 9.7MB). Peak memory consumption was 262.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 681]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 22, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1259 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1259 mSDsluCounter, 8293 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3573 mSDsCounter, 453 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2558 IncrementalHoareTripleChecker+Invalid, 3011 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 453 mSolverCounterUnsat, 4720 mSDtfsCounter, 2558 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10650 GetRequests, 10617 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6019occurred in iteration=20, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 2918 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 5343 NumberOfCodeBlocks, 5343 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 10642 ConstructedInterpolants, 0 QuantifiedInterpolants, 14626 SizeOfPredicates, 2 NumberOfNonLiveVariables, 6126 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 44 InterpolantComputations, 40 PerfectInterpolantSequences, 34872/34976 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((blastFlag == 2) && (s__s3__tmp__next_state___0 == 8576)) && (8592 == s__state)) || (((blastFlag == 2) && (s__s3__tmp__next_state___0 == 8576)) && (8608 == s__state))) || (((blastFlag == 2) && (8656 == s__state)) && (s__s3__tmp__next_state___0 != 8640))) || (((blastFlag == 2) && (8466 == s__state)) && (s__s3__tmp__next_state___0 != 8640))) || (((blastFlag == 2) && (s__s3__tmp__next_state___0 == 8576)) && (8640 == s__state))) || ((blastFlag == 2) && (8512 == s__state))) || ((blastFlag == 3) && (0 != s__hit))) || (((blastFlag != 4) && (8608 == s__state)) && (0 != s__hit))) || (((8448 == s__state) && (blastFlag == 2)) && (s__s3__tmp__next_state___0 == 8576))) || (((blastFlag != 4) && (8640 == s__state)) && (0 != s__hit))) || ((blastFlag == 2) && (8560 == s__state))) || (((8448 == s__state) && (s__s3__tmp__next_state___0 == 3)) && (blastFlag == 3))) || ((blastFlag == 0) && (8464 == s__state))) || (((8672 == s__state) && (s__s3__tmp__next_state___0 != 8640)) && (blastFlag == 3))) || ((blastFlag == 1) && (8496 == s__state))) || (((blastFlag != 4) && (0 != s__hit)) && (8592 == s__state))) || (3 == s__state)) || ((blastFlag == 2) && (0 != s__hit))) || ((blastFlag == 2) && (8544 == s__state))) || (((blastFlag == 2) && (s__s3__tmp__next_state___0 != 8640)) && (8496 == s__state))) || ((blastFlag == 2) && (8528 == s__state))) || (((blastFlag == 2) && (s__s3__tmp__next_state___0 == 8576)) && (8576 == s__state))) RESULT: Ultimate proved your program to be correct! [2024-11-03 09:01:04,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...