/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_2a_alt.BV.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 20:29:04,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 20:29:04,332 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-05 20:29:04,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 20:29:04,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 20:29:04,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 20:29:04,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 20:29:04,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 20:29:04,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 20:29:04,370 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 20:29:04,370 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 20:29:04,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 20:29:04,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 20:29:04,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 20:29:04,372 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 20:29:04,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 20:29:04,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 20:29:04,373 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 20:29:04,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 20:29:04,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 20:29:04,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 20:29:04,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 20:29:04,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 20:29:04,375 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 20:29:04,375 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 20:29:04,375 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 20:29:04,375 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 20:29:04,376 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 20:29:04,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 20:29:04,376 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 20:29:04,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 20:29:04,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 20:29:04,377 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 20:29:04,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 20:29:04,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:29:04,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 20:29:04,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 20:29:04,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 20:29:04,378 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 20:29:04,379 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 20:29:04,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 20:29:04,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 20:29:04,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 20:29:04,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 20:29:04,380 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-05 20:29:04,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 20:29:04,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 20:29:04,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 20:29:04,645 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 20:29:04,645 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 20:29:04,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_srvr_2a_alt.BV.c.cil.c [2024-11-05 20:29:06,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 20:29:06,237 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 20:29:06,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_2a_alt.BV.c.cil.c [2024-11-05 20:29:06,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6f68b4f2/86ff6a08046845ffa0b85eed00d9ffb9/FLAGf4ba1a26a [2024-11-05 20:29:06,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6f68b4f2/86ff6a08046845ffa0b85eed00d9ffb9 [2024-11-05 20:29:06,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 20:29:06,266 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 20:29:06,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 20:29:06,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 20:29:06,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 20:29:06,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:29:06" (1/1) ... [2024-11-05 20:29:06,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77132903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:06, skipping insertion in model container [2024-11-05 20:29:06,275 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:29:06" (1/1) ... [2024-11-05 20:29:06,312 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 20:29:06,535 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_2a_alt.BV.c.cil.c[44811,44824] [2024-11-05 20:29:06,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:29:06,561 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 20:29:06,604 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_2a_alt.BV.c.cil.c[44811,44824] [2024-11-05 20:29:06,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:29:06,626 INFO L204 MainTranslator]: Completed translation [2024-11-05 20:29:06,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:06 WrapperNode [2024-11-05 20:29:06,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 20:29:06,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 20:29:06,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 20:29:06,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 20:29:06,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:06" (1/1) ... [2024-11-05 20:29:06,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:06" (1/1) ... [2024-11-05 20:29:06,681 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 526 [2024-11-05 20:29:06,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 20:29:06,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 20:29:06,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 20:29:06,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 20:29:06,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:06" (1/1) ... [2024-11-05 20:29:06,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:06" (1/1) ... [2024-11-05 20:29:06,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:06" (1/1) ... [2024-11-05 20:29:06,738 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-05 20:29:06,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:06" (1/1) ... [2024-11-05 20:29:06,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:06" (1/1) ... [2024-11-05 20:29:06,746 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:06" (1/1) ... [2024-11-05 20:29:06,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:06" (1/1) ... [2024-11-05 20:29:06,754 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:06" (1/1) ... [2024-11-05 20:29:06,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:06" (1/1) ... [2024-11-05 20:29:06,759 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 20:29:06,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 20:29:06,761 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 20:29:06,761 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 20:29:06,762 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:06" (1/1) ... [2024-11-05 20:29:06,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:29:06,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 20:29:06,793 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-05 20:29:06,799 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-05 20:29:06,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 20:29:06,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 20:29:06,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 20:29:06,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 20:29:06,951 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 20:29:06,953 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 20:29:06,981 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-05 20:29:07,474 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2024-11-05 20:29:07,477 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2024-11-05 20:29:07,535 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-11-05 20:29:07,535 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 20:29:07,553 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 20:29:07,553 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 20:29:07,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:29:07 BoogieIcfgContainer [2024-11-05 20:29:07,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 20:29:07,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 20:29:07,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 20:29:07,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 20:29:07,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:29:06" (1/3) ... [2024-11-05 20:29:07,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51434a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:29:07, skipping insertion in model container [2024-11-05 20:29:07,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:06" (2/3) ... [2024-11-05 20:29:07,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51434a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:29:07, skipping insertion in model container [2024-11-05 20:29:07,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:29:07" (3/3) ... [2024-11-05 20:29:07,566 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_2a_alt.BV.c.cil.c [2024-11-05 20:29:07,582 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 20:29:07,583 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 20:29:07,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 20:29:07,646 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;@448ff022, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 20:29:07,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 20:29:07,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 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-05 20:29:07,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-05 20:29:07,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:07,660 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-05 20:29:07,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:07,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:07,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1632002022, now seen corresponding path program 1 times [2024-11-05 20:29:07,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:07,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [92435923] [2024-11-05 20:29:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:07,674 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-05 20:29:07,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:07,678 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-05 20:29:07,681 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-05 20:29:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:07,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:29:07,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:07,865 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-05 20:29:07,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:07,905 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-05 20:29:07,907 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:07,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [92435923] [2024-11-05 20:29:07,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [92435923] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:07,908 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:07,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-05 20:29:07,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984992710] [2024-11-05 20:29:07,910 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:07,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:29:07,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:07,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:29:07,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 20:29:07,943 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 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-05 20:29:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:08,180 INFO L93 Difference]: Finished difference Result 275 states and 473 transitions. [2024-11-05 20:29:08,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:29:08,183 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-05 20:29:08,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:08,194 INFO L225 Difference]: With dead ends: 275 [2024-11-05 20:29:08,194 INFO L226 Difference]: Without dead ends: 125 [2024-11-05 20:29:08,198 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-05 20:29:08,203 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 8 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:08,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 325 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:29:08,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-05 20:29:08,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-05 20:29:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.4919354838709677) internal successors, (185), 124 states have internal predecessors, (185), 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-05 20:29:08,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 185 transitions. [2024-11-05 20:29:08,237 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 185 transitions. Word has length 44 [2024-11-05 20:29:08,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:08,237 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 185 transitions. [2024-11-05 20:29:08,238 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-05 20:29:08,238 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 185 transitions. [2024-11-05 20:29:08,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-05 20:29:08,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:08,241 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-05 20:29:08,244 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-05 20:29:08,441 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-05 20:29:08,442 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:08,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:08,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2033157093, now seen corresponding path program 1 times [2024-11-05 20:29:08,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:08,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1192561031] [2024-11-05 20:29:08,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:08,443 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-05 20:29:08,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:08,444 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-05 20:29:08,445 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-05 20:29:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:08,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:29:08,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:08,582 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-05 20:29:08,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:08,656 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-05 20:29:08,657 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:08,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1192561031] [2024-11-05 20:29:08,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1192561031] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:08,657 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:08,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:29:08,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259360279] [2024-11-05 20:29:08,658 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:08,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:29:08,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:08,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:29:08,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:29:08,660 INFO L87 Difference]: Start difference. First operand 125 states and 185 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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-05 20:29:08,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:08,733 INFO L93 Difference]: Finished difference Result 432 states and 659 transitions. [2024-11-05 20:29:08,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:29:08,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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-05 20:29:08,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:08,736 INFO L225 Difference]: With dead ends: 432 [2024-11-05 20:29:08,737 INFO L226 Difference]: Without dead ends: 326 [2024-11-05 20:29:08,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 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-05 20:29:08,738 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 346 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:08,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 487 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:08,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-05 20:29:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2024-11-05 20:29:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.5138461538461538) internal successors, (492), 325 states have internal predecessors, (492), 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-05 20:29:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 492 transitions. [2024-11-05 20:29:08,780 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 492 transitions. Word has length 60 [2024-11-05 20:29:08,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:08,781 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 492 transitions. [2024-11-05 20:29:08,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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-05 20:29:08,781 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 492 transitions. [2024-11-05 20:29:08,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-05 20:29:08,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:08,786 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, 1] [2024-11-05 20:29:08,792 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-05 20:29:08,986 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-05 20:29:08,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:08,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:08,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1976048908, now seen corresponding path program 1 times [2024-11-05 20:29:08,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:08,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1002055892] [2024-11-05 20:29:08,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:08,988 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-05 20:29:08,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:08,992 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-05 20:29:08,993 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-05 20:29:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:09,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:29:09,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-05 20:29:09,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-05 20:29:09,144 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:09,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1002055892] [2024-11-05 20:29:09,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1002055892] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:09,144 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:09,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-05 20:29:09,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937662255] [2024-11-05 20:29:09,145 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:09,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:29:09,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:09,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:29:09,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 20:29:09,147 INFO L87 Difference]: Start difference. First operand 326 states and 492 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-05 20:29:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:09,171 INFO L93 Difference]: Finished difference Result 635 states and 964 transitions. [2024-11-05 20:29:09,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:29:09,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 82 [2024-11-05 20:29:09,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:09,174 INFO L225 Difference]: With dead ends: 635 [2024-11-05 20:29:09,174 INFO L226 Difference]: Without dead ends: 328 [2024-11-05 20:29:09,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 161 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-05 20:29:09,179 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 6 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:09,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 326 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:09,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-05 20:29:09,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2024-11-05 20:29:09,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.510703363914373) internal successors, (494), 327 states have internal predecessors, (494), 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-05 20:29:09,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 494 transitions. [2024-11-05 20:29:09,204 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 494 transitions. Word has length 82 [2024-11-05 20:29:09,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:09,205 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 494 transitions. [2024-11-05 20:29:09,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-05 20:29:09,205 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 494 transitions. [2024-11-05 20:29:09,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-05 20:29:09,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:09,210 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:29:09,214 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-05 20:29:09,411 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-05 20:29:09,411 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:09,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:09,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1614320406, now seen corresponding path program 1 times [2024-11-05 20:29:09,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:09,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1081736919] [2024-11-05 20:29:09,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:09,413 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-05 20:29:09,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:09,416 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-05 20:29:09,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 20:29:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:09,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:29:09,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:09,519 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-05 20:29:09,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-05 20:29:09,554 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:09,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1081736919] [2024-11-05 20:29:09,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1081736919] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:09,555 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:09,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:29:09,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475720246] [2024-11-05 20:29:09,555 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:09,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:29:09,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:09,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:29:09,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:29:09,557 INFO L87 Difference]: Start difference. First operand 328 states and 494 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-05 20:29:09,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:09,814 INFO L93 Difference]: Finished difference Result 823 states and 1280 transitions. [2024-11-05 20:29:09,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:29:09,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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 103 [2024-11-05 20:29:09,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:09,817 INFO L225 Difference]: With dead ends: 823 [2024-11-05 20:29:09,817 INFO L226 Difference]: Without dead ends: 516 [2024-11-05 20:29:09,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 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-05 20:29:09,819 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 74 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:09,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 310 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:29:09,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-05 20:29:09,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2024-11-05 20:29:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 1.4174757281553398) internal successors, (730), 515 states have internal predecessors, (730), 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-05 20:29:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 730 transitions. [2024-11-05 20:29:09,833 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 730 transitions. Word has length 103 [2024-11-05 20:29:09,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:09,833 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 730 transitions. [2024-11-05 20:29:09,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-05 20:29:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 730 transitions. [2024-11-05 20:29:09,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-05 20:29:09,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:09,835 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:29:09,839 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-05 20:29:10,035 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-05 20:29:10,036 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:10,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:10,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2020105131, now seen corresponding path program 1 times [2024-11-05 20:29:10,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:10,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [60206909] [2024-11-05 20:29:10,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:10,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-05 20:29:10,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:10,038 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-05 20:29:10,040 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-05 20:29:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:10,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:29:10,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-05 20:29:10,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-05 20:29:10,192 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:10,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [60206909] [2024-11-05 20:29:10,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [60206909] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:10,193 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:10,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:29:10,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723202485] [2024-11-05 20:29:10,195 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:10,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:29:10,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:10,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:29:10,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:29:10,197 INFO L87 Difference]: Start difference. First operand 516 states and 730 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-05 20:29:10,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:10,399 INFO L93 Difference]: Finished difference Result 1123 states and 1612 transitions. [2024-11-05 20:29:10,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:29:10,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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 104 [2024-11-05 20:29:10,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:10,402 INFO L225 Difference]: With dead ends: 1123 [2024-11-05 20:29:10,402 INFO L226 Difference]: Without dead ends: 628 [2024-11-05 20:29:10,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 204 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-05 20:29:10,404 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 55 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:10,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 280 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:29:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-11-05 20:29:10,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2024-11-05 20:29:10,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.4162679425837321) internal successors, (888), 627 states have internal predecessors, (888), 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-05 20:29:10,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 888 transitions. [2024-11-05 20:29:10,421 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 888 transitions. Word has length 104 [2024-11-05 20:29:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:10,421 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 888 transitions. [2024-11-05 20:29:10,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-05 20:29:10,422 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 888 transitions. [2024-11-05 20:29:10,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-05 20:29:10,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:10,424 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 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] [2024-11-05 20:29:10,428 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-05 20:29:10,624 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-05 20:29:10,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:10,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:10,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1728047681, now seen corresponding path program 1 times [2024-11-05 20:29:10,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:10,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1552011972] [2024-11-05 20:29:10,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:10,626 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-05 20:29:10,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:10,627 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-05 20:29:10,628 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-05 20:29:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:10,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:29:10,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:10,737 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-05 20:29:10,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-05 20:29:10,764 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:10,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1552011972] [2024-11-05 20:29:10,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1552011972] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:10,764 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:10,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:29:10,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284526936] [2024-11-05 20:29:10,764 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:10,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:29:10,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:10,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:29:10,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:29:10,766 INFO L87 Difference]: Start difference. First operand 628 states and 888 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-05 20:29:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:10,958 INFO L93 Difference]: Finished difference Result 1310 states and 1868 transitions. [2024-11-05 20:29:10,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:29:10,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-05 20:29:10,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:10,962 INFO L225 Difference]: With dead ends: 1310 [2024-11-05 20:29:10,962 INFO L226 Difference]: Without dead ends: 703 [2024-11-05 20:29:10,963 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-05 20:29:10,964 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 55 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:10,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 326 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:29:10,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2024-11-05 20:29:10,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 703. [2024-11-05 20:29:10,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 702 states have (on average 1.3888888888888888) internal successors, (975), 702 states have internal predecessors, (975), 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-05 20:29:10,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 975 transitions. [2024-11-05 20:29:10,979 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 975 transitions. Word has length 159 [2024-11-05 20:29:10,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:10,979 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 975 transitions. [2024-11-05 20:29:10,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-05 20:29:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 975 transitions. [2024-11-05 20:29:10,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-05 20:29:10,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:10,982 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-05 20:29:10,987 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-05 20:29:11,182 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-05 20:29:11,183 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:11,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:11,184 INFO L85 PathProgramCache]: Analyzing trace with hash -546671195, now seen corresponding path program 1 times [2024-11-05 20:29:11,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:11,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1697782179] [2024-11-05 20:29:11,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:11,184 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-05 20:29:11,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:11,185 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-05 20:29:11,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 (8)] Waiting until timeout for monitored process [2024-11-05 20:29:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:11,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:29:11,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:11,295 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-05 20:29:11,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-05 20:29:11,325 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:11,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1697782179] [2024-11-05 20:29:11,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1697782179] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:11,326 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:11,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:29:11,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905606616] [2024-11-05 20:29:11,326 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:11,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:29:11,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:11,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:29:11,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:29:11,328 INFO L87 Difference]: Start difference. First operand 703 states and 975 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-05 20:29:11,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:11,544 INFO L93 Difference]: Finished difference Result 1511 states and 2141 transitions. [2024-11-05 20:29:11,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:29:11,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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 200 [2024-11-05 20:29:11,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:11,548 INFO L225 Difference]: With dead ends: 1511 [2024-11-05 20:29:11,548 INFO L226 Difference]: Without dead ends: 829 [2024-11-05 20:29:11,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 396 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-05 20:29:11,550 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 80 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:11,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 278 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:29:11,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-11-05 20:29:11,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2024-11-05 20:29:11,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 828 states have (on average 1.3405797101449275) internal successors, (1110), 828 states have internal predecessors, (1110), 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-05 20:29:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1110 transitions. [2024-11-05 20:29:11,567 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1110 transitions. Word has length 200 [2024-11-05 20:29:11,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:11,568 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1110 transitions. [2024-11-05 20:29:11,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-05 20:29:11,568 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1110 transitions. [2024-11-05 20:29:11,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-05 20:29:11,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:11,571 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:11,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-05 20:29:11,774 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-05 20:29:11,774 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:11,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:11,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1371194429, now seen corresponding path program 1 times [2024-11-05 20:29:11,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:11,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [641153972] [2024-11-05 20:29:11,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:11,775 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-05 20:29:11,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:11,778 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-05 20:29:11,779 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-05 20:29:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:11,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:29:11,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-05 20:29:11,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-05 20:29:11,929 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:11,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [641153972] [2024-11-05 20:29:11,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [641153972] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:11,929 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:11,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:29:11,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079190664] [2024-11-05 20:29:11,930 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:11,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:29:11,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:11,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:29:11,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:29:11,931 INFO L87 Difference]: Start difference. First operand 829 states and 1110 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 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-05 20:29:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:12,106 INFO L93 Difference]: Finished difference Result 1778 states and 2405 transitions. [2024-11-05 20:29:12,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:29:12,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 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 207 [2024-11-05 20:29:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:12,110 INFO L225 Difference]: With dead ends: 1778 [2024-11-05 20:29:12,110 INFO L226 Difference]: Without dead ends: 970 [2024-11-05 20:29:12,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 410 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-05 20:29:12,112 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 63 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:12,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 238 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:29:12,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-11-05 20:29:12,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2024-11-05 20:29:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.3312693498452013) internal successors, (1290), 969 states have internal predecessors, (1290), 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-05 20:29:12,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1290 transitions. [2024-11-05 20:29:12,149 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1290 transitions. Word has length 207 [2024-11-05 20:29:12,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:12,150 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1290 transitions. [2024-11-05 20:29:12,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 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-05 20:29:12,150 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1290 transitions. [2024-11-05 20:29:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-05 20:29:12,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:12,153 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 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] [2024-11-05 20:29:12,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-05 20:29:12,356 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-05 20:29:12,356 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:12,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:12,357 INFO L85 PathProgramCache]: Analyzing trace with hash -328856853, now seen corresponding path program 1 times [2024-11-05 20:29:12,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:12,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [7032562] [2024-11-05 20:29:12,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:12,357 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-05 20:29:12,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:12,359 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-05 20:29:12,360 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-05 20:29:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:12,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:29:12,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:12,487 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2024-11-05 20:29:12,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2024-11-05 20:29:12,526 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:12,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [7032562] [2024-11-05 20:29:12,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [7032562] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:12,527 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:12,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-05 20:29:12,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835862607] [2024-11-05 20:29:12,527 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:12,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:29:12,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:12,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:29:12,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 20:29:12,528 INFO L87 Difference]: Start difference. First operand 970 states and 1290 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-05 20:29:12,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:12,664 INFO L93 Difference]: Finished difference Result 2006 states and 2687 transitions. [2024-11-05 20:29:12,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:29:12,665 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 240 [2024-11-05 20:29:12,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:12,670 INFO L225 Difference]: With dead ends: 2006 [2024-11-05 20:29:12,671 INFO L226 Difference]: Without dead ends: 1057 [2024-11-05 20:29:12,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 477 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-05 20:29:12,673 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:12,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 272 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:12,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2024-11-05 20:29:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1057. [2024-11-05 20:29:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 1056 states have (on average 1.3181818181818181) internal successors, (1392), 1056 states have internal predecessors, (1392), 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-05 20:29:12,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1392 transitions. [2024-11-05 20:29:12,698 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1392 transitions. Word has length 240 [2024-11-05 20:29:12,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:12,699 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1392 transitions. [2024-11-05 20:29:12,699 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-05 20:29:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1392 transitions. [2024-11-05 20:29:12,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-05 20:29:12,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:12,702 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 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] [2024-11-05 20:29:12,706 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 (10)] Ended with exit code 0 [2024-11-05 20:29:12,903 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-05 20:29:12,903 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:12,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:12,903 INFO L85 PathProgramCache]: Analyzing trace with hash 557282683, now seen corresponding path program 1 times [2024-11-05 20:29:12,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:12,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [79287514] [2024-11-05 20:29:12,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:12,904 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-05 20:29:12,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:12,905 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-05 20:29:12,907 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-05 20:29:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:12,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:29:12,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2024-11-05 20:29:13,080 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2024-11-05 20:29:13,165 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:13,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [79287514] [2024-11-05 20:29:13,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [79287514] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:13,166 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:13,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-05 20:29:13,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272557130] [2024-11-05 20:29:13,166 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:13,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:29:13,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:13,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:29:13,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 20:29:13,168 INFO L87 Difference]: Start difference. First operand 1057 states and 1392 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-05 20:29:13,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:13,206 INFO L93 Difference]: Finished difference Result 3123 states and 4117 transitions. [2024-11-05 20:29:13,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:29:13,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 244 [2024-11-05 20:29:13,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:13,213 INFO L225 Difference]: With dead ends: 3123 [2024-11-05 20:29:13,213 INFO L226 Difference]: Without dead ends: 2087 [2024-11-05 20:29:13,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 485 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-05 20:29:13,216 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 125 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 488 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-05 20:29:13,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 488 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:13,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2024-11-05 20:29:13,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 2085. [2024-11-05 20:29:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 2084 states have (on average 1.316218809980806) internal successors, (2743), 2084 states have internal predecessors, (2743), 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-05 20:29:13,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 2743 transitions. [2024-11-05 20:29:13,294 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 2743 transitions. Word has length 244 [2024-11-05 20:29:13,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:13,295 INFO L471 AbstractCegarLoop]: Abstraction has 2085 states and 2743 transitions. [2024-11-05 20:29:13,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-05 20:29:13,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 2743 transitions. [2024-11-05 20:29:13,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-05 20:29:13,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:13,301 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 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-05 20:29:13,306 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-05 20:29:13,501 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-05 20:29:13,502 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:13,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:13,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1971337506, now seen corresponding path program 1 times [2024-11-05 20:29:13,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:13,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1658777646] [2024-11-05 20:29:13,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:13,503 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-05 20:29:13,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:13,507 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-05 20:29:13,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 (12)] Waiting until timeout for monitored process [2024-11-05 20:29:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:13,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:29:13,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-05 20:29:13,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-05 20:29:13,761 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:13,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1658777646] [2024-11-05 20:29:13,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1658777646] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:13,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:13,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-05 20:29:13,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443330115] [2024-11-05 20:29:13,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:13,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:29:13,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:13,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:29:13,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:13,763 INFO L87 Difference]: Start difference. First operand 2085 states and 2743 transitions. Second operand has 6 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 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-05 20:29:14,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:14,411 INFO L93 Difference]: Finished difference Result 7022 states and 9251 transitions. [2024-11-05 20:29:14,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 20:29:14,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 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 245 [2024-11-05 20:29:14,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:14,427 INFO L225 Difference]: With dead ends: 7022 [2024-11-05 20:29:14,428 INFO L226 Difference]: Without dead ends: 4958 [2024-11-05 20:29:14,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 487 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-05 20:29:14,433 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 362 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:14,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 965 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 20:29:14,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2024-11-05 20:29:14,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 2992. [2024-11-05 20:29:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2992 states, 2991 states have (on average 1.3463724506853896) internal successors, (4027), 2991 states have internal predecessors, (4027), 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-05 20:29:14,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2992 states to 2992 states and 4027 transitions. [2024-11-05 20:29:14,556 INFO L78 Accepts]: Start accepts. Automaton has 2992 states and 4027 transitions. Word has length 245 [2024-11-05 20:29:14,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:14,557 INFO L471 AbstractCegarLoop]: Abstraction has 2992 states and 4027 transitions. [2024-11-05 20:29:14,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 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-05 20:29:14,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2992 states and 4027 transitions. [2024-11-05 20:29:14,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-05 20:29:14,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:14,563 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-05 20:29:14,567 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-05 20:29:14,766 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-05 20:29:14,767 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:14,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:14,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1403818874, now seen corresponding path program 1 times [2024-11-05 20:29:14,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:14,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [140277525] [2024-11-05 20:29:14,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:14,768 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-05 20:29:14,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:14,770 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-05 20:29:14,771 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-05 20:29:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:14,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:29:14,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:14,926 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 434 proven. 17 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-05 20:29:14,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 434 proven. 17 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-05 20:29:14,998 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:14,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [140277525] [2024-11-05 20:29:14,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [140277525] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:14,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:14,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-05 20:29:14,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854094056] [2024-11-05 20:29:14,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:14,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:29:14,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:15,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:29:15,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:15,000 INFO L87 Difference]: Start difference. First operand 2992 states and 4027 transitions. Second operand has 6 states, 6 states have (on average 34.666666666666664) internal successors, (208), 6 states have internal predecessors, (208), 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-05 20:29:15,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:15,774 INFO L93 Difference]: Finished difference Result 9043 states and 12175 transitions. [2024-11-05 20:29:15,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 20:29:15,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.666666666666664) internal successors, (208), 6 states have internal predecessors, (208), 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 254 [2024-11-05 20:29:15,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:15,799 INFO L225 Difference]: With dead ends: 9043 [2024-11-05 20:29:15,800 INFO L226 Difference]: Without dead ends: 6072 [2024-11-05 20:29:15,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 506 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:29:15,807 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 327 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:15,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 892 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-05 20:29:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2024-11-05 20:29:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 4020. [2024-11-05 20:29:15,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4020 states, 4019 states have (on average 1.324210002488181) internal successors, (5322), 4019 states have internal predecessors, (5322), 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-05 20:29:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 5322 transitions. [2024-11-05 20:29:15,956 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 5322 transitions. Word has length 254 [2024-11-05 20:29:15,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:15,956 INFO L471 AbstractCegarLoop]: Abstraction has 4020 states and 5322 transitions. [2024-11-05 20:29:15,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.666666666666664) internal successors, (208), 6 states have internal predecessors, (208), 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-05 20:29:15,956 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 5322 transitions. [2024-11-05 20:29:15,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-05 20:29:15,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:15,966 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 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] [2024-11-05 20:29:15,975 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 (13)] Ended with exit code 0 [2024-11-05 20:29:16,167 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-05 20:29:16,167 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:16,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:16,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1390369177, now seen corresponding path program 1 times [2024-11-05 20:29:16,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:16,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [805432749] [2024-11-05 20:29:16,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:16,168 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-05 20:29:16,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:16,171 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-05 20:29:16,172 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-05 20:29:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:16,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:29:16,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 498 proven. 0 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2024-11-05 20:29:16,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:16,338 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 498 proven. 0 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2024-11-05 20:29:16,338 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:16,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [805432749] [2024-11-05 20:29:16,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [805432749] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:16,339 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:16,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-05 20:29:16,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789534099] [2024-11-05 20:29:16,339 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:16,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:29:16,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:16,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:29:16,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 20:29:16,341 INFO L87 Difference]: Start difference. First operand 4020 states and 5322 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-05 20:29:16,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:16,523 INFO L93 Difference]: Finished difference Result 8356 states and 11162 transitions. [2024-11-05 20:29:16,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:29:16,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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 265 [2024-11-05 20:29:16,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:16,541 INFO L225 Difference]: With dead ends: 8356 [2024-11-05 20:29:16,541 INFO L226 Difference]: Without dead ends: 4516 [2024-11-05 20:29:16,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 527 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-05 20:29:16,547 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 12 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:16,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 269 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:16,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4516 states. [2024-11-05 20:29:16,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4516 to 4516. [2024-11-05 20:29:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4516 states, 4515 states have (on average 1.306312292358804) internal successors, (5898), 4515 states have internal predecessors, (5898), 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-05 20:29:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4516 states to 4516 states and 5898 transitions. [2024-11-05 20:29:16,679 INFO L78 Accepts]: Start accepts. Automaton has 4516 states and 5898 transitions. Word has length 265 [2024-11-05 20:29:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:16,679 INFO L471 AbstractCegarLoop]: Abstraction has 4516 states and 5898 transitions. [2024-11-05 20:29:16,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-05 20:29:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 4516 states and 5898 transitions. [2024-11-05 20:29:16,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-05 20:29:16,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:16,689 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-05 20:29:16,694 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 (14)] Forceful destruction successful, exit code 0 [2024-11-05 20:29:16,889 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-05 20:29:16,890 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:16,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:16,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1830987648, now seen corresponding path program 1 times [2024-11-05 20:29:16,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:16,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1222837544] [2024-11-05 20:29:16,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:16,891 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-05 20:29:16,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:16,892 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-05 20:29:16,894 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-05 20:29:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:16,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:29:16,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:17,087 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2024-11-05 20:29:17,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2024-11-05 20:29:17,192 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:17,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1222837544] [2024-11-05 20:29:17,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1222837544] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:17,192 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:17,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-05 20:29:17,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653306860] [2024-11-05 20:29:17,193 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:17,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:29:17,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:17,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:29:17,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 20:29:17,194 INFO L87 Difference]: Start difference. First operand 4516 states and 5898 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-05 20:29:17,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:17,318 INFO L93 Difference]: Finished difference Result 12468 states and 16276 transitions. [2024-11-05 20:29:17,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:29:17,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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 269 [2024-11-05 20:29:17,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:17,344 INFO L225 Difference]: With dead ends: 12468 [2024-11-05 20:29:17,344 INFO L226 Difference]: Without dead ends: 8132 [2024-11-05 20:29:17,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 535 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-05 20:29:17,350 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 109 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:17,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 492 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:17,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8132 states. [2024-11-05 20:29:17,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8132 to 8130. [2024-11-05 20:29:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8130 states, 8129 states have (on average 1.304219461188338) internal successors, (10602), 8129 states have internal predecessors, (10602), 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-05 20:29:17,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8130 states to 8130 states and 10602 transitions. [2024-11-05 20:29:17,576 INFO L78 Accepts]: Start accepts. Automaton has 8130 states and 10602 transitions. Word has length 269 [2024-11-05 20:29:17,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:17,576 INFO L471 AbstractCegarLoop]: Abstraction has 8130 states and 10602 transitions. [2024-11-05 20:29:17,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-05 20:29:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 8130 states and 10602 transitions. [2024-11-05 20:29:17,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-05 20:29:17,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:17,587 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 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] [2024-11-05 20:29:17,592 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-05 20:29:17,788 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-05 20:29:17,788 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:17,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:17,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1663763636, now seen corresponding path program 1 times [2024-11-05 20:29:17,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:17,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2086035601] [2024-11-05 20:29:17,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:17,789 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-05 20:29:17,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:17,792 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-05 20:29:17,794 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-05 20:29:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:17,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:29:17,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 538 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2024-11-05 20:29:18,102 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 538 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2024-11-05 20:29:18,334 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:18,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2086035601] [2024-11-05 20:29:18,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2086035601] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:18,335 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:18,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:29:18,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017801668] [2024-11-05 20:29:18,335 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:18,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:29:18,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:18,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:29:18,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:29:18,336 INFO L87 Difference]: Start difference. First operand 8130 states and 10602 transitions. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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-05 20:29:18,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:18,539 INFO L93 Difference]: Finished difference Result 21128 states and 27559 transitions. [2024-11-05 20:29:18,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:29:18,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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 293 [2024-11-05 20:29:18,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:18,574 INFO L225 Difference]: With dead ends: 21128 [2024-11-05 20:29:18,574 INFO L226 Difference]: Without dead ends: 13336 [2024-11-05 20:29:18,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 582 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-05 20:29:18,587 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 199 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:18,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 618 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13336 states. [2024-11-05 20:29:18,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13336 to 13336. [2024-11-05 20:29:18,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13336 states, 13335 states have (on average 1.3048368953880765) internal successors, (17400), 13335 states have internal predecessors, (17400), 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-05 20:29:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13336 states to 13336 states and 17400 transitions. [2024-11-05 20:29:18,953 INFO L78 Accepts]: Start accepts. Automaton has 13336 states and 17400 transitions. Word has length 293 [2024-11-05 20:29:18,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:18,954 INFO L471 AbstractCegarLoop]: Abstraction has 13336 states and 17400 transitions. [2024-11-05 20:29:18,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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-05 20:29:18,954 INFO L276 IsEmpty]: Start isEmpty. Operand 13336 states and 17400 transitions. [2024-11-05 20:29:18,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-11-05 20:29:18,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:18,969 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2024-11-05 20:29:18,975 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 (16)] Ended with exit code 0 [2024-11-05 20:29:19,173 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-05 20:29:19,173 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:19,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:19,174 INFO L85 PathProgramCache]: Analyzing trace with hash -10155191, now seen corresponding path program 1 times [2024-11-05 20:29:19,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:19,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1590075240] [2024-11-05 20:29:19,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:19,174 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-05 20:29:19,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:19,176 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-05 20:29:19,177 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-05 20:29:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:19,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:29:19,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:19,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 725 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-05 20:29:19,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 725 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-05 20:29:19,361 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:19,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1590075240] [2024-11-05 20:29:19,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1590075240] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:19,361 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:19,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:29:19,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069385827] [2024-11-05 20:29:19,361 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:19,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:29:19,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:19,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:29:19,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:29:19,363 INFO L87 Difference]: Start difference. First operand 13336 states and 17400 transitions. Second operand has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 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-05 20:29:19,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:19,674 INFO L93 Difference]: Finished difference Result 22932 states and 30522 transitions. [2024-11-05 20:29:19,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:29:19,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 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 338 [2024-11-05 20:29:19,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:19,759 INFO L225 Difference]: With dead ends: 22932 [2024-11-05 20:29:19,759 INFO L226 Difference]: Without dead ends: 6561 [2024-11-05 20:29:19,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 672 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-05 20:29:19,775 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 54 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:19,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 333 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:29:19,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6561 states. [2024-11-05 20:29:19,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6561 to 5954. [2024-11-05 20:29:19,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5954 states, 5953 states have (on average 1.3107676801612633) internal successors, (7803), 5953 states have internal predecessors, (7803), 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-05 20:29:19,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5954 states to 5954 states and 7803 transitions. [2024-11-05 20:29:19,973 INFO L78 Accepts]: Start accepts. Automaton has 5954 states and 7803 transitions. Word has length 338 [2024-11-05 20:29:19,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:19,973 INFO L471 AbstractCegarLoop]: Abstraction has 5954 states and 7803 transitions. [2024-11-05 20:29:19,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 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-05 20:29:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 5954 states and 7803 transitions. [2024-11-05 20:29:19,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-11-05 20:29:19,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:19,991 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:19,995 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-05 20:29:20,191 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-05 20:29:20,191 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:20,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:20,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1138648841, now seen corresponding path program 1 times [2024-11-05 20:29:20,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:20,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [704258226] [2024-11-05 20:29:20,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:20,192 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-05 20:29:20,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:20,194 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-05 20:29:20,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-05 20:29:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:20,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:29:20,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:20,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 993 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2024-11-05 20:29:20,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 993 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2024-11-05 20:29:20,379 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:20,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [704258226] [2024-11-05 20:29:20,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [704258226] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:20,379 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:20,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-05 20:29:20,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519224853] [2024-11-05 20:29:20,380 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:20,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:29:20,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:20,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:29:20,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 20:29:20,381 INFO L87 Difference]: Start difference. First operand 5954 states and 7803 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-05 20:29:20,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:20,525 INFO L93 Difference]: Finished difference Result 11887 states and 15581 transitions. [2024-11-05 20:29:20,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:29:20,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 401 [2024-11-05 20:29:20,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:20,536 INFO L225 Difference]: With dead ends: 11887 [2024-11-05 20:29:20,537 INFO L226 Difference]: Without dead ends: 5954 [2024-11-05 20:29:20,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 800 GetRequests, 799 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-05 20:29:20,544 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:20,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 267 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:20,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2024-11-05 20:29:20,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 5954. [2024-11-05 20:29:20,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5954 states, 5953 states have (on average 1.3001847807827986) internal successors, (7740), 5953 states have internal predecessors, (7740), 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-05 20:29:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5954 states to 5954 states and 7740 transitions. [2024-11-05 20:29:20,657 INFO L78 Accepts]: Start accepts. Automaton has 5954 states and 7740 transitions. Word has length 401 [2024-11-05 20:29:20,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:20,657 INFO L471 AbstractCegarLoop]: Abstraction has 5954 states and 7740 transitions. [2024-11-05 20:29:20,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-05 20:29:20,658 INFO L276 IsEmpty]: Start isEmpty. Operand 5954 states and 7740 transitions. [2024-11-05 20:29:20,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2024-11-05 20:29:20,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:20,665 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:20,670 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 (18)] Ended with exit code 0 [2024-11-05 20:29:20,865 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-05 20:29:20,866 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:20,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:20,866 INFO L85 PathProgramCache]: Analyzing trace with hash -605452793, now seen corresponding path program 1 times [2024-11-05 20:29:20,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:20,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1200132641] [2024-11-05 20:29:20,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:20,867 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-05 20:29:20,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:20,868 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-05 20:29:20,869 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-05 20:29:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:20,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:29:20,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:21,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 1047 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2024-11-05 20:29:21,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:21,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 1047 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2024-11-05 20:29:21,075 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:21,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1200132641] [2024-11-05 20:29:21,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1200132641] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:21,075 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:21,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-05 20:29:21,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468168497] [2024-11-05 20:29:21,075 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:21,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:29:21,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:21,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:29:21,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 20:29:21,076 INFO L87 Difference]: Start difference. First operand 5954 states and 7740 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-05 20:29:21,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:21,225 INFO L93 Difference]: Finished difference Result 12601 states and 16547 transitions. [2024-11-05 20:29:21,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:29:21,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 402 [2024-11-05 20:29:21,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:21,235 INFO L225 Difference]: With dead ends: 12601 [2024-11-05 20:29:21,235 INFO L226 Difference]: Without dead ends: 6668 [2024-11-05 20:29:21,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 802 GetRequests, 801 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-05 20:29:21,243 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:21,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 267 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:21,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6668 states. [2024-11-05 20:29:21,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6668 to 6668. [2024-11-05 20:29:21,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6668 states, 6667 states have (on average 1.2837858107094646) internal successors, (8559), 6667 states have internal predecessors, (8559), 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-05 20:29:21,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6668 states to 6668 states and 8559 transitions. [2024-11-05 20:29:21,377 INFO L78 Accepts]: Start accepts. Automaton has 6668 states and 8559 transitions. Word has length 402 [2024-11-05 20:29:21,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:21,377 INFO L471 AbstractCegarLoop]: Abstraction has 6668 states and 8559 transitions. [2024-11-05 20:29:21,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-05 20:29:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 6668 states and 8559 transitions. [2024-11-05 20:29:21,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2024-11-05 20:29:21,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:21,385 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2024-11-05 20:29:21,390 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-05 20:29:21,586 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-05 20:29:21,586 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:21,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:21,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1033812017, now seen corresponding path program 1 times [2024-11-05 20:29:21,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:21,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [597492740] [2024-11-05 20:29:21,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:21,587 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-05 20:29:21,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:21,590 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-05 20:29:21,592 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-05 20:29:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:21,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:29:21,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1944 backedges. 1073 proven. 206 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked. [2024-11-05 20:29:22,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:23,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1944 backedges. 1168 proven. 111 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked. [2024-11-05 20:29:23,352 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:23,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [597492740] [2024-11-05 20:29:23,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [597492740] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:23,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:23,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-05 20:29:23,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883088418] [2024-11-05 20:29:23,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:23,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 20:29:23,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:23,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 20:29:23,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:29:23,354 INFO L87 Difference]: Start difference. First operand 6668 states and 8559 transitions. Second operand has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 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-05 20:29:24,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:24,391 INFO L93 Difference]: Finished difference Result 15942 states and 20538 transitions. [2024-11-05 20:29:24,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 20:29:24,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 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 419 [2024-11-05 20:29:24,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:24,405 INFO L225 Difference]: With dead ends: 15942 [2024-11-05 20:29:24,406 INFO L226 Difference]: Without dead ends: 9289 [2024-11-05 20:29:24,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 838 GetRequests, 832 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:29:24,415 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 184 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:24,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 734 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-05 20:29:24,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9289 states. [2024-11-05 20:29:24,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9289 to 8878. [2024-11-05 20:29:24,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8878 states, 8877 states have (on average 1.2702489579812999) internal successors, (11276), 8877 states have internal predecessors, (11276), 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-05 20:29:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 11276 transitions. [2024-11-05 20:29:24,671 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 11276 transitions. Word has length 419 [2024-11-05 20:29:24,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:24,672 INFO L471 AbstractCegarLoop]: Abstraction has 8878 states and 11276 transitions. [2024-11-05 20:29:24,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 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-05 20:29:24,672 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 11276 transitions. [2024-11-05 20:29:24,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2024-11-05 20:29:24,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:24,683 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 13, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:24,688 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-05 20:29:24,884 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-05 20:29:24,884 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:24,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:24,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1425451939, now seen corresponding path program 1 times [2024-11-05 20:29:24,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:24,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [426495479] [2024-11-05 20:29:24,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:24,886 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-05 20:29:24,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:24,889 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-05 20:29:24,890 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-05 20:29:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:25,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:29:25,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:25,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2045 backedges. 1224 proven. 0 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2024-11-05 20:29:25,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:25,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2045 backedges. 1224 proven. 0 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2024-11-05 20:29:25,095 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:25,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [426495479] [2024-11-05 20:29:25,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [426495479] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:25,095 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:25,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-05 20:29:25,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553513715] [2024-11-05 20:29:25,095 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:25,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:29:25,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:25,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:29:25,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 20:29:25,097 INFO L87 Difference]: Start difference. First operand 8878 states and 11276 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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-05 20:29:25,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:25,322 INFO L93 Difference]: Finished difference Result 17168 states and 21775 transitions. [2024-11-05 20:29:25,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:29:25,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 433 [2024-11-05 20:29:25,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:25,334 INFO L225 Difference]: With dead ends: 17168 [2024-11-05 20:29:25,335 INFO L226 Difference]: Without dead ends: 8311 [2024-11-05 20:29:25,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 863 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-05 20:29:25,344 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:25,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 267 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:25,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8311 states. [2024-11-05 20:29:25,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8311 to 7491. [2024-11-05 20:29:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7491 states, 7490 states have (on average 1.230574098798398) internal successors, (9217), 7490 states have internal predecessors, (9217), 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-05 20:29:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7491 states to 7491 states and 9217 transitions. [2024-11-05 20:29:25,561 INFO L78 Accepts]: Start accepts. Automaton has 7491 states and 9217 transitions. Word has length 433 [2024-11-05 20:29:25,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:25,561 INFO L471 AbstractCegarLoop]: Abstraction has 7491 states and 9217 transitions. [2024-11-05 20:29:25,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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-05 20:29:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 7491 states and 9217 transitions. [2024-11-05 20:29:25,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2024-11-05 20:29:25,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:25,572 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:29:25,577 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 (21)] Ended with exit code 0 [2024-11-05 20:29:25,776 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-05 20:29:25,776 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:25,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:25,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1919055892, now seen corresponding path program 2 times [2024-11-05 20:29:25,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:25,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1080379035] [2024-11-05 20:29:25,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:25,777 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-05 20:29:25,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:25,778 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-05 20:29:25,779 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-05 20:29:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:25,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:29:25,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:26,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2261 backedges. 1227 proven. 312 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-05 20:29:26,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2261 backedges. 1370 proven. 169 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-05 20:29:27,800 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:27,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1080379035] [2024-11-05 20:29:27,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1080379035] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:27,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:27,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-05 20:29:27,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317352122] [2024-11-05 20:29:27,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:27,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 20:29:27,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:27,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 20:29:27,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:29:27,805 INFO L87 Difference]: Start difference. First operand 7491 states and 9217 transitions. Second operand has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 7 states have internal predecessors, (251), 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-05 20:29:29,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:29,031 INFO L93 Difference]: Finished difference Result 15839 states and 19450 transitions. [2024-11-05 20:29:29,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 20:29:29,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 7 states have internal predecessors, (251), 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 447 [2024-11-05 20:29:29,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:29,037 INFO L225 Difference]: With dead ends: 15839 [2024-11-05 20:29:29,037 INFO L226 Difference]: Without dead ends: 5187 [2024-11-05 20:29:29,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 896 GetRequests, 888 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:29:29,043 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 160 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:29,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 783 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-05 20:29:29,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5187 states. [2024-11-05 20:29:29,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5187 to 5009. [2024-11-05 20:29:29,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5009 states, 5008 states have (on average 1.2106629392971247) internal successors, (6063), 5008 states have internal predecessors, (6063), 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-05 20:29:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5009 states to 5009 states and 6063 transitions. [2024-11-05 20:29:29,209 INFO L78 Accepts]: Start accepts. Automaton has 5009 states and 6063 transitions. Word has length 447 [2024-11-05 20:29:29,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:29,210 INFO L471 AbstractCegarLoop]: Abstraction has 5009 states and 6063 transitions. [2024-11-05 20:29:29,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 7 states have internal predecessors, (251), 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-05 20:29:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 5009 states and 6063 transitions. [2024-11-05 20:29:29,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2024-11-05 20:29:29,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:29,220 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 15, 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, 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] [2024-11-05 20:29:29,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 (22)] Ended with exit code 0 [2024-11-05 20:29:29,421 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-05 20:29:29,421 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:29,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:29,421 INFO L85 PathProgramCache]: Analyzing trace with hash -144977724, now seen corresponding path program 1 times [2024-11-05 20:29:29,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:29,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [245639356] [2024-11-05 20:29:29,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:29,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-05 20:29:29,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:29,423 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-05 20:29:29,424 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-05 20:29:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:29,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:29:29,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2780 backedges. 1342 proven. 13 refuted. 0 times theorem prover too weak. 1425 trivial. 0 not checked. [2024-11-05 20:29:29,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2780 backedges. 1342 proven. 13 refuted. 0 times theorem prover too weak. 1425 trivial. 0 not checked. [2024-11-05 20:29:29,717 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:29,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [245639356] [2024-11-05 20:29:29,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [245639356] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:29,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:29,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-05 20:29:29,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482394450] [2024-11-05 20:29:29,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:29,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:29:29,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:29,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:29:29,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:29,720 INFO L87 Difference]: Start difference. First operand 5009 states and 6063 transitions. Second operand has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 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-05 20:29:30,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:30,169 INFO L93 Difference]: Finished difference Result 7997 states and 9765 transitions. [2024-11-05 20:29:30,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 20:29:30,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 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 503 [2024-11-05 20:29:30,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:30,173 INFO L225 Difference]: With dead ends: 7997 [2024-11-05 20:29:30,173 INFO L226 Difference]: Without dead ends: 0 [2024-11-05 20:29:30,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1010 GetRequests, 1003 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-05 20:29:30,176 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 237 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:30,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 722 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-05 20:29:30,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-05 20:29:30,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-05 20:29:30,177 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-05 20:29:30,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-05 20:29:30,178 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 503 [2024-11-05 20:29:30,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:30,178 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-05 20:29:30,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 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-05 20:29:30,178 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-05 20:29:30,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-05 20:29:30,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 20:29:30,184 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 (23)] Forceful destruction successful, exit code 0 [2024-11-05 20:29:30,381 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-05 20:29:30,383 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:30,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-05 20:29:39,543 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 20:29:39,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 08:29:39 BoogieIcfgContainer [2024-11-05 20:29:39,576 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 20:29:39,577 INFO L158 Benchmark]: Toolchain (without parser) took 33310.86ms. Allocated memory was 203.4MB in the beginning and 823.1MB in the end (delta: 619.7MB). Free memory was 141.8MB in the beginning and 637.5MB in the end (delta: -495.7MB). Peak memory consumption was 542.7MB. Max. memory is 8.0GB. [2024-11-05 20:29:39,577 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 203.4MB. Free memory was 153.8MB in the beginning and 153.6MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 20:29:39,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.20ms. Allocated memory is still 203.4MB. Free memory was 141.5MB in the beginning and 123.1MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2024-11-05 20:29:39,578 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.35ms. Allocated memory is still 203.4MB. Free memory was 123.1MB in the beginning and 120.2MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-05 20:29:39,578 INFO L158 Benchmark]: Boogie Preprocessor took 77.49ms. Allocated memory was 203.4MB in the beginning and 269.5MB in the end (delta: 66.1MB). Free memory was 120.2MB in the beginning and 233.8MB in the end (delta: -113.5MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. [2024-11-05 20:29:39,578 INFO L158 Benchmark]: RCFGBuilder took 794.73ms. Allocated memory is still 269.5MB. Free memory was 233.8MB in the beginning and 193.4MB in the end (delta: 40.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2024-11-05 20:29:39,578 INFO L158 Benchmark]: TraceAbstraction took 32017.05ms. Allocated memory was 269.5MB in the beginning and 823.1MB in the end (delta: 553.6MB). Free memory was 192.4MB in the beginning and 637.5MB in the end (delta: -445.1MB). Peak memory consumption was 526.0MB. Max. memory is 8.0GB. [2024-11-05 20:29:39,580 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 203.4MB. Free memory was 153.8MB in the beginning and 153.6MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 359.20ms. Allocated memory is still 203.4MB. Free memory was 141.5MB in the beginning and 123.1MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.35ms. Allocated memory is still 203.4MB. Free memory was 123.1MB in the beginning and 120.2MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 77.49ms. Allocated memory was 203.4MB in the beginning and 269.5MB in the end (delta: 66.1MB). Free memory was 120.2MB in the beginning and 233.8MB in the end (delta: -113.5MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. * RCFGBuilder took 794.73ms. Allocated memory is still 269.5MB. Free memory was 233.8MB in the beginning and 193.4MB in the end (delta: 40.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. * TraceAbstraction took 32017.05ms. Allocated memory was 269.5MB in the beginning and 823.1MB in the end (delta: 553.6MB). Free memory was 192.4MB in the beginning and 637.5MB in the end (delta: -445.1MB). Peak memory consumption was 526.0MB. 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: 679]: 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, 138 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.8s, OverallIterations: 22, TraceHistogramMax: 17, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2492 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2492 mSDsluCounter, 9939 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5263 mSDsCounter, 531 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5345 IncrementalHoareTripleChecker+Invalid, 5876 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 531 mSolverCounterUnsat, 4676 mSDtfsCounter, 5345 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11406 GetRequests, 11345 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13336occurred in iteration=15, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 6038 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 5712 NumberOfCodeBlocks, 5712 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 11380 ConstructedInterpolants, 42 QuantifiedInterpolants, 22282 SizeOfPredicates, 9 NumberOfNonLiveVariables, 6565 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 44 InterpolantComputations, 34 PerfectInterpolantSequences, 38782/39672 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: 111]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((blastFlag != 4) && (8528 == s__state)) && (8448 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296))) || (((8656 == s__state) && (blastFlag != 4)) && (8448 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296)))) || ((8544 == s__state) && (blastFlag == 1))) || (((blastFlag == 2) && (8496 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296))) && (8560 == s__state))) || ((((((s__s3__tmp__next_state___0 != 8497) && (s__s3__tmp__next_state___0 != 8496)) && (blastFlag != 4)) && (8497 != s__state)) && (8496 != s__state)) && (8448 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296)))) || ((8656 == s__state) && (blastFlag == 1))) || ((((blastFlag == 2) && (8496 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296))) && (s__s3__tmp__next_state___0 == 8576)) && (8576 == s__state))) || ((((((s__s3__tmp__next_state___0 != 8464) && (blastFlag == 2)) && (8496 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296))) && (s__s3__tmp__next_state___0 != 8497)) && (s__s3__tmp__next_state___0 != 8496)) && (8466 == s__state))) || ((((blastFlag == 2) && (8496 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296))) && (s__s3__tmp__next_state___0 == 8576)) && (8608 == s__state))) || ((blastFlag == 1) && (8528 == s__state))) || (((blastFlag != 4) && (8672 == s__state)) && (8448 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296)))) || ((((((s__s3__tmp__next_state___0 != 8464) && (blastFlag == 2)) && (8496 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296))) && (s__s3__tmp__next_state___0 != 8497)) && (s__s3__tmp__next_state___0 != 8496)) && (8496 == s__state))) || (((blastFlag != 4) && (8544 == s__state)) && (8448 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296)))) || ((((s__s3__tmp__next_state___0 != 8464) && (blastFlag == 2)) && (8496 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296))) && (8656 == s__state))) || (((blastFlag == 2) && (8496 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296))) && (8528 == s__state))) || ((blastFlag == 1) && (3 == s__state))) || ((blastFlag == 1) && (8448 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296)))) || (((8560 == s__state) && (blastFlag != 4)) && (8448 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296)))) || ((((blastFlag != 3) && (8656 == s__state)) && (blastFlag != 4)) && (0 != s__hit))) || ((8608 == s__state) && (blastFlag == 1))) || ((8466 == s__state) && (blastFlag == 1))) || ((((8448 == s__state) && (8496 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296))) && (blastFlag != 4)) && (s__s3__tmp__next_state___0 == 3))) || ((blastFlag == 1) && (8640 == s__state))) || ((blastFlag == 0) && (8464 == s__state))) || ((8560 == s__state) && (blastFlag == 1))) || ((blastFlag == 1) && (8592 == s__state))) || ((((blastFlag == 2) && (8496 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296))) && (s__s3__tmp__next_state___0 == 8576)) && (8592 == s__state))) || ((((s__s3__tmp__next_state___0 != 8464) && (8496 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296))) && (blastFlag != 4)) && (8672 == s__state))) || ((((8448 == s__state) && (s__s3__tmp__next_state___0 == 8640)) && (blastFlag != 4)) && (0 != s__hit))) || (((blastFlag == 2) && (8512 == s__state)) && (8496 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296)))) || (((((((s__s3__tmp__next_state___0 != 8464) && (s__s3__tmp__next_state___0 != 8497)) && (s__s3__tmp__next_state___0 != 8496)) && (8497 != s__state)) && (blastFlag == 1)) && (8496 != s__state)) && (8464 != s__state))) || (((s__s3__tmp__next_state___0 != 8497) && (s__s3__tmp__next_state___0 != 8496)) && (3 == s__state))) || (((blastFlag != 4) && (8672 == s__state)) && (0 != s__hit))) || ((8672 == s__state) && (blastFlag == 1))) || ((blastFlag == 1) && ((((2 * ag_X) + (2 * ag_Y)) % 4294967296) == s__state))) || ((((((s__s3__tmp__next_state___0 != 8464) && (blastFlag == 2)) && (8496 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296))) && (s__s3__tmp__next_state___0 != 8497)) && (s__s3__tmp__next_state___0 != 8496)) && (8640 == s__state))) || (((blastFlag == 2) && (8512 == s__state)) && (8448 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296)))) || ((((s__s3__tmp__next_state___0 == 8640) && (blastFlag != 4)) && (8640 == s__state)) && (0 != s__hit))) || ((((8448 == s__state) && (blastFlag == 2)) && (8496 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296))) && (s__s3__tmp__next_state___0 == 8576))) || (((blastFlag == 2) && (8496 == (((2 * ag_X) + (2 * ag_Y)) % 4294967296))) && (8544 == s__state))) RESULT: Ultimate proved your program to be correct! [2024-11-05 20:29:39,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...