/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 18:24:22,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 18:24:22,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 18:24:22,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 18:24:22,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 18:24:22,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 18:24:22,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 18:24:22,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 18:24:22,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 18:24:22,885 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 18:24:22,885 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 18:24:22,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 18:24:22,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 18:24:22,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 18:24:22,886 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 18:24:22,887 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 18:24:22,887 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 18:24:22,887 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 18:24:22,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 18:24:22,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 18:24:22,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 18:24:22,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 18:24:22,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 18:24:22,888 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 18:24:22,889 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 18:24:22,889 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 18:24:22,889 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 18:24:22,889 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 18:24:22,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 18:24:22,890 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 18:24:22,890 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 18:24:22,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 18:24:22,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 18:24:22,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 18:24:22,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 18:24:22,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 18:24:22,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 18:24:22,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 18:24:22,891 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 18:24:22,891 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 18:24:22,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 18:24:22,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 18:24:22,892 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 18:24:22,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 18:24:22,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 18:24:22,893 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 18:24:22,893 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 18:24:23,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 18:24:23,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 18:24:23,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 18:24:23,097 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 18:24:23,100 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 18:24:23,101 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2023-12-16 18:24:24,186 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 18:24:24,384 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 18:24:24,384 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2023-12-16 18:24:24,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa06a263e/9a5f42a6b989451bb148e0d4fe0158ec/FLAG06cd35c03 [2023-12-16 18:24:24,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa06a263e/9a5f42a6b989451bb148e0d4fe0158ec [2023-12-16 18:24:24,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 18:24:24,408 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 18:24:24,409 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 18:24:24,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 18:24:24,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 18:24:24,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:24:24" (1/1) ... [2023-12-16 18:24:24,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f36c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:24:24, skipping insertion in model container [2023-12-16 18:24:24,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:24:24" (1/1) ... [2023-12-16 18:24:24,462 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 18:24:24,627 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7180,7193] [2023-12-16 18:24:24,638 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[9491,9504] [2023-12-16 18:24:24,645 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 18:24:24,665 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 18:24:24,694 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7180,7193] [2023-12-16 18:24:24,701 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[9491,9504] [2023-12-16 18:24:24,707 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 18:24:24,718 INFO L206 MainTranslator]: Completed translation [2023-12-16 18:24:24,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:24:24 WrapperNode [2023-12-16 18:24:24,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 18:24:24,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 18:24:24,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 18:24:24,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 18:24:24,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:24:24" (1/1) ... [2023-12-16 18:24:24,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:24:24" (1/1) ... [2023-12-16 18:24:24,763 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 492 [2023-12-16 18:24:24,763 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 18:24:24,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 18:24:24,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 18:24:24,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 18:24:24,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:24:24" (1/1) ... [2023-12-16 18:24:24,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:24:24" (1/1) ... [2023-12-16 18:24:24,797 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:24:24" (1/1) ... [2023-12-16 18:24:24,809 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 18:24:24,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:24:24" (1/1) ... [2023-12-16 18:24:24,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:24:24" (1/1) ... [2023-12-16 18:24:24,832 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:24:24" (1/1) ... [2023-12-16 18:24:24,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:24:24" (1/1) ... [2023-12-16 18:24:24,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:24:24" (1/1) ... [2023-12-16 18:24:24,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:24:24" (1/1) ... [2023-12-16 18:24:24,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 18:24:24,841 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 18:24:24,842 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 18:24:24,842 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 18:24:24,842 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:24:24" (1/1) ... [2023-12-16 18:24:24,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 18:24:24,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 18:24:24,896 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 18:24:24,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 18:24:24,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 18:24:24,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 18:24:24,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 18:24:24,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 18:24:25,007 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 18:24:25,009 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 18:24:25,395 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 18:24:25,432 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 18:24:25,432 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-16 18:24:25,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:24:25 BoogieIcfgContainer [2023-12-16 18:24:25,432 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 18:24:25,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 18:24:25,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 18:24:25,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 18:24:25,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:24:24" (1/3) ... [2023-12-16 18:24:25,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6996ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:24:25, skipping insertion in model container [2023-12-16 18:24:25,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:24:24" (2/3) ... [2023-12-16 18:24:25,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6996ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:24:25, skipping insertion in model container [2023-12-16 18:24:25,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:24:25" (3/3) ... [2023-12-16 18:24:25,439 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2023-12-16 18:24:25,451 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 18:24:25,451 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-16 18:24:25,481 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 18:24:25,485 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5a70d8bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 18:24:25,485 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-16 18:24:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 101 states have (on average 1.7722772277227723) internal successors, (179), 103 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:25,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-16 18:24:25,495 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:24:25,495 INFO L195 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, 1, 1, 1] [2023-12-16 18:24:25,495 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:24:25,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:24:25,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1236458848, now seen corresponding path program 1 times [2023-12-16 18:24:25,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:24:25,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123040446] [2023-12-16 18:24:25,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:24:25,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:25,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:24:25,535 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:24:25,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 18:24:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:24:25,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:24:25,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:24:25,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:25,993 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:24:25,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:24:25,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123040446] [2023-12-16 18:24:25,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123040446] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:24:25,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:24:25,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:24:25,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13882689] [2023-12-16 18:24:25,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:24:26,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:24:26,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:24:26,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:24:26,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:24:26,055 INFO L87 Difference]: Start difference. First operand has 104 states, 101 states have (on average 1.7722772277227723) internal successors, (179), 103 states have internal predecessors, (179), 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 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:26,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:24:26,230 INFO L93 Difference]: Finished difference Result 190 states and 317 transitions. [2023-12-16 18:24:26,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:24:26,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-12-16 18:24:26,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:24:26,238 INFO L225 Difference]: With dead ends: 190 [2023-12-16 18:24:26,238 INFO L226 Difference]: Without dead ends: 102 [2023-12-16 18:24:26,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 18:24:26,242 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 473 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 18:24:26,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 114 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 18:24:26,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-16 18:24:26,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-12-16 18:24:26,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.36) internal successors, (136), 101 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:26,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 136 transitions. [2023-12-16 18:24:26,268 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 136 transitions. Word has length 47 [2023-12-16 18:24:26,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:24:26,269 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 136 transitions. [2023-12-16 18:24:26,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 136 transitions. [2023-12-16 18:24:26,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-16 18:24:26,270 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:24:26,270 INFO L195 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, 1, 1, 1, 1] [2023-12-16 18:24:26,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 18:24:26,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:26,473 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:24:26,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:24:26,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1196804252, now seen corresponding path program 1 times [2023-12-16 18:24:26,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:24:26,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443356980] [2023-12-16 18:24:26,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:24:26,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:26,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:24:26,475 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:24:26,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 18:24:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:24:26,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:24:26,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:24:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:26,674 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:24:26,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:24:26,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443356980] [2023-12-16 18:24:26,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443356980] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:24:26,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:24:26,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:24:26,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192151786] [2023-12-16 18:24:26,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:24:26,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:24:26,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:24:26,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:24:26,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:24:26,677 INFO L87 Difference]: Start difference. First operand 102 states and 136 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:26,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:24:26,761 INFO L93 Difference]: Finished difference Result 178 states and 245 transitions. [2023-12-16 18:24:26,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:24:26,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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 48 [2023-12-16 18:24:26,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:24:26,763 INFO L225 Difference]: With dead ends: 178 [2023-12-16 18:24:26,763 INFO L226 Difference]: Without dead ends: 102 [2023-12-16 18:24:26,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 18:24:26,764 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 234 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 18:24:26,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 86 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 18:24:26,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-16 18:24:26,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-12-16 18:24:26,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.34) internal successors, (134), 101 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:26,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2023-12-16 18:24:26,775 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 134 transitions. Word has length 48 [2023-12-16 18:24:26,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:24:26,775 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 134 transitions. [2023-12-16 18:24:26,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 134 transitions. [2023-12-16 18:24:26,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-16 18:24:26,776 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:24:26,776 INFO L195 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, 1, 1, 1, 1, 1] [2023-12-16 18:24:26,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 18:24:26,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:26,979 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:24:26,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:24:26,979 INFO L85 PathProgramCache]: Analyzing trace with hash 781488172, now seen corresponding path program 1 times [2023-12-16 18:24:26,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:24:26,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848793896] [2023-12-16 18:24:26,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:24:26,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:26,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:24:26,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:24:26,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 18:24:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:24:27,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:24:27,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:24:27,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:27,270 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:24:27,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:24:27,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848793896] [2023-12-16 18:24:27,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1848793896] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:24:27,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:24:27,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:24:27,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665806200] [2023-12-16 18:24:27,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:24:27,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:24:27,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:24:27,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:24:27,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:24:27,278 INFO L87 Difference]: Start difference. First operand 102 states and 134 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:27,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:24:27,368 INFO L93 Difference]: Finished difference Result 174 states and 237 transitions. [2023-12-16 18:24:27,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:24:27,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 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 49 [2023-12-16 18:24:27,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:24:27,372 INFO L225 Difference]: With dead ends: 174 [2023-12-16 18:24:27,372 INFO L226 Difference]: Without dead ends: 102 [2023-12-16 18:24:27,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 18:24:27,374 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 222 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 18:24:27,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 94 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 18:24:27,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-16 18:24:27,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-12-16 18:24:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.32) internal successors, (132), 101 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) [2023-12-16 18:24:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 132 transitions. [2023-12-16 18:24:27,389 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 132 transitions. Word has length 49 [2023-12-16 18:24:27,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:24:27,389 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 132 transitions. [2023-12-16 18:24:27,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 132 transitions. [2023-12-16 18:24:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-16 18:24:27,390 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:24:27,390 INFO L195 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, 1, 1, 1, 1, 1, 1] [2023-12-16 18:24:27,396 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 (4)] Forceful destruction successful, exit code 0 [2023-12-16 18:24:27,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:27,594 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:24:27,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:24:27,594 INFO L85 PathProgramCache]: Analyzing trace with hash -366946160, now seen corresponding path program 1 times [2023-12-16 18:24:27,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:24:27,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230954094] [2023-12-16 18:24:27,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:24:27,595 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:27,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:24:27,596 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:24:27,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 18:24:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:24:27,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 18:24:27,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:24:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:27,917 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:24:27,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:24:27,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230954094] [2023-12-16 18:24:27,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230954094] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:24:27,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:24:27,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:24:27,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527674916] [2023-12-16 18:24:27,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:24:27,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:24:27,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:24:27,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:24:27,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:24:27,918 INFO L87 Difference]: Start difference. First operand 102 states and 132 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:28,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:24:28,216 INFO L93 Difference]: Finished difference Result 163 states and 220 transitions. [2023-12-16 18:24:28,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:24:28,217 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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 50 [2023-12-16 18:24:28,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:24:28,217 INFO L225 Difference]: With dead ends: 163 [2023-12-16 18:24:28,217 INFO L226 Difference]: Without dead ends: 102 [2023-12-16 18:24:28,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2023-12-16 18:24:28,218 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 522 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 18:24:28,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 178 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 18:24:28,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-16 18:24:28,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-12-16 18:24:28,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.31) internal successors, (131), 101 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 131 transitions. [2023-12-16 18:24:28,221 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 131 transitions. Word has length 50 [2023-12-16 18:24:28,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:24:28,221 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 131 transitions. [2023-12-16 18:24:28,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:28,222 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 131 transitions. [2023-12-16 18:24:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-16 18:24:28,222 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:24:28,222 INFO L195 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:24:28,232 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 (5)] Ended with exit code 0 [2023-12-16 18:24:28,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:28,428 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:24:28,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:24:28,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1105265084, now seen corresponding path program 1 times [2023-12-16 18:24:28,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:24:28,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104116460] [2023-12-16 18:24:28,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:24:28,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:28,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:24:28,436 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:24:28,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 18:24:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:24:28,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:24:28,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:24:28,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:28,882 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:24:28,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:24:28,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104116460] [2023-12-16 18:24:28,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104116460] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:24:28,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:24:28,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 18:24:28,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443887316] [2023-12-16 18:24:28,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:24:28,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 18:24:28,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:24:28,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 18:24:28,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-16 18:24:28,883 INFO L87 Difference]: Start difference. First operand 102 states and 131 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:24:29,359 INFO L93 Difference]: Finished difference Result 158 states and 211 transitions. [2023-12-16 18:24:29,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 18:24:29,360 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-12-16 18:24:29,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:24:29,361 INFO L225 Difference]: With dead ends: 158 [2023-12-16 18:24:29,361 INFO L226 Difference]: Without dead ends: 102 [2023-12-16 18:24:29,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-12-16 18:24:29,362 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 549 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 18:24:29,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 213 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 18:24:29,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-16 18:24:29,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-12-16 18:24:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.3) internal successors, (130), 101 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 130 transitions. [2023-12-16 18:24:29,364 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 130 transitions. Word has length 51 [2023-12-16 18:24:29,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:24:29,365 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 130 transitions. [2023-12-16 18:24:29,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:29,365 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 130 transitions. [2023-12-16 18:24:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-16 18:24:29,365 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:24:29,365 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:24:29,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 18:24:29,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:29,568 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:24:29,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:24:29,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1952796551, now seen corresponding path program 1 times [2023-12-16 18:24:29,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:24:29,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119784780] [2023-12-16 18:24:29,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:24:29,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:29,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:24:29,570 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:24:29,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 18:24:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:24:29,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:24:29,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:24:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:30,006 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:24:30,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:24:30,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119784780] [2023-12-16 18:24:30,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119784780] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:24:30,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:24:30,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 18:24:30,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182970434] [2023-12-16 18:24:30,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:24:30,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 18:24:30,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:24:30,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 18:24:30,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-16 18:24:30,008 INFO L87 Difference]: Start difference. First operand 102 states and 130 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:30,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:24:30,408 INFO L93 Difference]: Finished difference Result 153 states and 202 transitions. [2023-12-16 18:24:30,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 18:24:30,409 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 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 52 [2023-12-16 18:24:30,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:24:30,409 INFO L225 Difference]: With dead ends: 153 [2023-12-16 18:24:30,410 INFO L226 Difference]: Without dead ends: 102 [2023-12-16 18:24:30,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-12-16 18:24:30,410 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 441 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 18:24:30,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 223 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 18:24:30,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-16 18:24:30,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-12-16 18:24:30,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.29) internal successors, (129), 101 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) [2023-12-16 18:24:30,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 129 transitions. [2023-12-16 18:24:30,414 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 129 transitions. Word has length 52 [2023-12-16 18:24:30,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:24:30,415 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 129 transitions. [2023-12-16 18:24:30,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:30,415 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 129 transitions. [2023-12-16 18:24:30,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-16 18:24:30,415 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:24:30,415 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:24:30,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-16 18:24:30,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:30,620 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:24:30,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:24:30,620 INFO L85 PathProgramCache]: Analyzing trace with hash -484337147, now seen corresponding path program 1 times [2023-12-16 18:24:30,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:24:30,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134047709] [2023-12-16 18:24:30,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:24:30,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:30,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:24:30,622 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:24:30,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 18:24:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:24:30,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:24:30,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:24:30,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:30,908 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:24:30,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:24:30,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134047709] [2023-12-16 18:24:30,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134047709] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:24:30,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:24:30,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 18:24:30,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639934406] [2023-12-16 18:24:30,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:24:30,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:24:30,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:24:30,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:24:30,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:24:30,910 INFO L87 Difference]: Start difference. First operand 102 states and 129 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:30,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:24:30,991 INFO L93 Difference]: Finished difference Result 310 states and 426 transitions. [2023-12-16 18:24:30,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:24:30,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-12-16 18:24:30,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:24:30,992 INFO L225 Difference]: With dead ends: 310 [2023-12-16 18:24:30,992 INFO L226 Difference]: Without dead ends: 265 [2023-12-16 18:24:30,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:24:30,993 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 237 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 18:24:30,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 503 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 18:24:30,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-12-16 18:24:30,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 202. [2023-12-16 18:24:30,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 200 states have (on average 1.37) internal successors, (274), 201 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:30,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 274 transitions. [2023-12-16 18:24:30,998 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 274 transitions. Word has length 53 [2023-12-16 18:24:30,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:24:30,998 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 274 transitions. [2023-12-16 18:24:30,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:30,998 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 274 transitions. [2023-12-16 18:24:30,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-16 18:24:30,998 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:24:30,999 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:24:31,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 18:24:31,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:31,202 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:24:31,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:24:31,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1099999378, now seen corresponding path program 1 times [2023-12-16 18:24:31,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:24:31,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75808658] [2023-12-16 18:24:31,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:24:31,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:31,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:24:31,204 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:24:31,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 18:24:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:24:31,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:24:31,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:24:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:31,436 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:24:31,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:24:31,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75808658] [2023-12-16 18:24:31,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75808658] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:24:31,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:24:31,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 18:24:31,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494910648] [2023-12-16 18:24:31,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:24:31,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:24:31,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:24:31,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:24:31,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:24:31,438 INFO L87 Difference]: Start difference. First operand 202 states and 274 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:24:31,560 INFO L93 Difference]: Finished difference Result 395 states and 548 transitions. [2023-12-16 18:24:31,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:24:31,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-12-16 18:24:31,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:24:31,562 INFO L225 Difference]: With dead ends: 395 [2023-12-16 18:24:31,562 INFO L226 Difference]: Without dead ends: 351 [2023-12-16 18:24:31,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:24:31,564 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 219 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 18:24:31,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 613 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 18:24:31,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-12-16 18:24:31,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 293. [2023-12-16 18:24:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 291 states have (on average 1.3848797250859106) internal successors, (403), 292 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 403 transitions. [2023-12-16 18:24:31,573 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 403 transitions. Word has length 54 [2023-12-16 18:24:31,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:24:31,574 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 403 transitions. [2023-12-16 18:24:31,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 403 transitions. [2023-12-16 18:24:31,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-16 18:24:31,577 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:24:31,577 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:24:31,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 18:24:31,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:31,780 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:24:31,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:24:31,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1820719153, now seen corresponding path program 1 times [2023-12-16 18:24:31,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:24:31,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962530375] [2023-12-16 18:24:31,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:24:31,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:31,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:24:31,796 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:24:31,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 18:24:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:24:31,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:24:31,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:24:32,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:32,088 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:24:32,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:24:32,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962530375] [2023-12-16 18:24:32,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962530375] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:24:32,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:24:32,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 18:24:32,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929169549] [2023-12-16 18:24:32,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:24:32,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:24:32,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:24:32,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:24:32,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:24:32,091 INFO L87 Difference]: Start difference. First operand 293 states and 403 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:32,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:24:32,211 INFO L93 Difference]: Finished difference Result 444 states and 617 transitions. [2023-12-16 18:24:32,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:24:32,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-12-16 18:24:32,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:24:32,213 INFO L225 Difference]: With dead ends: 444 [2023-12-16 18:24:32,213 INFO L226 Difference]: Without dead ends: 400 [2023-12-16 18:24:32,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:24:32,215 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 223 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 18:24:32,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 546 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 18:24:32,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2023-12-16 18:24:32,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 333. [2023-12-16 18:24:32,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 331 states have (on average 1.392749244712991) internal successors, (461), 332 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 461 transitions. [2023-12-16 18:24:32,222 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 461 transitions. Word has length 54 [2023-12-16 18:24:32,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:24:32,222 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 461 transitions. [2023-12-16 18:24:32,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:32,222 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 461 transitions. [2023-12-16 18:24:32,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-16 18:24:32,225 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:24:32,225 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:24:32,238 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 [2023-12-16 18:24:32,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:32,428 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:24:32,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:24:32,429 INFO L85 PathProgramCache]: Analyzing trace with hash -636915536, now seen corresponding path program 1 times [2023-12-16 18:24:32,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:24:32,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282201415] [2023-12-16 18:24:32,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:24:32,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:32,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:24:32,430 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) [2023-12-16 18:24:32,434 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 [2023-12-16 18:24:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:24:32,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:24:32,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:24:32,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:32,666 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:24:32,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:24:32,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282201415] [2023-12-16 18:24:32,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282201415] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:24:32,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:24:32,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 18:24:32,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32458136] [2023-12-16 18:24:32,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:24:32,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:24:32,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:24:32,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:24:32,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:24:32,668 INFO L87 Difference]: Start difference. First operand 333 states and 461 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:32,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:24:32,752 INFO L93 Difference]: Finished difference Result 482 states and 671 transitions. [2023-12-16 18:24:32,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:24:32,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-12-16 18:24:32,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:24:32,754 INFO L225 Difference]: With dead ends: 482 [2023-12-16 18:24:32,754 INFO L226 Difference]: Without dead ends: 358 [2023-12-16 18:24:32,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:24:32,755 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 220 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 18:24:32,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 660 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 18:24:32,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2023-12-16 18:24:32,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 287. [2023-12-16 18:24:32,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 285 states have (on average 1.3754385964912281) internal successors, (392), 286 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:32,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 392 transitions. [2023-12-16 18:24:32,759 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 392 transitions. Word has length 54 [2023-12-16 18:24:32,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:24:32,759 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 392 transitions. [2023-12-16 18:24:32,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:32,759 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 392 transitions. [2023-12-16 18:24:32,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 18:24:32,759 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:24:32,760 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:24:32,771 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 (11)] Forceful destruction successful, exit code 0 [2023-12-16 18:24:32,963 WARN L477 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 [2023-12-16 18:24:32,963 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:24:32,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:24:32,965 INFO L85 PathProgramCache]: Analyzing trace with hash 568588166, now seen corresponding path program 1 times [2023-12-16 18:24:32,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:24:32,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380980031] [2023-12-16 18:24:32,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:24:32,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:32,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:24:32,966 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) [2023-12-16 18:24:32,998 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 [2023-12-16 18:24:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:24:33,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-16 18:24:33,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:24:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:34,114 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:24:34,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:24:34,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380980031] [2023-12-16 18:24:34,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380980031] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:24:34,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:24:34,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-16 18:24:34,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770909080] [2023-12-16 18:24:34,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:24:34,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 18:24:34,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:24:34,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 18:24:34,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2023-12-16 18:24:34,115 INFO L87 Difference]: Start difference. First operand 287 states and 392 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:35,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:24:35,439 INFO L93 Difference]: Finished difference Result 1238 states and 1742 transitions. [2023-12-16 18:24:35,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 18:24:35,443 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 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 55 [2023-12-16 18:24:35,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:24:35,448 INFO L225 Difference]: With dead ends: 1238 [2023-12-16 18:24:35,448 INFO L226 Difference]: Without dead ends: 1168 [2023-12-16 18:24:35,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2023-12-16 18:24:35,450 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 807 mSDsluCounter, 1443 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-16 18:24:35,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1622 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-16 18:24:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2023-12-16 18:24:35,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 277. [2023-12-16 18:24:35,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 275 states have (on average 1.3709090909090909) internal successors, (377), 276 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:35,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 377 transitions. [2023-12-16 18:24:35,458 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 377 transitions. Word has length 55 [2023-12-16 18:24:35,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:24:35,458 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 377 transitions. [2023-12-16 18:24:35,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:35,459 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 377 transitions. [2023-12-16 18:24:35,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 18:24:35,459 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:24:35,459 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:24:35,465 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 [2023-12-16 18:24:35,661 WARN L477 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 [2023-12-16 18:24:35,662 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:24:35,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:24:35,662 INFO L85 PathProgramCache]: Analyzing trace with hash -782372312, now seen corresponding path program 1 times [2023-12-16 18:24:35,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:24:35,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200739437] [2023-12-16 18:24:35,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:24:35,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:35,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:24:35,664 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) [2023-12-16 18:24:35,665 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 [2023-12-16 18:24:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:24:35,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 18:24:35,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:24:36,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:36,110 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:24:36,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:24:36,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200739437] [2023-12-16 18:24:36,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200739437] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:24:36,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:24:36,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 18:24:36,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841349268] [2023-12-16 18:24:36,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:24:36,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 18:24:36,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:24:36,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 18:24:36,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-16 18:24:36,112 INFO L87 Difference]: Start difference. First operand 277 states and 377 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:36,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:24:36,622 INFO L93 Difference]: Finished difference Result 551 states and 765 transitions. [2023-12-16 18:24:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 18:24:36,622 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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 55 [2023-12-16 18:24:36,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:24:36,624 INFO L225 Difference]: With dead ends: 551 [2023-12-16 18:24:36,625 INFO L226 Difference]: Without dead ends: 491 [2023-12-16 18:24:36,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2023-12-16 18:24:36,625 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 594 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 18:24:36,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 661 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 18:24:36,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2023-12-16 18:24:36,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 266. [2023-12-16 18:24:36,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 264 states have (on average 1.3674242424242424) internal successors, (361), 265 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 361 transitions. [2023-12-16 18:24:36,630 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 361 transitions. Word has length 55 [2023-12-16 18:24:36,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:24:36,630 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 361 transitions. [2023-12-16 18:24:36,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:36,630 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 361 transitions. [2023-12-16 18:24:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 18:24:36,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:24:36,630 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:24:36,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-16 18:24:36,832 WARN L477 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 [2023-12-16 18:24:36,833 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:24:36,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:24:36,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1555801447, now seen corresponding path program 1 times [2023-12-16 18:24:36,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:24:36,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834574748] [2023-12-16 18:24:36,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:24:36,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:36,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:24:36,834 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) [2023-12-16 18:24:36,862 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 [2023-12-16 18:24:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:24:36,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-16 18:24:36,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:24:38,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:38,747 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:24:38,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:24:38,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834574748] [2023-12-16 18:24:38,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834574748] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:24:38,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:24:38,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-12-16 18:24:38,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999070799] [2023-12-16 18:24:38,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:24:38,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 18:24:38,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:24:38,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 18:24:38,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2023-12-16 18:24:38,748 INFO L87 Difference]: Start difference. First operand 266 states and 361 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:46,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:24:46,907 INFO L93 Difference]: Finished difference Result 1555 states and 2206 transitions. [2023-12-16 18:24:46,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-16 18:24:46,908 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 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 55 [2023-12-16 18:24:46,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:24:46,911 INFO L225 Difference]: With dead ends: 1555 [2023-12-16 18:24:46,911 INFO L226 Difference]: Without dead ends: 1340 [2023-12-16 18:24:46,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2023-12-16 18:24:46,912 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 775 mSDsluCounter, 3585 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 3903 SdHoareTripleChecker+Invalid, 1974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-12-16 18:24:46,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 3903 Invalid, 1974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2023-12-16 18:24:46,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2023-12-16 18:24:46,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 275. [2023-12-16 18:24:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 273 states have (on average 1.358974358974359) internal successors, (371), 274 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 371 transitions. [2023-12-16 18:24:46,918 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 371 transitions. Word has length 55 [2023-12-16 18:24:46,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:24:46,918 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 371 transitions. [2023-12-16 18:24:46,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:46,918 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 371 transitions. [2023-12-16 18:24:46,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-16 18:24:46,919 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:24:46,919 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:24:46,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-12-16 18:24:47,119 WARN L477 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 [2023-12-16 18:24:47,119 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:24:47,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:24:47,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1588815950, now seen corresponding path program 1 times [2023-12-16 18:24:47,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:24:47,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500682727] [2023-12-16 18:24:47,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:24:47,120 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:47,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:24:47,122 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) [2023-12-16 18:24:47,125 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 [2023-12-16 18:24:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:24:47,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 18:24:47,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:24:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:47,600 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:24:47,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:24:47,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500682727] [2023-12-16 18:24:47,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500682727] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:24:47,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:24:47,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 18:24:47,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997122608] [2023-12-16 18:24:47,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:24:47,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 18:24:47,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:24:47,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 18:24:47,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-16 18:24:47,601 INFO L87 Difference]: Start difference. First operand 275 states and 371 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:48,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:24:48,072 INFO L93 Difference]: Finished difference Result 488 states and 678 transitions. [2023-12-16 18:24:48,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 18:24:48,072 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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 56 [2023-12-16 18:24:48,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:24:48,074 INFO L225 Difference]: With dead ends: 488 [2023-12-16 18:24:48,074 INFO L226 Difference]: Without dead ends: 481 [2023-12-16 18:24:48,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2023-12-16 18:24:48,074 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 547 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 18:24:48,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 615 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 18:24:48,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2023-12-16 18:24:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 267. [2023-12-16 18:24:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.3646616541353382) internal successors, (363), 266 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 363 transitions. [2023-12-16 18:24:48,089 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 363 transitions. Word has length 56 [2023-12-16 18:24:48,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:24:48,089 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 363 transitions. [2023-12-16 18:24:48,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:48,090 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 363 transitions. [2023-12-16 18:24:48,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-16 18:24:48,091 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:24:48,091 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:24:48,096 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 [2023-12-16 18:24:48,292 WARN L477 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 [2023-12-16 18:24:48,292 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:24:48,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:24:48,292 INFO L85 PathProgramCache]: Analyzing trace with hash -241009193, now seen corresponding path program 1 times [2023-12-16 18:24:48,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:24:48,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107376998] [2023-12-16 18:24:48,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:24:48,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:48,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:24:48,293 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) [2023-12-16 18:24:48,300 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 [2023-12-16 18:24:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:24:48,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 18:24:48,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:24:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:48,380 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:24:48,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:24:48,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107376998] [2023-12-16 18:24:48,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107376998] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:24:48,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:24:48,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 18:24:48,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842922079] [2023-12-16 18:24:48,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:24:48,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 18:24:48,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:24:48,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 18:24:48,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:24:48,381 INFO L87 Difference]: Start difference. First operand 267 states and 363 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:48,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:24:48,391 INFO L93 Difference]: Finished difference Result 631 states and 891 transitions. [2023-12-16 18:24:48,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 18:24:48,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2023-12-16 18:24:48,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:24:48,392 INFO L225 Difference]: With dead ends: 631 [2023-12-16 18:24:48,392 INFO L226 Difference]: Without dead ends: 429 [2023-12-16 18:24:48,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:24:48,393 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 71 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:24:48,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 241 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:24:48,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2023-12-16 18:24:48,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427. [2023-12-16 18:24:48,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 1.3873239436619718) internal successors, (591), 426 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:48,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 591 transitions. [2023-12-16 18:24:48,397 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 591 transitions. Word has length 76 [2023-12-16 18:24:48,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:24:48,397 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 591 transitions. [2023-12-16 18:24:48,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:48,397 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 591 transitions. [2023-12-16 18:24:48,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-16 18:24:48,397 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:24:48,398 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:24:48,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-16 18:24:48,600 WARN L477 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 [2023-12-16 18:24:48,601 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:24:48,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:24:48,601 INFO L85 PathProgramCache]: Analyzing trace with hash -141226665, now seen corresponding path program 1 times [2023-12-16 18:24:48,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:24:48,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997930972] [2023-12-16 18:24:48,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:24:48,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:48,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:24:48,602 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) [2023-12-16 18:24:48,604 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 [2023-12-16 18:24:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:24:48,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 18:24:48,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:24:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:48,686 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:24:48,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:24:48,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997930972] [2023-12-16 18:24:48,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997930972] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:24:48,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:24:48,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 18:24:48,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563106150] [2023-12-16 18:24:48,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:24:48,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 18:24:48,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:24:48,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 18:24:48,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:24:48,705 INFO L87 Difference]: Start difference. First operand 427 states and 591 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:24:48,715 INFO L93 Difference]: Finished difference Result 1071 states and 1515 transitions. [2023-12-16 18:24:48,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 18:24:48,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 77 [2023-12-16 18:24:48,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:24:48,717 INFO L225 Difference]: With dead ends: 1071 [2023-12-16 18:24:48,717 INFO L226 Difference]: Without dead ends: 709 [2023-12-16 18:24:48,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:24:48,719 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 64 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:24:48,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 239 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:24:48,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2023-12-16 18:24:48,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 707. [2023-12-16 18:24:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 706 states have (on average 1.3909348441926346) internal successors, (982), 706 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:48,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 982 transitions. [2023-12-16 18:24:48,732 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 982 transitions. Word has length 77 [2023-12-16 18:24:48,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:24:48,733 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 982 transitions. [2023-12-16 18:24:48,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:48,733 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 982 transitions. [2023-12-16 18:24:48,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-16 18:24:48,733 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:24:48,733 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:24:48,748 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 (17)] Forceful destruction successful, exit code 0 [2023-12-16 18:24:48,948 WARN L477 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 [2023-12-16 18:24:48,948 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:24:48,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:24:48,949 INFO L85 PathProgramCache]: Analyzing trace with hash -177282928, now seen corresponding path program 1 times [2023-12-16 18:24:48,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:24:48,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219943907] [2023-12-16 18:24:48,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:24:48,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:48,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:24:48,950 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) [2023-12-16 18:24:48,968 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 [2023-12-16 18:24:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:24:49,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 18:24:49,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:24:49,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:49,039 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:24:49,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:24:49,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219943907] [2023-12-16 18:24:49,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219943907] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:24:49,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:24:49,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 18:24:49,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361144918] [2023-12-16 18:24:49,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:24:49,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 18:24:49,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:24:49,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 18:24:49,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:24:49,041 INFO L87 Difference]: Start difference. First operand 707 states and 982 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:49,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:24:49,056 INFO L93 Difference]: Finished difference Result 1831 states and 2568 transitions. [2023-12-16 18:24:49,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 18:24:49,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2023-12-16 18:24:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:24:49,059 INFO L225 Difference]: With dead ends: 1831 [2023-12-16 18:24:49,059 INFO L226 Difference]: Without dead ends: 1189 [2023-12-16 18:24:49,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 18:24:49,063 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 57 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:24:49,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 236 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:24:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2023-12-16 18:24:49,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1187. [2023-12-16 18:24:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1186 states have (on average 1.3777403035413154) internal successors, (1634), 1186 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:49,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1634 transitions. [2023-12-16 18:24:49,082 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1634 transitions. Word has length 78 [2023-12-16 18:24:49,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:24:49,082 INFO L495 AbstractCegarLoop]: Abstraction has 1187 states and 1634 transitions. [2023-12-16 18:24:49,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:49,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1634 transitions. [2023-12-16 18:24:49,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-16 18:24:49,083 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:24:49,083 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:24:49,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-16 18:24:49,285 WARN L477 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 [2023-12-16 18:24:49,286 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:24:49,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:24:49,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1625714852, now seen corresponding path program 1 times [2023-12-16 18:24:49,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:24:49,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583716542] [2023-12-16 18:24:49,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:24:49,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:49,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:24:49,288 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) [2023-12-16 18:24:49,316 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 [2023-12-16 18:24:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:24:49,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 18:24:49,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:24:49,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:49,429 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:24:49,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:24:49,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583716542] [2023-12-16 18:24:49,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583716542] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:24:49,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:24:49,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:24:49,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407214785] [2023-12-16 18:24:49,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:24:49,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 18:24:49,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:24:49,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 18:24:49,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 18:24:49,430 INFO L87 Difference]: Start difference. First operand 1187 states and 1634 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:24:49,453 INFO L93 Difference]: Finished difference Result 2738 states and 3787 transitions. [2023-12-16 18:24:49,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 18:24:49,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2023-12-16 18:24:49,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:24:49,457 INFO L225 Difference]: With dead ends: 2738 [2023-12-16 18:24:49,457 INFO L226 Difference]: Without dead ends: 1616 [2023-12-16 18:24:49,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 18:24:49,458 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 37 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:24:49,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 316 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:24:49,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2023-12-16 18:24:49,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1614. [2023-12-16 18:24:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1613 states have (on average 1.3620582765034097) internal successors, (2197), 1613 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:49,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2197 transitions. [2023-12-16 18:24:49,475 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2197 transitions. Word has length 79 [2023-12-16 18:24:49,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:24:49,475 INFO L495 AbstractCegarLoop]: Abstraction has 1614 states and 2197 transitions. [2023-12-16 18:24:49,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:49,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2197 transitions. [2023-12-16 18:24:49,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-16 18:24:49,475 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:24:49,476 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:24:49,493 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 [2023-12-16 18:24:49,678 WARN L477 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 [2023-12-16 18:24:49,678 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:24:49,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:24:49,679 INFO L85 PathProgramCache]: Analyzing trace with hash -660634110, now seen corresponding path program 1 times [2023-12-16 18:24:49,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:24:49,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000842931] [2023-12-16 18:24:49,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:24:49,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:49,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:24:49,680 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) [2023-12-16 18:24:49,682 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 [2023-12-16 18:24:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:24:49,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 18:24:49,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:24:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:49,783 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:24:49,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:24:49,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000842931] [2023-12-16 18:24:49,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000842931] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:24:49,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:24:49,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 18:24:49,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799397154] [2023-12-16 18:24:49,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:24:49,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:24:49,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:24:49,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:24:49,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:24:49,785 INFO L87 Difference]: Start difference. First operand 1614 states and 2197 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:49,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:24:49,834 INFO L93 Difference]: Finished difference Result 3083 states and 4157 transitions. [2023-12-16 18:24:49,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 18:24:49,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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 80 [2023-12-16 18:24:49,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:24:49,841 INFO L225 Difference]: With dead ends: 3083 [2023-12-16 18:24:49,841 INFO L226 Difference]: Without dead ends: 3081 [2023-12-16 18:24:49,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:24:49,842 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 193 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:24:49,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 472 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:24:49,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2023-12-16 18:24:49,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 1746. [2023-12-16 18:24:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1746 states, 1745 states have (on average 1.332378223495702) internal successors, (2325), 1745 states have internal predecessors, (2325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:49,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 2325 transitions. [2023-12-16 18:24:49,865 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 2325 transitions. Word has length 80 [2023-12-16 18:24:49,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:24:49,865 INFO L495 AbstractCegarLoop]: Abstraction has 1746 states and 2325 transitions. [2023-12-16 18:24:49,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:49,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 2325 transitions. [2023-12-16 18:24:49,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-16 18:24:49,866 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:24:49,866 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:24:49,883 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 (20)] Forceful destruction successful, exit code 0 [2023-12-16 18:24:50,069 WARN L477 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 [2023-12-16 18:24:50,069 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:24:50,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:24:50,069 INFO L85 PathProgramCache]: Analyzing trace with hash -913097993, now seen corresponding path program 1 times [2023-12-16 18:24:50,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:24:50,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663928985] [2023-12-16 18:24:50,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:24:50,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:50,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:24:50,071 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) [2023-12-16 18:24:50,072 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 [2023-12-16 18:24:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:24:50,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 18:24:50,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:24:50,958 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:50,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 18:24:51,260 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:51,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:24:51,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663928985] [2023-12-16 18:24:51,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663928985] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 18:24:51,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 18:24:51,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-16 18:24:51,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666308517] [2023-12-16 18:24:51,261 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 18:24:51,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-16 18:24:51,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:24:51,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-16 18:24:51,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2023-12-16 18:24:51,263 INFO L87 Difference]: Start difference. First operand 1746 states and 2325 transitions. Second operand has 26 states, 26 states have (on average 7.076923076923077) internal successors, (184), 25 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:58,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:24:58,751 INFO L93 Difference]: Finished difference Result 9696 states and 12654 transitions. [2023-12-16 18:24:58,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-12-16 18:24:58,751 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.076923076923077) internal successors, (184), 25 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2023-12-16 18:24:58,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:24:58,767 INFO L225 Difference]: With dead ends: 9696 [2023-12-16 18:24:58,767 INFO L226 Difference]: Without dead ends: 8454 [2023-12-16 18:24:58,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2962 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2214, Invalid=8498, Unknown=0, NotChecked=0, Total=10712 [2023-12-16 18:24:58,771 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 4015 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4015 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-16 18:24:58,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4015 Valid, 1260 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-16 18:24:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8454 states. [2023-12-16 18:24:58,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8454 to 1746. [2023-12-16 18:24:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1746 states, 1745 states have (on average 1.326647564469914) internal successors, (2315), 1745 states have internal predecessors, (2315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:58,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 2315 transitions. [2023-12-16 18:24:58,813 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 2315 transitions. Word has length 101 [2023-12-16 18:24:58,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:24:58,813 INFO L495 AbstractCegarLoop]: Abstraction has 1746 states and 2315 transitions. [2023-12-16 18:24:58,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.076923076923077) internal successors, (184), 25 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:24:58,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 2315 transitions. [2023-12-16 18:24:58,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-16 18:24:58,814 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:24:58,814 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:24:58,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-16 18:24:59,017 WARN L477 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 [2023-12-16 18:24:59,017 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:24:59,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:24:59,018 INFO L85 PathProgramCache]: Analyzing trace with hash 985828207, now seen corresponding path program 1 times [2023-12-16 18:24:59,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:24:59,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620211642] [2023-12-16 18:24:59,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:24:59,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:24:59,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:24:59,019 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) [2023-12-16 18:24:59,055 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 [2023-12-16 18:24:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:24:59,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:24:59,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:24:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:59,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 18:24:59,768 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:24:59,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:24:59,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620211642] [2023-12-16 18:24:59,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620211642] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 18:24:59,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 18:24:59,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-16 18:24:59,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482943228] [2023-12-16 18:24:59,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 18:24:59,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 18:24:59,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:24:59,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 18:24:59,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-16 18:24:59,769 INFO L87 Difference]: Start difference. First operand 1746 states and 2315 transitions. Second operand has 16 states, 16 states have (on average 11.875) internal successors, (190), 15 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:25:02,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:25:02,132 INFO L93 Difference]: Finished difference Result 8123 states and 10745 transitions. [2023-12-16 18:25:02,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-12-16 18:25:02,133 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.875) internal successors, (190), 15 states have internal predecessors, (190), 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 102 [2023-12-16 18:25:02,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:25:02,145 INFO L225 Difference]: With dead ends: 8123 [2023-12-16 18:25:02,145 INFO L226 Difference]: Without dead ends: 6445 [2023-12-16 18:25:02,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1207, Invalid=3485, Unknown=0, NotChecked=0, Total=4692 [2023-12-16 18:25:02,149 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 1970 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1970 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 18:25:02,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1970 Valid, 711 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 18:25:02,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6445 states. [2023-12-16 18:25:02,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6445 to 1816. [2023-12-16 18:25:02,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1816 states, 1815 states have (on average 1.3151515151515152) internal successors, (2387), 1815 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:25:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2387 transitions. [2023-12-16 18:25:02,184 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2387 transitions. Word has length 102 [2023-12-16 18:25:02,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:25:02,184 INFO L495 AbstractCegarLoop]: Abstraction has 1816 states and 2387 transitions. [2023-12-16 18:25:02,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.875) internal successors, (190), 15 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:25:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2387 transitions. [2023-12-16 18:25:02,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-16 18:25:02,185 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:25:02,185 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:25:02,190 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 [2023-12-16 18:25:02,388 WARN L477 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 [2023-12-16 18:25:02,388 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:25:02,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:25:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash 969778631, now seen corresponding path program 1 times [2023-12-16 18:25:02,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:25:02,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443891821] [2023-12-16 18:25:02,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:25:02,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:25:02,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:25:02,390 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) [2023-12-16 18:25:02,414 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 [2023-12-16 18:25:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:25:02,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 18:25:02,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:25:03,240 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:25:03,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 18:25:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:25:03,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:25:03,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443891821] [2023-12-16 18:25:03,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443891821] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 18:25:03,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 18:25:03,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-16 18:25:03,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425797501] [2023-12-16 18:25:03,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 18:25:03,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-16 18:25:03,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:25:03,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-16 18:25:03,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2023-12-16 18:25:03,501 INFO L87 Difference]: Start difference. First operand 1816 states and 2387 transitions. Second operand has 26 states, 26 states have (on average 7.576923076923077) internal successors, (197), 25 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:25:14,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:25:14,114 INFO L93 Difference]: Finished difference Result 12791 states and 16554 transitions. [2023-12-16 18:25:14,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2023-12-16 18:25:14,115 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.576923076923077) internal successors, (197), 25 states have internal predecessors, (197), 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 102 [2023-12-16 18:25:14,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:25:14,129 INFO L225 Difference]: With dead ends: 12791 [2023-12-16 18:25:14,129 INFO L226 Difference]: Without dead ends: 11043 [2023-12-16 18:25:14,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5729 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=3844, Invalid=14788, Unknown=0, NotChecked=0, Total=18632 [2023-12-16 18:25:14,136 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 3179 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3179 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-16 18:25:14,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3179 Valid, 1435 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-16 18:25:14,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11043 states. [2023-12-16 18:25:14,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11043 to 1914. [2023-12-16 18:25:14,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 1.306325143753267) internal successors, (2499), 1913 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:25:14,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2499 transitions. [2023-12-16 18:25:14,215 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2499 transitions. Word has length 102 [2023-12-16 18:25:14,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:25:14,215 INFO L495 AbstractCegarLoop]: Abstraction has 1914 states and 2499 transitions. [2023-12-16 18:25:14,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.576923076923077) internal successors, (197), 25 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:25:14,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2499 transitions. [2023-12-16 18:25:14,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-16 18:25:14,216 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:25:14,216 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:25:14,230 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 [2023-12-16 18:25:14,419 WARN L477 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 [2023-12-16 18:25:14,419 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:25:14,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:25:14,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1753764413, now seen corresponding path program 1 times [2023-12-16 18:25:14,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:25:14,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763194869] [2023-12-16 18:25:14,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:25:14,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:25:14,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:25:14,421 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:25:14,440 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 (24)] Waiting until timeout for monitored process [2023-12-16 18:25:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:25:14,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 18:25:14,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:25:15,145 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:25:15,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 18:25:15,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:25:15,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:25:15,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763194869] [2023-12-16 18:25:15,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763194869] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 18:25:15,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 18:25:15,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2023-12-16 18:25:15,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217988422] [2023-12-16 18:25:15,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 18:25:15,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-16 18:25:15,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:25:15,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-16 18:25:15,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2023-12-16 18:25:15,442 INFO L87 Difference]: Start difference. First operand 1914 states and 2499 transitions. Second operand has 23 states, 23 states have (on average 8.304347826086957) internal successors, (191), 23 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:25:20,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:25:20,245 INFO L93 Difference]: Finished difference Result 23403 states and 30304 transitions. [2023-12-16 18:25:20,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-12-16 18:25:20,245 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.304347826086957) internal successors, (191), 23 states have internal predecessors, (191), 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 [2023-12-16 18:25:20,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:25:20,271 INFO L225 Difference]: With dead ends: 23403 [2023-12-16 18:25:20,271 INFO L226 Difference]: Without dead ends: 21557 [2023-12-16 18:25:20,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1454 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1545, Invalid=4935, Unknown=0, NotChecked=0, Total=6480 [2023-12-16 18:25:20,278 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 3176 mSDsluCounter, 3299 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3176 SdHoareTripleChecker+Valid, 3537 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-16 18:25:20,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3176 Valid, 3537 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-16 18:25:20,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21557 states. [2023-12-16 18:25:20,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21557 to 7567. [2023-12-16 18:25:20,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7567 states, 7566 states have (on average 1.3084853291038858) internal successors, (9900), 7566 states have internal predecessors, (9900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:25:20,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7567 states to 7567 states and 9900 transitions. [2023-12-16 18:25:20,407 INFO L78 Accepts]: Start accepts. Automaton has 7567 states and 9900 transitions. Word has length 103 [2023-12-16 18:25:20,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:25:20,407 INFO L495 AbstractCegarLoop]: Abstraction has 7567 states and 9900 transitions. [2023-12-16 18:25:20,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.304347826086957) internal successors, (191), 23 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:25:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 7567 states and 9900 transitions. [2023-12-16 18:25:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-16 18:25:20,409 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:25:20,410 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:25:20,414 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 (24)] Forceful destruction successful, exit code 0 [2023-12-16 18:25:20,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:25:20,612 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:25:20,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:25:20,613 INFO L85 PathProgramCache]: Analyzing trace with hash -218879738, now seen corresponding path program 1 times [2023-12-16 18:25:20,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:25:20,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860642958] [2023-12-16 18:25:20,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:25:20,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:25:20,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:25:20,614 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:25:20,616 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 (25)] Waiting until timeout for monitored process [2023-12-16 18:25:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:25:20,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-16 18:25:20,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:25:22,605 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:25:22,605 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 18:25:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:25:23,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:25:23,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860642958] [2023-12-16 18:25:23,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860642958] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 18:25:23,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 18:25:23,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 42 [2023-12-16 18:25:23,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770124161] [2023-12-16 18:25:23,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 18:25:23,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-16 18:25:23,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:25:23,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-16 18:25:23,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1521, Unknown=0, NotChecked=0, Total=1722 [2023-12-16 18:25:23,705 INFO L87 Difference]: Start difference. First operand 7567 states and 9900 transitions. Second operand has 42 states, 42 states have (on average 4.690476190476191) internal successors, (197), 42 states have internal predecessors, (197), 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) Received shutdown request... [2023-12-16 18:25:35,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-12-16 18:25:35,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2378 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=1427, Invalid=8673, Unknown=0, NotChecked=0, Total=10100 [2023-12-16 18:25:35,613 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 1861 mSDsluCounter, 2019 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1861 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-16 18:25:35,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1861 Valid, 2127 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1711 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-16 18:25:35,614 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-16 18:25:35,617 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 (25)] Ended with exit code 0 [2023-12-16 18:25:35,654 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 18:25:35,654 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 18:25:35,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:25:35,815 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (7567states) and FLOYD_HOARE automaton (currently 61 states, 42 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-9-4-1 term,while SimplifyDDA2 was simplifying 4 xjuncts wrt. a ∧-8-2-1 context. [2023-12-16 18:25:35,816 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-16 18:25:35,818 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:25:35,820 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 18:25:35,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 06:25:35 BoogieIcfgContainer [2023-12-16 18:25:35,821 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 18:25:35,821 INFO L158 Benchmark]: Toolchain (without parser) took 71413.55ms. Allocated memory was 243.3MB in the beginning and 425.7MB in the end (delta: 182.5MB). Free memory was 191.5MB in the beginning and 201.6MB in the end (delta: -10.2MB). Peak memory consumption was 173.8MB. Max. memory is 8.0GB. [2023-12-16 18:25:35,822 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 202.4MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 18:25:35,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.26ms. Allocated memory is still 243.3MB. Free memory was 191.5MB in the beginning and 171.6MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-16 18:25:35,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.56ms. Allocated memory is still 243.3MB. Free memory was 171.6MB in the beginning and 168.8MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 18:25:35,822 INFO L158 Benchmark]: Boogie Preprocessor took 76.97ms. Allocated memory is still 243.3MB. Free memory was 168.8MB in the beginning and 165.4MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 18:25:35,822 INFO L158 Benchmark]: RCFGBuilder took 591.08ms. Allocated memory is still 243.3MB. Free memory was 165.4MB in the beginning and 192.0MB in the end (delta: -26.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-16 18:25:35,823 INFO L158 Benchmark]: TraceAbstraction took 70387.00ms. Allocated memory was 243.3MB in the beginning and 425.7MB in the end (delta: 182.5MB). Free memory was 191.5MB in the beginning and 201.6MB in the end (delta: -10.2MB). Peak memory consumption was 172.8MB. Max. memory is 8.0GB. [2023-12-16 18:25:35,823 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.13ms. Allocated memory is still 202.4MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 309.26ms. Allocated memory is still 243.3MB. Free memory was 191.5MB in the beginning and 171.6MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.56ms. Allocated memory is still 243.3MB. Free memory was 171.6MB in the beginning and 168.8MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 76.97ms. Allocated memory is still 243.3MB. Free memory was 168.8MB in the beginning and 165.4MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 591.08ms. Allocated memory is still 243.3MB. Free memory was 165.4MB in the beginning and 192.0MB in the end (delta: -26.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 70387.00ms. Allocated memory was 243.3MB in the beginning and 425.7MB in the end (delta: 182.5MB). Free memory was 191.5MB in the beginning and 201.6MB in the end (delta: -10.2MB). Peak memory consumption was 172.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 383]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 383). Cancelled while NwaCegarLoop was constructing difference of abstraction (7567states) and FLOYD_HOARE automaton (currently 61 states, 42 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-9-4-1 term,while SimplifyDDA2 was simplifying 4 xjuncts wrt. a ∧-8-2-1 context. - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 589). Cancelled while NwaCegarLoop was constructing difference of abstraction (7567states) and FLOYD_HOARE automaton (currently 61 states, 42 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-9-4-1 term,while SimplifyDDA2 was simplifying 4 xjuncts wrt. a ∧-8-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 104 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 70.3s, OverallIterations: 24, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 49.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20686 SdHoareTripleChecker+Valid, 18.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20686 mSDsluCounter, 20605 SdHoareTripleChecker+Invalid, 17.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16725 mSDsCounter, 188 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10943 IncrementalHoareTripleChecker+Invalid, 11131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 188 mSolverCounterUnsat, 3880 mSDtfsCounter, 10943 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2540 GetRequests, 1897 SyntacticMatches, 0 SemanticMatches, 642 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14058 ImplicationChecksByTransitivity, 35.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7567occurred in iteration=23, InterpolantAutomatonStates: 459, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 38453 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 1634 NumberOfCodeBlocks, 1634 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2116 ConstructedInterpolants, 672 QuantifiedInterpolants, 25868 SizeOfPredicates, 117 NumberOfNonLiveVariables, 4214 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 29 InterpolantComputations, 19 PerfectInterpolantSequences, 78/128 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown