/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-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 09:22:35,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 09:22:35,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 09:22:35,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 09:22:35,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 09:22:35,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 09:22:35,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 09:22:35,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 09:22:35,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 09:22:35,216 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 09:22:35,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 09:22:35,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 09:22:35,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 09:22:35,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 09:22:35,217 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 09:22:35,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 09:22:35,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 09:22:35,218 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 09:22:35,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 09:22:35,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 09:22:35,218 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 09:22:35,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 09:22:35,219 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 09:22:35,219 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 09:22:35,219 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 09:22:35,219 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 09:22:35,220 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 09:22:35,220 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 09:22:35,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 09:22:35,220 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 09:22:35,221 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 09:22:35,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 09:22:35,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 09:22:35,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 09:22:35,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 09:22:35,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 09:22:35,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 09:22:35,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 09:22:35,222 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 09:22:35,222 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 09:22:35,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 09:22:35,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 09:22:35,222 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 09:22:35,223 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 09:22:35,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 09:22:35,223 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 09:22:35,223 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 09:22:35,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 09:22:35,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 09:22:35,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 09:22:35,428 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 09:22:35,429 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 09:22:35,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2023-12-25 09:22:36,550 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 09:22:36,742 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 09:22:36,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2023-12-25 09:22:36,752 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44299b80a/e06f1654e1744d04867df753d79b6f87/FLAG2b8488a88 [2023-12-25 09:22:36,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44299b80a/e06f1654e1744d04867df753d79b6f87 [2023-12-25 09:22:36,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 09:22:36,769 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 09:22:36,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 09:22:36,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 09:22:36,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 09:22:36,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 09:22:36" (1/1) ... [2023-12-25 09:22:36,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f0ed59a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:22:36, skipping insertion in model container [2023-12-25 09:22:36,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 09:22:36" (1/1) ... [2023-12-25 09:22:36,836 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 09:22:37,026 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-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7165,7178] [2023-12-25 09:22:37,054 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 09:22:37,070 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 09:22:37,102 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-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7165,7178] [2023-12-25 09:22:37,150 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 09:22:37,164 INFO L206 MainTranslator]: Completed translation [2023-12-25 09:22:37,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:22:37 WrapperNode [2023-12-25 09:22:37,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 09:22:37,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 09:22:37,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 09:22:37,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 09:22:37,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:22:37" (1/1) ... [2023-12-25 09:22:37,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:22:37" (1/1) ... [2023-12-25 09:22:37,229 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 590 [2023-12-25 09:22:37,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 09:22:37,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 09:22:37,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 09:22:37,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 09:22:37,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:22:37" (1/1) ... [2023-12-25 09:22:37,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:22:37" (1/1) ... [2023-12-25 09:22:37,255 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:22:37" (1/1) ... [2023-12-25 09:22:37,279 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 09:22:37,279 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:22:37" (1/1) ... [2023-12-25 09:22:37,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:22:37" (1/1) ... [2023-12-25 09:22:37,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:22:37" (1/1) ... [2023-12-25 09:22:37,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:22:37" (1/1) ... [2023-12-25 09:22:37,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:22:37" (1/1) ... [2023-12-25 09:22:37,292 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:22:37" (1/1) ... [2023-12-25 09:22:37,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 09:22:37,295 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 09:22:37,295 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 09:22:37,295 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 09:22:37,296 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:22:37" (1/1) ... [2023-12-25 09:22:37,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 09:22:37,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 09:22:37,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 09:22:37,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 09:22:37,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 09:22:37,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 09:22:37,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 09:22:37,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 09:22:37,457 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 09:22:37,459 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 09:22:37,890 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 09:22:37,925 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 09:22:37,926 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 09:22:37,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 09:22:37 BoogieIcfgContainer [2023-12-25 09:22:37,926 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 09:22:37,928 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 09:22:37,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 09:22:37,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 09:22:37,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 09:22:36" (1/3) ... [2023-12-25 09:22:37,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5151c924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 09:22:37, skipping insertion in model container [2023-12-25 09:22:37,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:22:37" (2/3) ... [2023-12-25 09:22:37,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5151c924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 09:22:37, skipping insertion in model container [2023-12-25 09:22:37,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 09:22:37" (3/3) ... [2023-12-25 09:22:37,932 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2023-12-25 09:22:37,945 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 09:22:37,945 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 09:22:37,978 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 09:22:37,982 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;@356fa070, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 09:22:37,982 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 09:22:37,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.7202797202797202) internal successors, (246), 144 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:37,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-25 09:22:37,991 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:37,991 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-25 09:22:37,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:37,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:37,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1045916224, now seen corresponding path program 1 times [2023-12-25 09:22:38,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:38,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412189237] [2023-12-25 09:22:38,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:38,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:38,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:38,006 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:22:38,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 09:22:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:38,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:22:38,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:38,272 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:22:38,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:38,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412189237] [2023-12-25 09:22:38,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412189237] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:22:38,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:22:38,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:22:38,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768327682] [2023-12-25 09:22:38,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:22:38,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:22:38,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:38,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:22:38,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:22:38,311 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.7202797202797202) internal successors, (246), 144 states have internal predecessors, (246), 0 states have call successors, (0), 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), 5 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-25 09:22:38,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:38,467 INFO L93 Difference]: Finished difference Result 437 states and 723 transitions. [2023-12-25 09:22:38,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:22:38,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-25 09:22:38,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:38,476 INFO L225 Difference]: With dead ends: 437 [2023-12-25 09:22:38,476 INFO L226 Difference]: Without dead ends: 324 [2023-12-25 09:22:38,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-25 09:22:38,484 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 530 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:38,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 677 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:22:38,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2023-12-25 09:22:38,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 320. [2023-12-25 09:22:38,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 1.5015673981191222) internal successors, (479), 319 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:38,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 479 transitions. [2023-12-25 09:22:38,546 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 479 transitions. Word has length 47 [2023-12-25 09:22:38,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:38,546 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 479 transitions. [2023-12-25 09:22:38,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-25 09:22:38,547 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 479 transitions. [2023-12-25 09:22:38,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-25 09:22:38,548 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:38,548 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-25 09:22:38,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 09:22:38,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:38,753 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:38,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:38,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1364333927, now seen corresponding path program 1 times [2023-12-25 09:22:38,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:38,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463290348] [2023-12-25 09:22:38,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:38,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:38,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:38,755 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:22:38,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 09:22:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:38,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:22:38,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:39,064 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:22:39,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:39,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463290348] [2023-12-25 09:22:39,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463290348] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:22:39,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:22:39,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:22:39,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686908421] [2023-12-25 09:22:39,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:22:39,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:22:39,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:39,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:22:39,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:22:39,070 INFO L87 Difference]: Start difference. First operand 320 states and 479 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-25 09:22:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:39,278 INFO L93 Difference]: Finished difference Result 795 states and 1213 transitions. [2023-12-25 09:22:39,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:22:39,279 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-25 09:22:39,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:39,281 INFO L225 Difference]: With dead ends: 795 [2023-12-25 09:22:39,281 INFO L226 Difference]: Without dead ends: 513 [2023-12-25 09:22:39,282 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-25 09:22:39,282 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 502 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:39,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 214 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:22:39,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2023-12-25 09:22:39,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 511. [2023-12-25 09:22:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 1.5156862745098039) internal successors, (773), 510 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 773 transitions. [2023-12-25 09:22:39,313 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 773 transitions. Word has length 48 [2023-12-25 09:22:39,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:39,313 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 773 transitions. [2023-12-25 09:22:39,313 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-25 09:22:39,313 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 773 transitions. [2023-12-25 09:22:39,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-25 09:22:39,314 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:39,315 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-25 09:22:39,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 09:22:39,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:39,518 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:39,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:39,518 INFO L85 PathProgramCache]: Analyzing trace with hash 497711606, now seen corresponding path program 1 times [2023-12-25 09:22:39,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:39,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325906456] [2023-12-25 09:22:39,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:39,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:39,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:39,520 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:22:39,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 09:22:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:39,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:22:39,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:39,742 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:22:39,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:39,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325906456] [2023-12-25 09:22:39,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325906456] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:22:39,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:22:39,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:22:39,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769307236] [2023-12-25 09:22:39,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:22:39,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:22:39,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:39,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:22:39,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:22:39,743 INFO L87 Difference]: Start difference. First operand 511 states and 773 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-25 09:22:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:39,921 INFO L93 Difference]: Finished difference Result 1308 states and 2014 transitions. [2023-12-25 09:22:39,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:22:39,921 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-25 09:22:39,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:39,924 INFO L225 Difference]: With dead ends: 1308 [2023-12-25 09:22:39,924 INFO L226 Difference]: Without dead ends: 855 [2023-12-25 09:22:39,924 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-25 09:22:39,925 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 480 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:39,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 216 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:22:39,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2023-12-25 09:22:39,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 853. [2023-12-25 09:22:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 852 states have (on average 1.528169014084507) internal successors, (1302), 852 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1302 transitions. [2023-12-25 09:22:39,938 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1302 transitions. Word has length 48 [2023-12-25 09:22:39,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:39,939 INFO L495 AbstractCegarLoop]: Abstraction has 853 states and 1302 transitions. [2023-12-25 09:22:39,939 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-25 09:22:39,939 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1302 transitions. [2023-12-25 09:22:39,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-25 09:22:39,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:39,940 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-25 09:22:39,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-25 09:22:40,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:40,143 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:40,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:40,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1018968620, now seen corresponding path program 1 times [2023-12-25 09:22:40,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:40,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218588741] [2023-12-25 09:22:40,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:40,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:40,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:40,146 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:22:40,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 09:22:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:40,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:22:40,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:40,366 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:22:40,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:40,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218588741] [2023-12-25 09:22:40,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218588741] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:22:40,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:22:40,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:22:40,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292508584] [2023-12-25 09:22:40,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:22:40,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:22:40,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:40,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:22:40,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:22:40,368 INFO L87 Difference]: Start difference. First operand 853 states and 1302 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-25 09:22:40,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:40,554 INFO L93 Difference]: Finished difference Result 2167 states and 3338 transitions. [2023-12-25 09:22:40,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:22:40,555 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-25 09:22:40,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:40,558 INFO L225 Difference]: With dead ends: 2167 [2023-12-25 09:22:40,558 INFO L226 Difference]: Without dead ends: 1347 [2023-12-25 09:22:40,559 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-25 09:22:40,560 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 655 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:40,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 207 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:22:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2023-12-25 09:22:40,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1345. [2023-12-25 09:22:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1344 states have (on average 1.5260416666666667) internal successors, (2051), 1344 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:40,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 2051 transitions. [2023-12-25 09:22:40,580 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 2051 transitions. Word has length 49 [2023-12-25 09:22:40,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:40,581 INFO L495 AbstractCegarLoop]: Abstraction has 1345 states and 2051 transitions. [2023-12-25 09:22:40,581 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-25 09:22:40,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 2051 transitions. [2023-12-25 09:22:40,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-25 09:22:40,582 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:40,582 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-25 09:22:40,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 09:22:40,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:40,784 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:40,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:40,785 INFO L85 PathProgramCache]: Analyzing trace with hash 132417652, now seen corresponding path program 1 times [2023-12-25 09:22:40,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:40,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405135184] [2023-12-25 09:22:40,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:40,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:40,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:40,786 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:22:40,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 09:22:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:40,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:22:40,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:41,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:41,268 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:22:41,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:41,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405135184] [2023-12-25 09:22:41,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405135184] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:22:41,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:22:41,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 09:22:41,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503523749] [2023-12-25 09:22:41,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:22:41,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:22:41,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:41,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:22:41,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:22:41,269 INFO L87 Difference]: Start difference. First operand 1345 states and 2051 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 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-25 09:22:42,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:42,270 INFO L93 Difference]: Finished difference Result 2834 states and 4340 transitions. [2023-12-25 09:22:42,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 09:22:42,271 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 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-25 09:22:42,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:42,276 INFO L225 Difference]: With dead ends: 2834 [2023-12-25 09:22:42,276 INFO L226 Difference]: Without dead ends: 2124 [2023-12-25 09:22:42,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-12-25 09:22:42,277 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 1303 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1303 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:42,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1303 Valid, 920 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 09:22:42,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2023-12-25 09:22:42,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 1396. [2023-12-25 09:22:42,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1395 states have (on average 1.5197132616487454) internal successors, (2120), 1395 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2120 transitions. [2023-12-25 09:22:42,298 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2120 transitions. Word has length 49 [2023-12-25 09:22:42,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:42,299 INFO L495 AbstractCegarLoop]: Abstraction has 1396 states and 2120 transitions. [2023-12-25 09:22:42,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 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-25 09:22:42,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2120 transitions. [2023-12-25 09:22:42,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-25 09:22:42,299 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:42,300 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-25 09:22:42,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-25 09:22:42,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:42,502 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:42,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:42,503 INFO L85 PathProgramCache]: Analyzing trace with hash -492755884, now seen corresponding path program 1 times [2023-12-25 09:22:42,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:42,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001419036] [2023-12-25 09:22:42,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:42,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:42,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:42,504 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:22:42,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 09:22:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:42,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:22:42,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:42,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:42,814 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:22:42,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:42,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001419036] [2023-12-25 09:22:42,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001419036] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:22:42,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:22:42,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 09:22:42,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954382773] [2023-12-25 09:22:42,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:22:42,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:22:42,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:42,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:22:42,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:22:42,815 INFO L87 Difference]: Start difference. First operand 1396 states and 2120 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 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-25 09:22:43,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:43,748 INFO L93 Difference]: Finished difference Result 1977 states and 2997 transitions. [2023-12-25 09:22:43,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 09:22:43,748 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 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-25 09:22:43,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:43,753 INFO L225 Difference]: With dead ends: 1977 [2023-12-25 09:22:43,753 INFO L226 Difference]: Without dead ends: 1699 [2023-12-25 09:22:43,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 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-25 09:22:43,755 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 919 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:43,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 890 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 09:22:43,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2023-12-25 09:22:43,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1396. [2023-12-25 09:22:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1395 states have (on average 1.5182795698924731) internal successors, (2118), 1395 states have internal predecessors, (2118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:43,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2118 transitions. [2023-12-25 09:22:43,777 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2118 transitions. Word has length 49 [2023-12-25 09:22:43,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:43,778 INFO L495 AbstractCegarLoop]: Abstraction has 1396 states and 2118 transitions. [2023-12-25 09:22:43,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 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-25 09:22:43,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2118 transitions. [2023-12-25 09:22:43,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-25 09:22:43,779 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:43,779 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-25 09:22:43,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 09:22:43,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:43,981 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:43,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:43,982 INFO L85 PathProgramCache]: Analyzing trace with hash 709773656, now seen corresponding path program 1 times [2023-12-25 09:22:43,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:43,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122821974] [2023-12-25 09:22:43,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:43,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:43,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:43,983 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:22:43,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 09:22:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:44,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:22:44,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:44,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:44,365 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:22:44,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:44,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122821974] [2023-12-25 09:22:44,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122821974] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:22:44,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:22:44,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 09:22:44,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799533676] [2023-12-25 09:22:44,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:22:44,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:22:44,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:44,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:22:44,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:22:44,367 INFO L87 Difference]: Start difference. First operand 1396 states and 2118 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 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-25 09:22:45,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:45,509 INFO L93 Difference]: Finished difference Result 3323 states and 5069 transitions. [2023-12-25 09:22:45,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 09:22:45,510 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 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-25 09:22:45,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:45,515 INFO L225 Difference]: With dead ends: 3323 [2023-12-25 09:22:45,515 INFO L226 Difference]: Without dead ends: 2196 [2023-12-25 09:22:45,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-12-25 09:22:45,518 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 1482 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:45,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1009 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 09:22:45,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2023-12-25 09:22:45,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 1420. [2023-12-25 09:22:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 1419 states have (on average 1.5024665257223397) internal successors, (2132), 1419 states have internal predecessors, (2132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 2132 transitions. [2023-12-25 09:22:45,554 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 2132 transitions. Word has length 50 [2023-12-25 09:22:45,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:45,555 INFO L495 AbstractCegarLoop]: Abstraction has 1420 states and 2132 transitions. [2023-12-25 09:22:45,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 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-25 09:22:45,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 2132 transitions. [2023-12-25 09:22:45,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-25 09:22:45,556 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:45,556 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-25 09:22:45,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-25 09:22:45,758 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-25 09:22:45,759 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:45,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:45,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1561494434, now seen corresponding path program 1 times [2023-12-25 09:22:45,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:45,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898977917] [2023-12-25 09:22:45,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:45,760 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:45,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:45,763 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-25 09:22:45,764 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-25 09:22:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:45,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:22:45,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:46,046 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:22:46,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:46,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898977917] [2023-12-25 09:22:46,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898977917] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:22:46,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:22:46,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:22:46,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133872227] [2023-12-25 09:22:46,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:22:46,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:22:46,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:46,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:22:46,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:22:46,053 INFO L87 Difference]: Start difference. First operand 1420 states and 2132 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-25 09:22:46,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:46,128 INFO L93 Difference]: Finished difference Result 4946 states and 7570 transitions. [2023-12-25 09:22:46,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:22:46,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-25 09:22:46,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:46,138 INFO L225 Difference]: With dead ends: 4946 [2023-12-25 09:22:46,138 INFO L226 Difference]: Without dead ends: 3980 [2023-12-25 09:22:46,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-25 09:22:46,140 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 741 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:46,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 587 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:22:46,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3980 states. [2023-12-25 09:22:46,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3980 to 2646. [2023-12-25 09:22:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2646 states, 2645 states have (on average 1.5001890359168242) internal successors, (3968), 2645 states have internal predecessors, (3968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:46,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 3968 transitions. [2023-12-25 09:22:46,178 INFO L78 Accepts]: Start accepts. Automaton has 2646 states and 3968 transitions. Word has length 50 [2023-12-25 09:22:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:46,179 INFO L495 AbstractCegarLoop]: Abstraction has 2646 states and 3968 transitions. [2023-12-25 09:22:46,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-25 09:22:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2646 states and 3968 transitions. [2023-12-25 09:22:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 09:22:46,180 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:46,180 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-25 09:22:46,192 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-25 09:22:46,383 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-25 09:22:46,383 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:46,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:46,384 INFO L85 PathProgramCache]: Analyzing trace with hash 932676141, now seen corresponding path program 1 times [2023-12-25 09:22:46,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:46,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795215449] [2023-12-25 09:22:46,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:46,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:46,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:46,388 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-25 09:22:46,389 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-25 09:22:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:46,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:22:46,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:46,474 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:22:46,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:46,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795215449] [2023-12-25 09:22:46,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795215449] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:22:46,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:22:46,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:22:46,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377223407] [2023-12-25 09:22:46,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:22:46,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:22:46,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:46,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:22:46,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:22:46,475 INFO L87 Difference]: Start difference. First operand 2646 states and 3968 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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-25 09:22:46,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:46,494 INFO L93 Difference]: Finished difference Result 3979 states and 5983 transitions. [2023-12-25 09:22:46,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:22:46,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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-25 09:22:46,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:46,501 INFO L225 Difference]: With dead ends: 3979 [2023-12-25 09:22:46,501 INFO L226 Difference]: Without dead ends: 2943 [2023-12-25 09:22:46,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-25 09:22:46,502 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 129 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:46,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 411 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:22:46,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2023-12-25 09:22:46,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2585. [2023-12-25 09:22:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2585 states, 2584 states have (on average 1.4748452012383901) internal successors, (3811), 2584 states have internal predecessors, (3811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 3811 transitions. [2023-12-25 09:22:46,532 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 3811 transitions. Word has length 52 [2023-12-25 09:22:46,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:46,532 INFO L495 AbstractCegarLoop]: Abstraction has 2585 states and 3811 transitions. [2023-12-25 09:22:46,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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-25 09:22:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3811 transitions. [2023-12-25 09:22:46,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 09:22:46,533 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:46,533 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-25 09:22:46,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 09:22:46,735 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-25 09:22:46,735 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:46,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:46,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2056725357, now seen corresponding path program 1 times [2023-12-25 09:22:46,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:46,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513188541] [2023-12-25 09:22:46,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:46,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:46,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:46,738 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-25 09:22:46,793 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-25 09:22:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:46,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:22:46,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:46,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:46,842 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:22:46,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:46,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1513188541] [2023-12-25 09:22:46,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1513188541] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:22:46,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:22:46,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:22:46,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033155205] [2023-12-25 09:22:46,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:22:46,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:22:46,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:46,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:22:46,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:22:46,844 INFO L87 Difference]: Start difference. First operand 2585 states and 3811 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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-25 09:22:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:46,870 INFO L93 Difference]: Finished difference Result 4863 states and 7200 transitions. [2023-12-25 09:22:46,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:22:46,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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-25 09:22:46,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:46,876 INFO L225 Difference]: With dead ends: 4863 [2023-12-25 09:22:46,877 INFO L226 Difference]: Without dead ends: 3103 [2023-12-25 09:22:46,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-25 09:22:46,879 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 130 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:46,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 397 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:22:46,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3103 states. [2023-12-25 09:22:46,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3103 to 2409. [2023-12-25 09:22:46,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2409 states, 2408 states have (on average 1.441029900332226) internal successors, (3470), 2408 states have internal predecessors, (3470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:46,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2409 states to 2409 states and 3470 transitions. [2023-12-25 09:22:46,919 INFO L78 Accepts]: Start accepts. Automaton has 2409 states and 3470 transitions. Word has length 52 [2023-12-25 09:22:46,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:46,919 INFO L495 AbstractCegarLoop]: Abstraction has 2409 states and 3470 transitions. [2023-12-25 09:22:46,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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-25 09:22:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 3470 transitions. [2023-12-25 09:22:46,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-25 09:22:46,920 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:46,921 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-25 09:22:46,926 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-25 09:22:47,124 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-25 09:22:47,125 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:47,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:47,125 INFO L85 PathProgramCache]: Analyzing trace with hash -730079032, now seen corresponding path program 1 times [2023-12-25 09:22:47,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:47,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330556990] [2023-12-25 09:22:47,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:47,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:47,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:47,127 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-25 09:22:47,135 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-25 09:22:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:47,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:22:47,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:47,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:47,207 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:22:47,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:47,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330556990] [2023-12-25 09:22:47,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330556990] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:22:47,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:22:47,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:22:47,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165495280] [2023-12-25 09:22:47,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:22:47,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:22:47,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:47,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:22:47,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:22:47,208 INFO L87 Difference]: Start difference. First operand 2409 states and 3470 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:47,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:47,227 INFO L93 Difference]: Finished difference Result 3971 states and 5734 transitions. [2023-12-25 09:22:47,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:22:47,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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-25 09:22:47,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:47,232 INFO L225 Difference]: With dead ends: 3971 [2023-12-25 09:22:47,232 INFO L226 Difference]: Without dead ends: 2345 [2023-12-25 09:22:47,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 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-25 09:22:47,234 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 135 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:47,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 459 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:22:47,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2023-12-25 09:22:47,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 2315. [2023-12-25 09:22:47,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2315 states, 2314 states have (on average 1.4027657735522905) internal successors, (3246), 2314 states have internal predecessors, (3246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:47,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 3246 transitions. [2023-12-25 09:22:47,263 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 3246 transitions. Word has length 53 [2023-12-25 09:22:47,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:47,263 INFO L495 AbstractCegarLoop]: Abstraction has 2315 states and 3246 transitions. [2023-12-25 09:22:47,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3246 transitions. [2023-12-25 09:22:47,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-25 09:22:47,264 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:47,264 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-25 09:22:47,268 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-25 09:22:47,466 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-25 09:22:47,466 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:47,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:47,466 INFO L85 PathProgramCache]: Analyzing trace with hash 86671270, now seen corresponding path program 1 times [2023-12-25 09:22:47,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:47,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034531725] [2023-12-25 09:22:47,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:47,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:47,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:47,468 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-25 09:22:47,499 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-25 09:22:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:47,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 09:22:47,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:47,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:47,616 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:22:47,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:47,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034531725] [2023-12-25 09:22:47,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034531725] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:22:47,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:22:47,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:22:47,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611715586] [2023-12-25 09:22:47,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:22:47,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 09:22:47,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:47,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 09:22:47,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-25 09:22:47,617 INFO L87 Difference]: Start difference. First operand 2315 states and 3246 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) 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-25 09:22:47,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:47,814 INFO L93 Difference]: Finished difference Result 6873 states and 9664 transitions. [2023-12-25 09:22:47,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 09:22:47,814 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) 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-25 09:22:47,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:47,825 INFO L225 Difference]: With dead ends: 6873 [2023-12-25 09:22:47,825 INFO L226 Difference]: Without dead ends: 5013 [2023-12-25 09:22:47,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:22:47,828 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 934 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:47,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 407 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:22:47,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5013 states. [2023-12-25 09:22:47,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5013 to 2283. [2023-12-25 09:22:47,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2283 states, 2282 states have (on average 1.3930762489044697) internal successors, (3179), 2282 states have internal predecessors, (3179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:47,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 3179 transitions. [2023-12-25 09:22:47,860 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 3179 transitions. Word has length 53 [2023-12-25 09:22:47,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:47,860 INFO L495 AbstractCegarLoop]: Abstraction has 2283 states and 3179 transitions. [2023-12-25 09:22:47,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) 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-25 09:22:47,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3179 transitions. [2023-12-25 09:22:47,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-25 09:22:47,861 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:47,861 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-25 09:22:47,865 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-25 09:22:48,063 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-25 09:22:48,063 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:48,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:48,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1679600839, now seen corresponding path program 1 times [2023-12-25 09:22:48,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:48,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645888926] [2023-12-25 09:22:48,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:48,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:48,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:48,065 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-25 09:22:48,066 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-25 09:22:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:48,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 09:22:48,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:48,270 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:22:48,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:48,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645888926] [2023-12-25 09:22:48,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645888926] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:22:48,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:22:48,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:22:48,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666782891] [2023-12-25 09:22:48,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:22:48,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 09:22:48,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:48,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 09:22:48,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-25 09:22:48,271 INFO L87 Difference]: Start difference. First operand 2283 states and 3179 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) 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-25 09:22:48,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:48,512 INFO L93 Difference]: Finished difference Result 8697 states and 12137 transitions. [2023-12-25 09:22:48,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 09:22:48,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) 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-25 09:22:48,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:48,522 INFO L225 Difference]: With dead ends: 8697 [2023-12-25 09:22:48,522 INFO L226 Difference]: Without dead ends: 6863 [2023-12-25 09:22:48,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-12-25 09:22:48,525 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 789 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:48,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 472 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:22:48,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6863 states. [2023-12-25 09:22:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6863 to 2344. [2023-12-25 09:22:48,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 2343 states have (on average 1.3713188220230474) internal successors, (3213), 2343 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:48,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 3213 transitions. [2023-12-25 09:22:48,565 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 3213 transitions. Word has length 53 [2023-12-25 09:22:48,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:48,565 INFO L495 AbstractCegarLoop]: Abstraction has 2344 states and 3213 transitions. [2023-12-25 09:22:48,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) 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-25 09:22:48,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3213 transitions. [2023-12-25 09:22:48,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-25 09:22:48,566 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:48,566 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-25 09:22:48,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-25 09:22:48,768 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-25 09:22:48,768 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:48,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:48,769 INFO L85 PathProgramCache]: Analyzing trace with hash -719086911, now seen corresponding path program 1 times [2023-12-25 09:22:48,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:48,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799397154] [2023-12-25 09:22:48,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:48,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:48,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:48,770 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-25 09:22:48,777 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-25 09:22:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:48,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 09:22:48,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:48,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-25 09:22:48,916 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:22:48,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:48,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799397154] [2023-12-25 09:22:48,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799397154] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:22:48,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:22:48,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:22:48,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261394815] [2023-12-25 09:22:48,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:22:48,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 09:22:48,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:48,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 09:22:48,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-25 09:22:48,918 INFO L87 Difference]: Start difference. First operand 2344 states and 3213 transitions. Second operand has 6 states, 6 states have (on average 9.0) 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-25 09:22:49,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:49,108 INFO L93 Difference]: Finished difference Result 7926 states and 10936 transitions. [2023-12-25 09:22:49,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 09:22:49,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) 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-25 09:22:49,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:49,115 INFO L225 Difference]: With dead ends: 7926 [2023-12-25 09:22:49,115 INFO L226 Difference]: Without dead ends: 6020 [2023-12-25 09:22:49,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-12-25 09:22:49,117 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 786 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:49,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 380 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:22:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2023-12-25 09:22:49,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 2348. [2023-12-25 09:22:49,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2348 states, 2347 states have (on average 1.3553472518108223) internal successors, (3181), 2347 states have internal predecessors, (3181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:49,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 3181 transitions. [2023-12-25 09:22:49,178 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 3181 transitions. Word has length 54 [2023-12-25 09:22:49,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:49,178 INFO L495 AbstractCegarLoop]: Abstraction has 2348 states and 3181 transitions. [2023-12-25 09:22:49,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) 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-25 09:22:49,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 3181 transitions. [2023-12-25 09:22:49,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-25 09:22:49,179 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:49,179 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-25 09:22:49,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-25 09:22:49,382 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-25 09:22:49,382 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:49,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:49,382 INFO L85 PathProgramCache]: Analyzing trace with hash -540840211, now seen corresponding path program 1 times [2023-12-25 09:22:49,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:49,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5930738] [2023-12-25 09:22:49,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:49,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:49,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:49,384 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-25 09:22:49,386 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-25 09:22:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:49,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:22:49,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:49,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:49,588 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:22:49,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:49,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5930738] [2023-12-25 09:22:49,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5930738] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:22:49,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:22:49,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:22:49,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771114498] [2023-12-25 09:22:49,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:22:49,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:22:49,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:49,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:22:49,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:22:49,590 INFO L87 Difference]: Start difference. First operand 2348 states and 3181 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-25 09:22:49,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:49,649 INFO L93 Difference]: Finished difference Result 3479 states and 4782 transitions. [2023-12-25 09:22:49,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:22:49,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-25 09:22:49,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:49,653 INFO L225 Difference]: With dead ends: 3479 [2023-12-25 09:22:49,653 INFO L226 Difference]: Without dead ends: 3232 [2023-12-25 09:22:49,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 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-25 09:22:49,655 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 339 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:49,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 724 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:22:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2023-12-25 09:22:49,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 2641. [2023-12-25 09:22:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2641 states, 2640 states have (on average 1.356439393939394) internal successors, (3581), 2640 states have internal predecessors, (3581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2641 states and 3581 transitions. [2023-12-25 09:22:49,687 INFO L78 Accepts]: Start accepts. Automaton has 2641 states and 3581 transitions. Word has length 55 [2023-12-25 09:22:49,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:49,688 INFO L495 AbstractCegarLoop]: Abstraction has 2641 states and 3581 transitions. [2023-12-25 09:22:49,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-25 09:22:49,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 3581 transitions. [2023-12-25 09:22:49,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-25 09:22:49,689 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:49,689 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-25 09:22:49,695 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-25 09:22:49,890 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-25 09:22:49,890 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:49,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:49,890 INFO L85 PathProgramCache]: Analyzing trace with hash 36774206, now seen corresponding path program 1 times [2023-12-25 09:22:49,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:49,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160488827] [2023-12-25 09:22:49,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:49,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:49,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:49,892 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-25 09:22:49,892 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-25 09:22:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:49,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:22:49,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:50,095 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:22:50,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:50,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160488827] [2023-12-25 09:22:50,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160488827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:22:50,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:22:50,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:22:50,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746757270] [2023-12-25 09:22:50,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:22:50,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:22:50,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:50,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:22:50,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:22:50,097 INFO L87 Difference]: Start difference. First operand 2641 states and 3581 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-25 09:22:50,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:50,155 INFO L93 Difference]: Finished difference Result 4045 states and 5571 transitions. [2023-12-25 09:22:50,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:22:50,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-25 09:22:50,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:50,159 INFO L225 Difference]: With dead ends: 4045 [2023-12-25 09:22:50,159 INFO L226 Difference]: Without dead ends: 3506 [2023-12-25 09:22:50,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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-25 09:22:50,160 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 446 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:50,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 777 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:22:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2023-12-25 09:22:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3236. [2023-12-25 09:22:50,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3236 states, 3235 states have (on average 1.3582689335394127) internal successors, (4394), 3235 states have internal predecessors, (4394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:50,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3236 states to 3236 states and 4394 transitions. [2023-12-25 09:22:50,188 INFO L78 Accepts]: Start accepts. Automaton has 3236 states and 4394 transitions. Word has length 56 [2023-12-25 09:22:50,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:50,188 INFO L495 AbstractCegarLoop]: Abstraction has 3236 states and 4394 transitions. [2023-12-25 09:22:50,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-25 09:22:50,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 4394 transitions. [2023-12-25 09:22:50,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-25 09:22:50,189 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:50,189 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-25 09:22:50,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-12-25 09:22:50,391 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-25 09:22:50,392 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:50,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:50,392 INFO L85 PathProgramCache]: Analyzing trace with hash 526334293, now seen corresponding path program 1 times [2023-12-25 09:22:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:50,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705009507] [2023-12-25 09:22:50,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:50,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:50,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:50,394 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-25 09:22:50,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-25 09:22:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:50,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:22:50,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:50,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:50,671 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:22:50,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:50,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705009507] [2023-12-25 09:22:50,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705009507] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:22:50,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:22:50,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:22:50,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895897654] [2023-12-25 09:22:50,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:22:50,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:22:50,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:50,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:22:50,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:22:50,672 INFO L87 Difference]: Start difference. First operand 3236 states and 4394 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-25 09:22:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:50,727 INFO L93 Difference]: Finished difference Result 4937 states and 6807 transitions. [2023-12-25 09:22:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:22:50,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-25 09:22:50,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:50,732 INFO L225 Difference]: With dead ends: 4937 [2023-12-25 09:22:50,732 INFO L226 Difference]: Without dead ends: 4110 [2023-12-25 09:22:50,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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-25 09:22:50,735 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 463 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:50,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 700 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:22:50,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4110 states. [2023-12-25 09:22:50,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4110 to 3704. [2023-12-25 09:22:50,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3704 states, 3703 states have (on average 1.3570078314879828) internal successors, (5025), 3703 states have internal predecessors, (5025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3704 states to 3704 states and 5025 transitions. [2023-12-25 09:22:50,765 INFO L78 Accepts]: Start accepts. Automaton has 3704 states and 5025 transitions. Word has length 56 [2023-12-25 09:22:50,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:50,766 INFO L495 AbstractCegarLoop]: Abstraction has 3704 states and 5025 transitions. [2023-12-25 09:22:50,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-25 09:22:50,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3704 states and 5025 transitions. [2023-12-25 09:22:50,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 09:22:50,767 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:50,767 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] [2023-12-25 09:22:50,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-12-25 09:22:50,969 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-25 09:22:50,969 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:50,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:50,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1386526584, now seen corresponding path program 1 times [2023-12-25 09:22:50,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:50,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002360661] [2023-12-25 09:22:50,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:50,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:50,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:50,971 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-25 09:22:50,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-25 09:22:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:51,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:22:51,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:51,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:51,080 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:22:51,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:51,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002360661] [2023-12-25 09:22:51,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002360661] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:22:51,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:22:51,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:22:51,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528772081] [2023-12-25 09:22:51,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:22:51,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:22:51,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:51,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:22:51,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:22:51,081 INFO L87 Difference]: Start difference. First operand 3704 states and 5025 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:51,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:51,099 INFO L93 Difference]: Finished difference Result 4581 states and 6215 transitions. [2023-12-25 09:22:51,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:22:51,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2023-12-25 09:22:51,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:51,101 INFO L225 Difference]: With dead ends: 4581 [2023-12-25 09:22:51,101 INFO L226 Difference]: Without dead ends: 3271 [2023-12-25 09:22:51,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 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-25 09:22:51,103 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 123 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:51,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 385 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:22:51,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3271 states. [2023-12-25 09:22:51,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3271 to 3269. [2023-12-25 09:22:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3269 states, 3268 states have (on average 1.3393512851897185) internal successors, (4377), 3268 states have internal predecessors, (4377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 4377 transitions. [2023-12-25 09:22:51,129 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 4377 transitions. Word has length 61 [2023-12-25 09:22:51,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:51,129 INFO L495 AbstractCegarLoop]: Abstraction has 3269 states and 4377 transitions. [2023-12-25 09:22:51,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:51,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 4377 transitions. [2023-12-25 09:22:51,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 09:22:51,131 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:51,131 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] [2023-12-25 09:22:51,142 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-25 09:22:51,333 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-25 09:22:51,333 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:51,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:51,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1149979677, now seen corresponding path program 1 times [2023-12-25 09:22:51,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:51,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978477228] [2023-12-25 09:22:51,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:51,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:51,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:51,335 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-25 09:22:51,336 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-25 09:22:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:51,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:22:51,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:51,410 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:22:51,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:51,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978477228] [2023-12-25 09:22:51,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978477228] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:22:51,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:22:51,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:22:51,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561438737] [2023-12-25 09:22:51,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:22:51,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:22:51,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:51,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:22:51,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:22:51,411 INFO L87 Difference]: Start difference. First operand 3269 states and 4377 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:51,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:51,430 INFO L93 Difference]: Finished difference Result 3779 states and 5050 transitions. [2023-12-25 09:22:51,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:22:51,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2023-12-25 09:22:51,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:51,431 INFO L225 Difference]: With dead ends: 3779 [2023-12-25 09:22:51,431 INFO L226 Difference]: Without dead ends: 2432 [2023-12-25 09:22:51,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 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-25 09:22:51,433 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 140 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:51,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 444 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:22:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2023-12-25 09:22:51,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2430. [2023-12-25 09:22:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2430 states, 2429 states have (on average 1.3062988884314533) internal successors, (3173), 2429 states have internal predecessors, (3173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 3173 transitions. [2023-12-25 09:22:51,449 INFO L78 Accepts]: Start accepts. Automaton has 2430 states and 3173 transitions. Word has length 61 [2023-12-25 09:22:51,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:51,450 INFO L495 AbstractCegarLoop]: Abstraction has 2430 states and 3173 transitions. [2023-12-25 09:22:51,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 3173 transitions. [2023-12-25 09:22:51,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 09:22:51,451 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:51,451 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] [2023-12-25 09:22:51,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-12-25 09:22:51,653 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-25 09:22:51,653 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:51,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:51,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1379218415, now seen corresponding path program 1 times [2023-12-25 09:22:51,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:51,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887298773] [2023-12-25 09:22:51,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:51,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:51,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:51,655 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-25 09:22:51,664 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-25 09:22:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:51,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 09:22:51,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:52,938 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:22:52,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:52,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887298773] [2023-12-25 09:22:52,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887298773] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:22:52,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:22:52,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-12-25 09:22:52,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320201342] [2023-12-25 09:22:52,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:22:52,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 09:22:52,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:52,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 09:22:52,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-12-25 09:22:52,941 INFO L87 Difference]: Start difference. First operand 2430 states and 3173 transitions. Second operand has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:55,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:55,411 INFO L93 Difference]: Finished difference Result 6817 states and 9032 transitions. [2023-12-25 09:22:55,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 09:22:55,411 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2023-12-25 09:22:55,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:55,414 INFO L225 Difference]: With dead ends: 6817 [2023-12-25 09:22:55,414 INFO L226 Difference]: Without dead ends: 4919 [2023-12-25 09:22:55,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2023-12-25 09:22:55,417 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 938 mSDsluCounter, 2911 mSDsCounter, 0 mSdLazyCounter, 1838 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:55,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 3246 Invalid, 1844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1838 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-25 09:22:55,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4919 states. [2023-12-25 09:22:55,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4919 to 3288. [2023-12-25 09:22:55,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3288 states, 3287 states have (on average 1.3218740492850625) internal successors, (4345), 3287 states have internal predecessors, (4345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:55,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 4345 transitions. [2023-12-25 09:22:55,462 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 4345 transitions. Word has length 62 [2023-12-25 09:22:55,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:55,462 INFO L495 AbstractCegarLoop]: Abstraction has 3288 states and 4345 transitions. [2023-12-25 09:22:55,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:55,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 4345 transitions. [2023-12-25 09:22:55,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 09:22:55,463 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:55,464 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] [2023-12-25 09:22:55,469 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-25 09:22:55,668 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-25 09:22:55,669 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:55,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:55,669 INFO L85 PathProgramCache]: Analyzing trace with hash -657539413, now seen corresponding path program 1 times [2023-12-25 09:22:55,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:55,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246534905] [2023-12-25 09:22:55,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:55,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:55,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:55,670 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-25 09:22:55,671 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-25 09:22:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:55,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 09:22:55,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:57,009 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:22:57,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:57,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246534905] [2023-12-25 09:22:57,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246534905] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:22:57,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:22:57,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-12-25 09:22:57,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911109073] [2023-12-25 09:22:57,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:22:57,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 09:22:57,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:57,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 09:22:57,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2023-12-25 09:22:57,010 INFO L87 Difference]: Start difference. First operand 3288 states and 4345 transitions. Second operand has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:00,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:00,018 INFO L93 Difference]: Finished difference Result 4995 states and 6616 transitions. [2023-12-25 09:23:00,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-25 09:23:00,018 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2023-12-25 09:23:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:00,022 INFO L225 Difference]: With dead ends: 4995 [2023-12-25 09:23:00,022 INFO L226 Difference]: Without dead ends: 4865 [2023-12-25 09:23:00,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=229, Invalid=763, Unknown=0, NotChecked=0, Total=992 [2023-12-25 09:23:00,023 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 1118 mSDsluCounter, 3535 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 3852 SdHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:00,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 3852 Invalid, 2391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-25 09:23:00,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4865 states. [2023-12-25 09:23:00,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4865 to 3294. [2023-12-25 09:23:00,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3294 states, 3293 states have (on average 1.321591254175524) internal successors, (4352), 3293 states have internal predecessors, (4352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 4352 transitions. [2023-12-25 09:23:00,055 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 4352 transitions. Word has length 62 [2023-12-25 09:23:00,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:00,056 INFO L495 AbstractCegarLoop]: Abstraction has 3294 states and 4352 transitions. [2023-12-25 09:23:00,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 4352 transitions. [2023-12-25 09:23:00,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 09:23:00,057 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:00,057 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] [2023-12-25 09:23:00,072 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 (22)] Forceful destruction successful, exit code 0 [2023-12-25 09:23:00,259 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-25 09:23:00,259 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:00,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:00,260 INFO L85 PathProgramCache]: Analyzing trace with hash -909030368, now seen corresponding path program 1 times [2023-12-25 09:23:00,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:00,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537906232] [2023-12-25 09:23:00,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:00,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:00,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:00,261 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-25 09:23:00,263 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-25 09:23:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:00,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 09:23:00,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:01,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:01,755 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:23:01,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:01,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537906232] [2023-12-25 09:23:01,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537906232] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:23:01,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:23:01,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-12-25 09:23:01,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409282645] [2023-12-25 09:23:01,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:23:01,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-25 09:23:01,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:01,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-25 09:23:01,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2023-12-25 09:23:01,757 INFO L87 Difference]: Start difference. First operand 3294 states and 4352 transitions. Second operand has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:05,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:05,065 INFO L93 Difference]: Finished difference Result 4936 states and 6538 transitions. [2023-12-25 09:23:05,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-25 09:23:05,065 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2023-12-25 09:23:05,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:05,070 INFO L225 Difference]: With dead ends: 4936 [2023-12-25 09:23:05,070 INFO L226 Difference]: Without dead ends: 4806 [2023-12-25 09:23:05,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 09:23:05,071 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 821 mSDsluCounter, 4146 mSDsCounter, 0 mSdLazyCounter, 2704 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 4520 SdHoareTripleChecker+Invalid, 2706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:05,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 4520 Invalid, 2706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2704 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-25 09:23:05,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4806 states. [2023-12-25 09:23:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4806 to 3249. [2023-12-25 09:23:05,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3249 states, 3248 states have (on average 1.3214285714285714) internal successors, (4292), 3248 states have internal predecessors, (4292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:05,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3249 states to 3249 states and 4292 transitions. [2023-12-25 09:23:05,121 INFO L78 Accepts]: Start accepts. Automaton has 3249 states and 4292 transitions. Word has length 63 [2023-12-25 09:23:05,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:05,121 INFO L495 AbstractCegarLoop]: Abstraction has 3249 states and 4292 transitions. [2023-12-25 09:23:05,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3249 states and 4292 transitions. [2023-12-25 09:23:05,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-25 09:23:05,122 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:05,122 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] [2023-12-25 09:23:05,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-12-25 09:23:05,324 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-25 09:23:05,325 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:05,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:05,325 INFO L85 PathProgramCache]: Analyzing trace with hash 942548057, now seen corresponding path program 1 times [2023-12-25 09:23:05,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:05,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469953827] [2023-12-25 09:23:05,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:05,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:05,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:05,327 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-25 09:23:05,328 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-25 09:23:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:05,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:23:05,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:05,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:05,440 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:23:05,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:05,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469953827] [2023-12-25 09:23:05,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469953827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:23:05,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:23:05,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:23:05,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307190335] [2023-12-25 09:23:05,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:23:05,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:23:05,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:05,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:23:05,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:23:05,442 INFO L87 Difference]: Start difference. First operand 3249 states and 4292 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:05,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:05,462 INFO L93 Difference]: Finished difference Result 8291 states and 11093 transitions. [2023-12-25 09:23:05,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:23:05,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2023-12-25 09:23:05,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:05,465 INFO L225 Difference]: With dead ends: 8291 [2023-12-25 09:23:05,465 INFO L226 Difference]: Without dead ends: 5455 [2023-12-25 09:23:05,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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-25 09:23:05,467 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 115 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 340 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-25 09:23:05,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 340 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:23:05,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5455 states. [2023-12-25 09:23:05,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5455 to 5453. [2023-12-25 09:23:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5453 states, 5452 states have (on average 1.3237344093910492) internal successors, (7217), 5452 states have internal predecessors, (7217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 7217 transitions. [2023-12-25 09:23:05,508 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 7217 transitions. Word has length 67 [2023-12-25 09:23:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:05,508 INFO L495 AbstractCegarLoop]: Abstraction has 5453 states and 7217 transitions. [2023-12-25 09:23:05,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 7217 transitions. [2023-12-25 09:23:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-25 09:23:05,509 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:05,509 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] [2023-12-25 09:23:05,512 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-25 09:23:05,711 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-25 09:23:05,712 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:05,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:05,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1222049860, now seen corresponding path program 1 times [2023-12-25 09:23:05,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:05,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871568461] [2023-12-25 09:23:05,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:05,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:05,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:05,714 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-25 09:23:05,715 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-25 09:23:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:05,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:23:05,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:05,810 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:23:05,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:05,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871568461] [2023-12-25 09:23:05,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871568461] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:23:05,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:23:05,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:23:05,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830802666] [2023-12-25 09:23:05,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:23:05,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:23:05,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:05,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:23:05,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:23:05,812 INFO L87 Difference]: Start difference. First operand 5453 states and 7217 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:05,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:05,861 INFO L93 Difference]: Finished difference Result 14269 states and 19053 transitions. [2023-12-25 09:23:05,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:23:05,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2023-12-25 09:23:05,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:05,870 INFO L225 Difference]: With dead ends: 14269 [2023-12-25 09:23:05,870 INFO L226 Difference]: Without dead ends: 9229 [2023-12-25 09:23:05,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-25 09:23:05,876 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 108 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 331 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-25 09:23:05,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 331 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:23:05,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9229 states. [2023-12-25 09:23:05,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9229 to 9227. [2023-12-25 09:23:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9227 states, 9226 states have (on average 1.3205072620854108) internal successors, (12183), 9226 states have internal predecessors, (12183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9227 states to 9227 states and 12183 transitions. [2023-12-25 09:23:05,969 INFO L78 Accepts]: Start accepts. Automaton has 9227 states and 12183 transitions. Word has length 68 [2023-12-25 09:23:05,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:05,969 INFO L495 AbstractCegarLoop]: Abstraction has 9227 states and 12183 transitions. [2023-12-25 09:23:05,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:05,969 INFO L276 IsEmpty]: Start isEmpty. Operand 9227 states and 12183 transitions. [2023-12-25 09:23:05,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 09:23:05,971 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:05,971 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] [2023-12-25 09:23:05,990 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 (25)] Forceful destruction successful, exit code 0 [2023-12-25 09:23:06,173 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-25 09:23:06,173 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:06,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:06,174 INFO L85 PathProgramCache]: Analyzing trace with hash 580845370, now seen corresponding path program 1 times [2023-12-25 09:23:06,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:06,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107061380] [2023-12-25 09:23:06,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:06,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:06,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:06,176 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:06,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-25 09:23:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:06,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 09:23:06,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:06,261 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:23:06,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:06,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107061380] [2023-12-25 09:23:06,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107061380] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:23:06,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:23:06,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:23:06,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749677808] [2023-12-25 09:23:06,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:23:06,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:23:06,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:06,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:23:06,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:23:06,262 INFO L87 Difference]: Start difference. First operand 9227 states and 12183 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:06,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:06,345 INFO L93 Difference]: Finished difference Result 16494 states and 21371 transitions. [2023-12-25 09:23:06,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 09:23:06,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2023-12-25 09:23:06,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:06,360 INFO L225 Difference]: With dead ends: 16494 [2023-12-25 09:23:06,360 INFO L226 Difference]: Without dead ends: 13980 [2023-12-25 09:23:06,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 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-25 09:23:06,366 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 287 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:06,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 689 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:23:06,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13980 states. [2023-12-25 09:23:06,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13980 to 7920. [2023-12-25 09:23:06,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7920 states, 7919 states have (on average 1.2889253693648188) internal successors, (10207), 7919 states have internal predecessors, (10207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:06,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7920 states to 7920 states and 10207 transitions. [2023-12-25 09:23:06,506 INFO L78 Accepts]: Start accepts. Automaton has 7920 states and 10207 transitions. Word has length 71 [2023-12-25 09:23:06,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:06,506 INFO L495 AbstractCegarLoop]: Abstraction has 7920 states and 10207 transitions. [2023-12-25 09:23:06,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:06,507 INFO L276 IsEmpty]: Start isEmpty. Operand 7920 states and 10207 transitions. [2023-12-25 09:23:06,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-25 09:23:06,508 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:06,508 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] [2023-12-25 09:23:06,526 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 (26)] Forceful destruction successful, exit code 0 [2023-12-25 09:23:06,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:06,710 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:06,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:06,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1426787329, now seen corresponding path program 1 times [2023-12-25 09:23:06,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:06,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089738259] [2023-12-25 09:23:06,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:06,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:06,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:06,712 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:06,739 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 (27)] Waiting until timeout for monitored process [2023-12-25 09:23:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:06,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 09:23:06,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:06,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:06,858 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:23:06,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:06,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089738259] [2023-12-25 09:23:06,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089738259] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:23:06,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:23:06,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:23:06,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10110283] [2023-12-25 09:23:06,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:23:06,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 09:23:06,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:06,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 09:23:06,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 09:23:06,859 INFO L87 Difference]: Start difference. First operand 7920 states and 10207 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:06,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:06,903 INFO L93 Difference]: Finished difference Result 19571 states and 25134 transitions. [2023-12-25 09:23:06,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 09:23:06,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2023-12-25 09:23:06,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:06,914 INFO L225 Difference]: With dead ends: 19571 [2023-12-25 09:23:06,914 INFO L226 Difference]: Without dead ends: 11984 [2023-12-25 09:23:06,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 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-25 09:23:06,921 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 90 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:06,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 443 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:23:06,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11984 states. [2023-12-25 09:23:07,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11984 to 11830. [2023-12-25 09:23:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11830 states, 11829 states have (on average 1.2538676134922648) internal successors, (14832), 11829 states have internal predecessors, (14832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:07,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11830 states to 11830 states and 14832 transitions. [2023-12-25 09:23:07,021 INFO L78 Accepts]: Start accepts. Automaton has 11830 states and 14832 transitions. Word has length 72 [2023-12-25 09:23:07,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:07,021 INFO L495 AbstractCegarLoop]: Abstraction has 11830 states and 14832 transitions. [2023-12-25 09:23:07,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:07,022 INFO L276 IsEmpty]: Start isEmpty. Operand 11830 states and 14832 transitions. [2023-12-25 09:23:07,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-25 09:23:07,023 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:07,023 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] [2023-12-25 09:23:07,028 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 (27)] Forceful destruction successful, exit code 0 [2023-12-25 09:23:07,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:07,226 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:07,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:07,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1064758803, now seen corresponding path program 1 times [2023-12-25 09:23:07,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:07,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774295461] [2023-12-25 09:23:07,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:07,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:07,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:07,228 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:07,229 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 (28)] Waiting until timeout for monitored process [2023-12-25 09:23:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:07,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:23:07,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:07,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:07,301 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:23:07,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:07,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774295461] [2023-12-25 09:23:07,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [774295461] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:23:07,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:23:07,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:23:07,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565354444] [2023-12-25 09:23:07,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:23:07,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:23:07,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:07,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:23:07,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:23:07,302 INFO L87 Difference]: Start difference. First operand 11830 states and 14832 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:07,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:07,348 INFO L93 Difference]: Finished difference Result 24414 states and 31078 transitions. [2023-12-25 09:23:07,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:23:07,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2023-12-25 09:23:07,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:07,364 INFO L225 Difference]: With dead ends: 24414 [2023-12-25 09:23:07,365 INFO L226 Difference]: Without dead ends: 16814 [2023-12-25 09:23:07,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 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-25 09:23:07,374 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 104 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:07,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 328 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:23:07,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16814 states. [2023-12-25 09:23:07,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16814 to 16812. [2023-12-25 09:23:07,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16812 states, 16811 states have (on average 1.249122598298733) internal successors, (20999), 16811 states have internal predecessors, (20999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16812 states to 16812 states and 20999 transitions. [2023-12-25 09:23:07,554 INFO L78 Accepts]: Start accepts. Automaton has 16812 states and 20999 transitions. Word has length 73 [2023-12-25 09:23:07,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:07,554 INFO L495 AbstractCegarLoop]: Abstraction has 16812 states and 20999 transitions. [2023-12-25 09:23:07,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:07,554 INFO L276 IsEmpty]: Start isEmpty. Operand 16812 states and 20999 transitions. [2023-12-25 09:23:07,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-25 09:23:07,558 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:07,558 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 09:23:07,572 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 (28)] Forceful destruction successful, exit code 0 [2023-12-25 09:23:07,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:07,760 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:07,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:07,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1185902139, now seen corresponding path program 1 times [2023-12-25 09:23:07,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:07,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172379223] [2023-12-25 09:23:07,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:07,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:07,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:07,762 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:07,763 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 (29)] Waiting until timeout for monitored process [2023-12-25 09:23:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:07,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:23:07,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:08,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:08,301 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:23:08,516 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:08,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:08,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172379223] [2023-12-25 09:23:08,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172379223] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:23:08,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:23:08,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 09:23:08,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877988402] [2023-12-25 09:23:08,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:23:08,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:23:08,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:08,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:23:08,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:23:08,517 INFO L87 Difference]: Start difference. First operand 16812 states and 20999 transitions. Second operand has 16 states, 16 states have (on average 10.8125) internal successors, (173), 15 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:10,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:10,030 INFO L93 Difference]: Finished difference Result 45723 states and 56983 transitions. [2023-12-25 09:23:10,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-25 09:23:10,030 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.8125) internal successors, (173), 15 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2023-12-25 09:23:10,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:10,058 INFO L225 Difference]: With dead ends: 45723 [2023-12-25 09:23:10,058 INFO L226 Difference]: Without dead ends: 29231 [2023-12-25 09:23:10,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=441, Invalid=1041, Unknown=0, NotChecked=0, Total=1482 [2023-12-25 09:23:10,072 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 1707 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1707 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:10,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1707 Valid, 1299 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 09:23:10,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29231 states. [2023-12-25 09:23:10,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29231 to 18875. [2023-12-25 09:23:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18875 states, 18874 states have (on average 1.2427678287591395) internal successors, (23456), 18874 states have internal predecessors, (23456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:10,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18875 states to 18875 states and 23456 transitions. [2023-12-25 09:23:10,264 INFO L78 Accepts]: Start accepts. Automaton has 18875 states and 23456 transitions. Word has length 91 [2023-12-25 09:23:10,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:10,264 INFO L495 AbstractCegarLoop]: Abstraction has 18875 states and 23456 transitions. [2023-12-25 09:23:10,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.8125) internal successors, (173), 15 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:10,264 INFO L276 IsEmpty]: Start isEmpty. Operand 18875 states and 23456 transitions. [2023-12-25 09:23:10,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-25 09:23:10,268 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:10,268 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 09:23:10,273 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 (29)] Forceful destruction successful, exit code 0 [2023-12-25 09:23:10,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:10,470 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:10,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:10,471 INFO L85 PathProgramCache]: Analyzing trace with hash 560481407, now seen corresponding path program 1 times [2023-12-25 09:23:10,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:10,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335503439] [2023-12-25 09:23:10,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:10,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:10,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:10,472 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:10,473 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 (30)] Waiting until timeout for monitored process [2023-12-25 09:23:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:10,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:23:10,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:11,027 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:23:11,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:11,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335503439] [2023-12-25 09:23:11,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335503439] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:23:11,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:23:11,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 09:23:11,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411255919] [2023-12-25 09:23:11,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:23:11,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:23:11,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:11,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:23:11,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:23:11,029 INFO L87 Difference]: Start difference. First operand 18875 states and 23456 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:12,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:12,012 INFO L93 Difference]: Finished difference Result 27815 states and 34495 transitions. [2023-12-25 09:23:12,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 09:23:12,013 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2023-12-25 09:23:12,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:12,032 INFO L225 Difference]: With dead ends: 27815 [2023-12-25 09:23:12,032 INFO L226 Difference]: Without dead ends: 20649 [2023-12-25 09:23:12,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2023-12-25 09:23:12,041 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 662 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:12,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 825 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 09:23:12,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20649 states. [2023-12-25 09:23:12,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20649 to 18875. [2023-12-25 09:23:12,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18875 states, 18874 states have (on average 1.2394828865105436) internal successors, (23394), 18874 states have internal predecessors, (23394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:12,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18875 states to 18875 states and 23394 transitions. [2023-12-25 09:23:12,310 INFO L78 Accepts]: Start accepts. Automaton has 18875 states and 23394 transitions. Word has length 91 [2023-12-25 09:23:12,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:12,310 INFO L495 AbstractCegarLoop]: Abstraction has 18875 states and 23394 transitions. [2023-12-25 09:23:12,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:12,311 INFO L276 IsEmpty]: Start isEmpty. Operand 18875 states and 23394 transitions. [2023-12-25 09:23:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-25 09:23:12,314 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:12,314 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 09:23:12,316 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 (30)] Forceful destruction successful, exit code 0 [2023-12-25 09:23:12,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:12,516 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:12,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:12,517 INFO L85 PathProgramCache]: Analyzing trace with hash 997528935, now seen corresponding path program 1 times [2023-12-25 09:23:12,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:12,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642531667] [2023-12-25 09:23:12,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:12,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:12,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:12,518 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:12,519 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 (31)] Waiting until timeout for monitored process [2023-12-25 09:23:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:12,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:23:12,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:12,622 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:12,622 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:23:12,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:12,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642531667] [2023-12-25 09:23:12,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642531667] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:23:12,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:23:12,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:23:12,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683588949] [2023-12-25 09:23:12,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:23:12,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:23:12,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:12,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:23:12,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:23:12,623 INFO L87 Difference]: Start difference. First operand 18875 states and 23394 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:12,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:12,692 INFO L93 Difference]: Finished difference Result 37432 states and 46453 transitions. [2023-12-25 09:23:12,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:23:12,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2023-12-25 09:23:12,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:12,709 INFO L225 Difference]: With dead ends: 37432 [2023-12-25 09:23:12,709 INFO L226 Difference]: Without dead ends: 18877 [2023-12-25 09:23:12,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 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-25 09:23:12,722 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 84 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:12,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 305 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:23:12,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18877 states. [2023-12-25 09:23:12,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18877 to 18030. [2023-12-25 09:23:12,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18030 states, 18029 states have (on average 1.217427477952188) internal successors, (21949), 18029 states have internal predecessors, (21949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:12,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18030 states to 18030 states and 21949 transitions. [2023-12-25 09:23:12,868 INFO L78 Accepts]: Start accepts. Automaton has 18030 states and 21949 transitions. Word has length 92 [2023-12-25 09:23:12,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:12,869 INFO L495 AbstractCegarLoop]: Abstraction has 18030 states and 21949 transitions. [2023-12-25 09:23:12,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:12,869 INFO L276 IsEmpty]: Start isEmpty. Operand 18030 states and 21949 transitions. [2023-12-25 09:23:12,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-25 09:23:12,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:12,892 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 09:23:12,897 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 (31)] Forceful destruction successful, exit code 0 [2023-12-25 09:23:13,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:13,095 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:13,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:13,095 INFO L85 PathProgramCache]: Analyzing trace with hash 32256659, now seen corresponding path program 1 times [2023-12-25 09:23:13,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:13,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334394348] [2023-12-25 09:23:13,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:13,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:13,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:13,103 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:13,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-12-25 09:23:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:13,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:23:13,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:13,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:13,266 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:23:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:13,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:13,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334394348] [2023-12-25 09:23:13,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334394348] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:23:13,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:23:13,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-25 09:23:13,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591646123] [2023-12-25 09:23:13,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:23:13,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 09:23:13,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:13,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 09:23:13,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-25 09:23:13,374 INFO L87 Difference]: Start difference. First operand 18030 states and 21949 transitions. Second operand has 8 states, 8 states have (on average 22.25) internal successors, (178), 8 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:13,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:13,494 INFO L93 Difference]: Finished difference Result 50160 states and 61486 transitions. [2023-12-25 09:23:13,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 09:23:13,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.25) internal successors, (178), 8 states have internal predecessors, (178), 0 states have call successors, (0), 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 92 [2023-12-25 09:23:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:13,535 INFO L225 Difference]: With dead ends: 50160 [2023-12-25 09:23:13,535 INFO L226 Difference]: Without dead ends: 36852 [2023-12-25 09:23:13,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-25 09:23:13,563 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 232 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:13,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 840 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:23:13,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36852 states. [2023-12-25 09:23:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36852 to 29388. [2023-12-25 09:23:13,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29388 states, 29387 states have (on average 1.2047844284887876) internal successors, (35405), 29387 states have internal predecessors, (35405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29388 states to 29388 states and 35405 transitions. [2023-12-25 09:23:13,927 INFO L78 Accepts]: Start accepts. Automaton has 29388 states and 35405 transitions. Word has length 92 [2023-12-25 09:23:13,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:13,927 INFO L495 AbstractCegarLoop]: Abstraction has 29388 states and 35405 transitions. [2023-12-25 09:23:13,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.25) internal successors, (178), 8 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:13,927 INFO L276 IsEmpty]: Start isEmpty. Operand 29388 states and 35405 transitions. [2023-12-25 09:23:13,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-25 09:23:13,931 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:13,931 INFO L195 NwaCegarLoop]: trace histogram [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-25 09:23:13,935 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 (32)] Forceful destruction successful, exit code 0 [2023-12-25 09:23:14,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:14,134 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:14,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:14,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1460878145, now seen corresponding path program 1 times [2023-12-25 09:23:14,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:14,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308143072] [2023-12-25 09:23:14,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:14,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:14,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:14,135 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:14,136 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 (33)] Waiting until timeout for monitored process [2023-12-25 09:23:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:14,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:23:14,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:14,230 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:23:14,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:14,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308143072] [2023-12-25 09:23:14,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308143072] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:23:14,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:23:14,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:23:14,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328839286] [2023-12-25 09:23:14,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:23:14,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:23:14,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:14,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:23:14,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:23:14,232 INFO L87 Difference]: Start difference. First operand 29388 states and 35405 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:14,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:14,311 INFO L93 Difference]: Finished difference Result 40982 states and 49338 transitions. [2023-12-25 09:23:14,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:23:14,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2023-12-25 09:23:14,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:14,322 INFO L225 Difference]: With dead ends: 40982 [2023-12-25 09:23:14,322 INFO L226 Difference]: Without dead ends: 11914 [2023-12-25 09:23:14,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 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-25 09:23:14,335 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 73 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:14,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 284 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:23:14,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11914 states. [2023-12-25 09:23:14,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11914 to 11912. [2023-12-25 09:23:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11912 states, 11911 states have (on average 1.1773990429015195) internal successors, (14024), 11911 states have internal predecessors, (14024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11912 states to 11912 states and 14024 transitions. [2023-12-25 09:23:14,520 INFO L78 Accepts]: Start accepts. Automaton has 11912 states and 14024 transitions. Word has length 99 [2023-12-25 09:23:14,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:14,520 INFO L495 AbstractCegarLoop]: Abstraction has 11912 states and 14024 transitions. [2023-12-25 09:23:14,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand 11912 states and 14024 transitions. [2023-12-25 09:23:14,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-25 09:23:14,523 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:14,523 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2023-12-25 09:23:14,527 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 (33)] Forceful destruction successful, exit code 0 [2023-12-25 09:23:14,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:14,726 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:14,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:14,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1810696450, now seen corresponding path program 1 times [2023-12-25 09:23:14,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:14,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911334025] [2023-12-25 09:23:14,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:14,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:14,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:14,727 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:14,739 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 (34)] Waiting until timeout for monitored process [2023-12-25 09:23:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:14,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 09:23:14,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:14,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:14,960 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:23:14,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:14,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911334025] [2023-12-25 09:23:14,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911334025] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:23:14,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:23:14,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:23:14,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673464391] [2023-12-25 09:23:14,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:23:14,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 09:23:14,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:14,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 09:23:14,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-25 09:23:14,961 INFO L87 Difference]: Start difference. First operand 11912 states and 14024 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:15,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:15,128 INFO L93 Difference]: Finished difference Result 18526 states and 21849 transitions. [2023-12-25 09:23:15,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 09:23:15,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2023-12-25 09:23:15,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:15,140 INFO L225 Difference]: With dead ends: 18526 [2023-12-25 09:23:15,140 INFO L226 Difference]: Without dead ends: 13771 [2023-12-25 09:23:15,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-12-25 09:23:15,145 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 399 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:15,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 302 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:23:15,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13771 states. [2023-12-25 09:23:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13771 to 12520. [2023-12-25 09:23:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12520 states, 12519 states have (on average 1.1742151929067817) internal successors, (14700), 12519 states have internal predecessors, (14700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:15,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12520 states to 12520 states and 14700 transitions. [2023-12-25 09:23:15,312 INFO L78 Accepts]: Start accepts. Automaton has 12520 states and 14700 transitions. Word has length 102 [2023-12-25 09:23:15,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:15,312 INFO L495 AbstractCegarLoop]: Abstraction has 12520 states and 14700 transitions. [2023-12-25 09:23:15,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:15,312 INFO L276 IsEmpty]: Start isEmpty. Operand 12520 states and 14700 transitions. [2023-12-25 09:23:15,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-25 09:23:15,315 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:15,315 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2023-12-25 09:23:15,320 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 (34)] Forceful destruction successful, exit code 0 [2023-12-25 09:23:15,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:15,518 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:15,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:15,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1643692084, now seen corresponding path program 1 times [2023-12-25 09:23:15,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:15,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748772490] [2023-12-25 09:23:15,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:15,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:15,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:15,520 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:15,522 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 (35)] Waiting until timeout for monitored process [2023-12-25 09:23:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:15,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 09:23:15,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:15,763 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:23:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:15,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:15,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748772490] [2023-12-25 09:23:15,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748772490] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:23:15,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:23:15,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 09:23:15,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406240836] [2023-12-25 09:23:15,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:23:15,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:23:15,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:15,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:23:15,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:23:15,816 INFO L87 Difference]: Start difference. First operand 12520 states and 14700 transitions. Second operand has 9 states, 9 states have (on average 20.77777777777778) internal successors, (187), 9 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:16,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:16,015 INFO L93 Difference]: Finished difference Result 23310 states and 27276 transitions. [2023-12-25 09:23:16,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 09:23:16,016 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.77777777777778) internal successors, (187), 9 states have internal predecessors, (187), 0 states have call successors, (0), 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-25 09:23:16,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:16,028 INFO L225 Difference]: With dead ends: 23310 [2023-12-25 09:23:16,028 INFO L226 Difference]: Without dead ends: 12547 [2023-12-25 09:23:16,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-25 09:23:16,036 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 1255 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:16,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 307 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:23:16,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12547 states. [2023-12-25 09:23:16,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12547 to 11549. [2023-12-25 09:23:16,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11549 states, 11548 states have (on average 1.1578628333910634) internal successors, (13371), 11548 states have internal predecessors, (13371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11549 states to 11549 states and 13371 transitions. [2023-12-25 09:23:16,139 INFO L78 Accepts]: Start accepts. Automaton has 11549 states and 13371 transitions. Word has length 102 [2023-12-25 09:23:16,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:16,139 INFO L495 AbstractCegarLoop]: Abstraction has 11549 states and 13371 transitions. [2023-12-25 09:23:16,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.77777777777778) internal successors, (187), 9 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:16,139 INFO L276 IsEmpty]: Start isEmpty. Operand 11549 states and 13371 transitions. [2023-12-25 09:23:16,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-25 09:23:16,142 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:16,142 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2023-12-25 09:23:16,144 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 (35)] Forceful destruction successful, exit code 0 [2023-12-25 09:23:16,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:16,345 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:16,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:16,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1920889375, now seen corresponding path program 1 times [2023-12-25 09:23:16,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:16,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315141814] [2023-12-25 09:23:16,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:16,347 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:16,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:16,348 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:16,349 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 (36)] Waiting until timeout for monitored process [2023-12-25 09:23:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:16,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:23:16,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:17,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:23:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:17,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:17,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315141814] [2023-12-25 09:23:17,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315141814] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:23:17,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:23:17,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 09:23:17,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437353428] [2023-12-25 09:23:17,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:23:17,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:23:17,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:17,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:23:17,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:23:17,201 INFO L87 Difference]: Start difference. First operand 11549 states and 13371 transitions. Second operand has 16 states, 16 states have (on average 12.0) internal successors, (192), 15 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:17,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:17,887 INFO L93 Difference]: Finished difference Result 21531 states and 24882 transitions. [2023-12-25 09:23:17,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 09:23:17,888 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.0) internal successors, (192), 15 states have internal predecessors, (192), 0 states have call successors, (0), 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-25 09:23:17,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:17,898 INFO L225 Difference]: With dead ends: 21531 [2023-12-25 09:23:17,898 INFO L226 Difference]: Without dead ends: 12460 [2023-12-25 09:23:17,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2023-12-25 09:23:17,904 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 1451 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1451 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:17,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1451 Valid, 966 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 09:23:17,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12460 states. [2023-12-25 09:23:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12460 to 11402. [2023-12-25 09:23:17,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11402 states, 11401 states have (on average 1.1552495395140776) internal successors, (13171), 11401 states have internal predecessors, (13171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11402 states to 11402 states and 13171 transitions. [2023-12-25 09:23:17,987 INFO L78 Accepts]: Start accepts. Automaton has 11402 states and 13171 transitions. Word has length 103 [2023-12-25 09:23:17,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:17,988 INFO L495 AbstractCegarLoop]: Abstraction has 11402 states and 13171 transitions. [2023-12-25 09:23:17,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.0) internal successors, (192), 15 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:17,988 INFO L276 IsEmpty]: Start isEmpty. Operand 11402 states and 13171 transitions. [2023-12-25 09:23:17,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-25 09:23:17,990 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:17,991 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2023-12-25 09:23:17,993 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 (36)] Ended with exit code 0 [2023-12-25 09:23:18,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:18,193 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:18,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:18,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1608016669, now seen corresponding path program 1 times [2023-12-25 09:23:18,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:18,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665228505] [2023-12-25 09:23:18,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:18,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:18,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:18,195 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:18,196 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 (37)] Waiting until timeout for monitored process [2023-12-25 09:23:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:18,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 09:23:18,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:18,451 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:23:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:18,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:18,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665228505] [2023-12-25 09:23:18,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665228505] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:23:18,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:23:18,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 09:23:18,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919428129] [2023-12-25 09:23:18,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:23:18,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:23:18,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:18,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:23:18,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:23:18,516 INFO L87 Difference]: Start difference. First operand 11402 states and 13171 transitions. Second operand has 9 states, 9 states have (on average 22.0) internal successors, (198), 9 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:18,717 INFO L93 Difference]: Finished difference Result 27016 states and 31077 transitions. [2023-12-25 09:23:18,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 09:23:18,718 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 22.0) internal successors, (198), 9 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2023-12-25 09:23:18,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:18,733 INFO L225 Difference]: With dead ends: 27016 [2023-12-25 09:23:18,733 INFO L226 Difference]: Without dead ends: 17287 [2023-12-25 09:23:18,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-25 09:23:18,741 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 1022 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:18,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 462 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:23:18,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17287 states. [2023-12-25 09:23:18,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17287 to 12192. [2023-12-25 09:23:18,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12192 states, 12191 states have (on average 1.1504388483307357) internal successors, (14025), 12191 states have internal predecessors, (14025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12192 states to 12192 states and 14025 transitions. [2023-12-25 09:23:18,878 INFO L78 Accepts]: Start accepts. Automaton has 12192 states and 14025 transitions. Word has length 104 [2023-12-25 09:23:18,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:18,878 INFO L495 AbstractCegarLoop]: Abstraction has 12192 states and 14025 transitions. [2023-12-25 09:23:18,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.0) internal successors, (198), 9 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:18,878 INFO L276 IsEmpty]: Start isEmpty. Operand 12192 states and 14025 transitions. [2023-12-25 09:23:18,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-25 09:23:18,881 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:18,881 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:23:18,886 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 (37)] Forceful destruction successful, exit code 0 [2023-12-25 09:23:19,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:19,084 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:19,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:19,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1758065987, now seen corresponding path program 1 times [2023-12-25 09:23:19,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:19,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212197083] [2023-12-25 09:23:19,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:19,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:19,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:19,086 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:19,086 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 (38)] Waiting until timeout for monitored process [2023-12-25 09:23:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:19,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:23:19,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:19,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:23:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:20,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:20,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212197083] [2023-12-25 09:23:20,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212197083] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:23:20,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:23:20,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2023-12-25 09:23:20,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555918148] [2023-12-25 09:23:20,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:23:20,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 09:23:20,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:20,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 09:23:20,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2023-12-25 09:23:20,156 INFO L87 Difference]: Start difference. First operand 12192 states and 14025 transitions. Second operand has 23 states, 23 states have (on average 8.652173913043478) internal successors, (199), 23 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:22,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:22,473 INFO L93 Difference]: Finished difference Result 30146 states and 34476 transitions. [2023-12-25 09:23:22,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-25 09:23:22,475 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.652173913043478) internal successors, (199), 23 states have internal predecessors, (199), 0 states have call successors, (0), 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 107 [2023-12-25 09:23:22,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:22,502 INFO L225 Difference]: With dead ends: 30146 [2023-12-25 09:23:22,502 INFO L226 Difference]: Without dead ends: 27182 [2023-12-25 09:23:22,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=633, Invalid=2447, Unknown=0, NotChecked=0, Total=3080 [2023-12-25 09:23:22,513 INFO L413 NwaCegarLoop]: 353 mSDtfsCounter, 2767 mSDsluCounter, 4362 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2767 SdHoareTripleChecker+Valid, 4715 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:22,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2767 Valid, 4715 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 09:23:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27182 states. [2023-12-25 09:23:22,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27182 to 12415. [2023-12-25 09:23:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12415 states, 12414 states have (on average 1.1494280650878042) internal successors, (14269), 12414 states have internal predecessors, (14269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:22,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12415 states to 12415 states and 14269 transitions. [2023-12-25 09:23:22,742 INFO L78 Accepts]: Start accepts. Automaton has 12415 states and 14269 transitions. Word has length 107 [2023-12-25 09:23:22,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:22,743 INFO L495 AbstractCegarLoop]: Abstraction has 12415 states and 14269 transitions. [2023-12-25 09:23:22,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.652173913043478) internal successors, (199), 23 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:22,743 INFO L276 IsEmpty]: Start isEmpty. Operand 12415 states and 14269 transitions. [2023-12-25 09:23:22,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-25 09:23:22,746 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:22,746 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:23:22,752 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 (38)] Forceful destruction successful, exit code 0 [2023-12-25 09:23:22,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:22,949 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:22,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:22,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1458617163, now seen corresponding path program 1 times [2023-12-25 09:23:22,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:22,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592965173] [2023-12-25 09:23:22,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:22,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:22,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:22,951 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:22,953 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 (39)] Waiting until timeout for monitored process [2023-12-25 09:23:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:23,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:23:23,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:23,664 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:23:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:23,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:23,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592965173] [2023-12-25 09:23:23,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592965173] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:23:23,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:23:23,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2023-12-25 09:23:23,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346157824] [2023-12-25 09:23:23,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:23:23,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 09:23:23,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:23,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 09:23:23,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2023-12-25 09:23:23,949 INFO L87 Difference]: Start difference. First operand 12415 states and 14269 transitions. Second operand has 23 states, 23 states have (on average 8.652173913043478) internal successors, (199), 23 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:25,917 INFO L93 Difference]: Finished difference Result 27926 states and 31964 transitions. [2023-12-25 09:23:25,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-25 09:23:25,918 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.652173913043478) internal successors, (199), 23 states have internal predecessors, (199), 0 states have call successors, (0), 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 107 [2023-12-25 09:23:25,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:25,947 INFO L225 Difference]: With dead ends: 27926 [2023-12-25 09:23:25,947 INFO L226 Difference]: Without dead ends: 24979 [2023-12-25 09:23:25,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=637, Invalid=2443, Unknown=0, NotChecked=0, Total=3080 [2023-12-25 09:23:25,955 INFO L413 NwaCegarLoop]: 469 mSDtfsCounter, 2135 mSDsluCounter, 5136 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2135 SdHoareTripleChecker+Valid, 5605 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:25,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2135 Valid, 5605 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 09:23:25,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24979 states. [2023-12-25 09:23:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24979 to 12403. [2023-12-25 09:23:26,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12403 states, 12402 states have (on average 1.1483631672310917) internal successors, (14242), 12402 states have internal predecessors, (14242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:26,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12403 states to 12403 states and 14242 transitions. [2023-12-25 09:23:26,093 INFO L78 Accepts]: Start accepts. Automaton has 12403 states and 14242 transitions. Word has length 107 [2023-12-25 09:23:26,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:26,093 INFO L495 AbstractCegarLoop]: Abstraction has 12403 states and 14242 transitions. [2023-12-25 09:23:26,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.652173913043478) internal successors, (199), 23 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:26,093 INFO L276 IsEmpty]: Start isEmpty. Operand 12403 states and 14242 transitions. [2023-12-25 09:23:26,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-25 09:23:26,096 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:26,096 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:23:26,101 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 (39)] Forceful destruction successful, exit code 0 [2023-12-25 09:23:26,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:26,299 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:26,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:26,299 INFO L85 PathProgramCache]: Analyzing trace with hash 22610865, now seen corresponding path program 1 times [2023-12-25 09:23:26,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:26,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852286877] [2023-12-25 09:23:26,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:26,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:26,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:26,300 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:26,302 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 (40)] Waiting until timeout for monitored process [2023-12-25 09:23:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:26,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:23:26,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 09:23:26,833 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:23:26,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:26,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852286877] [2023-12-25 09:23:26,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852286877] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:23:26,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:23:26,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-25 09:23:26,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181356043] [2023-12-25 09:23:26,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:23:26,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 09:23:26,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:26,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 09:23:26,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-25 09:23:26,835 INFO L87 Difference]: Start difference. First operand 12403 states and 14242 transitions. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:27,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:27,768 INFO L93 Difference]: Finished difference Result 24646 states and 28430 transitions. [2023-12-25 09:23:27,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 09:23:27,768 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 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 107 [2023-12-25 09:23:27,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:27,785 INFO L225 Difference]: With dead ends: 24646 [2023-12-25 09:23:27,785 INFO L226 Difference]: Without dead ends: 18242 [2023-12-25 09:23:27,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-12-25 09:23:27,792 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 1076 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:27,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 878 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 09:23:27,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18242 states. [2023-12-25 09:23:27,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18242 to 12159. [2023-12-25 09:23:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12159 states, 12158 states have (on average 1.147310412896858) internal successors, (13949), 12158 states have internal predecessors, (13949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:27,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12159 states to 12159 states and 13949 transitions. [2023-12-25 09:23:27,910 INFO L78 Accepts]: Start accepts. Automaton has 12159 states and 13949 transitions. Word has length 107 [2023-12-25 09:23:27,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:27,910 INFO L495 AbstractCegarLoop]: Abstraction has 12159 states and 13949 transitions. [2023-12-25 09:23:27,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:27,910 INFO L276 IsEmpty]: Start isEmpty. Operand 12159 states and 13949 transitions. [2023-12-25 09:23:27,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-25 09:23:27,913 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:27,913 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:23:27,916 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 (40)] Ended with exit code 0 [2023-12-25 09:23:28,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:28,116 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:28,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:28,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1681832278, now seen corresponding path program 1 times [2023-12-25 09:23:28,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:28,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415501872] [2023-12-25 09:23:28,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:28,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:28,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:28,118 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:28,143 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 (41)] Waiting until timeout for monitored process [2023-12-25 09:23:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:28,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:23:28,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:28,797 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:23:28,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:28,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415501872] [2023-12-25 09:23:28,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415501872] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:23:28,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:23:28,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-25 09:23:28,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868074901] [2023-12-25 09:23:28,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:23:28,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 09:23:28,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:28,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 09:23:28,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-25 09:23:28,799 INFO L87 Difference]: Start difference. First operand 12159 states and 13949 transitions. Second operand has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:29,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:29,803 INFO L93 Difference]: Finished difference Result 23562 states and 27255 transitions. [2023-12-25 09:23:29,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 09:23:29,803 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2023-12-25 09:23:29,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:29,821 INFO L225 Difference]: With dead ends: 23562 [2023-12-25 09:23:29,822 INFO L226 Difference]: Without dead ends: 21469 [2023-12-25 09:23:29,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2023-12-25 09:23:29,828 INFO L413 NwaCegarLoop]: 365 mSDtfsCounter, 905 mSDsluCounter, 2661 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 3026 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:29,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 3026 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 09:23:29,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21469 states. [2023-12-25 09:23:29,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21469 to 13332. [2023-12-25 09:23:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13332 states, 13331 states have (on average 1.147550821393744) internal successors, (15298), 13331 states have internal predecessors, (15298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13332 states to 13332 states and 15298 transitions. [2023-12-25 09:23:29,976 INFO L78 Accepts]: Start accepts. Automaton has 13332 states and 15298 transitions. Word has length 107 [2023-12-25 09:23:29,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:29,976 INFO L495 AbstractCegarLoop]: Abstraction has 13332 states and 15298 transitions. [2023-12-25 09:23:29,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:29,976 INFO L276 IsEmpty]: Start isEmpty. Operand 13332 states and 15298 transitions. [2023-12-25 09:23:29,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-25 09:23:29,980 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:29,980 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:23:29,985 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 (41)] Forceful destruction successful, exit code 0 [2023-12-25 09:23:30,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:30,183 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:30,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:30,183 INFO L85 PathProgramCache]: Analyzing trace with hash -609061082, now seen corresponding path program 1 times [2023-12-25 09:23:30,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:30,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024831813] [2023-12-25 09:23:30,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:30,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:30,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:30,185 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:30,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-12-25 09:23:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:30,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:23:30,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:30,862 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:23:30,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:30,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024831813] [2023-12-25 09:23:30,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024831813] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:23:30,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:23:30,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-25 09:23:30,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129590415] [2023-12-25 09:23:30,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:23:30,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 09:23:30,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:30,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 09:23:30,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-25 09:23:30,864 INFO L87 Difference]: Start difference. First operand 13332 states and 15298 transitions. Second operand has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:32,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:32,106 INFO L93 Difference]: Finished difference Result 26749 states and 30808 transitions. [2023-12-25 09:23:32,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 09:23:32,107 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2023-12-25 09:23:32,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:32,130 INFO L225 Difference]: With dead ends: 26749 [2023-12-25 09:23:32,130 INFO L226 Difference]: Without dead ends: 23908 [2023-12-25 09:23:32,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2023-12-25 09:23:32,139 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 937 mSDsluCounter, 2877 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 3235 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:32,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 3235 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 09:23:32,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23908 states. [2023-12-25 09:23:32,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23908 to 14952. [2023-12-25 09:23:32,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14952 states, 14951 states have (on average 1.144471941676142) internal successors, (17111), 14951 states have internal predecessors, (17111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:32,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14952 states to 14952 states and 17111 transitions. [2023-12-25 09:23:32,294 INFO L78 Accepts]: Start accepts. Automaton has 14952 states and 17111 transitions. Word has length 107 [2023-12-25 09:23:32,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:32,294 INFO L495 AbstractCegarLoop]: Abstraction has 14952 states and 17111 transitions. [2023-12-25 09:23:32,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:32,295 INFO L276 IsEmpty]: Start isEmpty. Operand 14952 states and 17111 transitions. [2023-12-25 09:23:32,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-25 09:23:32,297 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:32,297 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:23:32,302 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 (42)] Forceful destruction successful, exit code 0 [2023-12-25 09:23:32,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:32,500 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:32,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:32,501 INFO L85 PathProgramCache]: Analyzing trace with hash -499047898, now seen corresponding path program 1 times [2023-12-25 09:23:32,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:32,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331053962] [2023-12-25 09:23:32,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:32,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:32,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:32,502 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:32,505 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 (43)] Waiting until timeout for monitored process [2023-12-25 09:23:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:32,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:23:32,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 09:23:33,002 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:23:33,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:33,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331053962] [2023-12-25 09:23:33,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331053962] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:23:33,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:23:33,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-25 09:23:33,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506944580] [2023-12-25 09:23:33,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:23:33,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 09:23:33,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:33,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 09:23:33,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-25 09:23:33,003 INFO L87 Difference]: Start difference. First operand 14952 states and 17111 transitions. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:33,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:33,534 INFO L93 Difference]: Finished difference Result 18636 states and 21357 transitions. [2023-12-25 09:23:33,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 09:23:33,535 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 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 108 [2023-12-25 09:23:33,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:33,548 INFO L225 Difference]: With dead ends: 18636 [2023-12-25 09:23:33,548 INFO L226 Difference]: Without dead ends: 17191 [2023-12-25 09:23:33,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2023-12-25 09:23:33,553 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 994 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:33,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 1303 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 09:23:33,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17191 states. [2023-12-25 09:23:33,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17191 to 14805. [2023-12-25 09:23:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14805 states, 14804 states have (on average 1.1450283707106188) internal successors, (16951), 14804 states have internal predecessors, (16951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:33,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14805 states to 14805 states and 16951 transitions. [2023-12-25 09:23:33,669 INFO L78 Accepts]: Start accepts. Automaton has 14805 states and 16951 transitions. Word has length 108 [2023-12-25 09:23:33,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:33,670 INFO L495 AbstractCegarLoop]: Abstraction has 14805 states and 16951 transitions. [2023-12-25 09:23:33,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:33,670 INFO L276 IsEmpty]: Start isEmpty. Operand 14805 states and 16951 transitions. [2023-12-25 09:23:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-25 09:23:33,672 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:33,672 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:23:33,675 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 (43)] Forceful destruction successful, exit code 0 [2023-12-25 09:23:33,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:33,875 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:33,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:33,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2006664999, now seen corresponding path program 1 times [2023-12-25 09:23:33,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:33,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976868482] [2023-12-25 09:23:33,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:33,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:33,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:33,877 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:33,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2023-12-25 09:23:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:33,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:23:33,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:34,215 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 09:23:34,215 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:23:34,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:34,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976868482] [2023-12-25 09:23:34,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976868482] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:23:34,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:23:34,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-25 09:23:34,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126976810] [2023-12-25 09:23:34,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:23:34,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 09:23:34,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:34,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 09:23:34,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-25 09:23:34,216 INFO L87 Difference]: Start difference. First operand 14805 states and 16951 transitions. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:34,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:34,652 INFO L93 Difference]: Finished difference Result 26154 states and 30072 transitions. [2023-12-25 09:23:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 09:23:34,652 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 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 108 [2023-12-25 09:23:34,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:34,669 INFO L225 Difference]: With dead ends: 26154 [2023-12-25 09:23:34,669 INFO L226 Difference]: Without dead ends: 19075 [2023-12-25 09:23:34,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:23:34,677 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 970 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:34,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 1297 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:23:34,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19075 states. [2023-12-25 09:23:34,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19075 to 11451. [2023-12-25 09:23:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11451 states, 11450 states have (on average 1.1417467248908297) internal successors, (13073), 11450 states have internal predecessors, (13073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:34,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11451 states to 11451 states and 13073 transitions. [2023-12-25 09:23:34,785 INFO L78 Accepts]: Start accepts. Automaton has 11451 states and 13073 transitions. Word has length 108 [2023-12-25 09:23:34,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:34,785 INFO L495 AbstractCegarLoop]: Abstraction has 11451 states and 13073 transitions. [2023-12-25 09:23:34,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:34,785 INFO L276 IsEmpty]: Start isEmpty. Operand 11451 states and 13073 transitions. [2023-12-25 09:23:34,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-25 09:23:34,787 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:34,787 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:23:34,791 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 (44)] Ended with exit code 0 [2023-12-25 09:23:34,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:34,990 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:34,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:34,990 INFO L85 PathProgramCache]: Analyzing trace with hash 320485161, now seen corresponding path program 1 times [2023-12-25 09:23:34,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:34,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511834852] [2023-12-25 09:23:34,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:34,991 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:34,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:34,992 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:34,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2023-12-25 09:23:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:35,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 09:23:35,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:35,251 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:35,251 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:23:35,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:35,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511834852] [2023-12-25 09:23:35,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511834852] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:23:35,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:23:35,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-25 09:23:35,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977452696] [2023-12-25 09:23:35,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:23:35,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 09:23:35,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:35,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 09:23:35,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-12-25 09:23:35,252 INFO L87 Difference]: Start difference. First operand 11451 states and 13073 transitions. Second operand has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:35,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:35,655 INFO L93 Difference]: Finished difference Result 19391 states and 22206 transitions. [2023-12-25 09:23:35,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 09:23:35,656 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2023-12-25 09:23:35,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:35,671 INFO L225 Difference]: With dead ends: 19391 [2023-12-25 09:23:35,671 INFO L226 Difference]: Without dead ends: 16908 [2023-12-25 09:23:35,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2023-12-25 09:23:35,678 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 512 mSDsluCounter, 2484 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 2816 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:35,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 2816 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:23:35,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16908 states. [2023-12-25 09:23:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16908 to 14063. [2023-12-25 09:23:35,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14063 states, 14062 states have (on average 1.1386715972123453) internal successors, (16012), 14062 states have internal predecessors, (16012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:35,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14063 states to 14063 states and 16012 transitions. [2023-12-25 09:23:35,853 INFO L78 Accepts]: Start accepts. Automaton has 14063 states and 16012 transitions. Word has length 108 [2023-12-25 09:23:35,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:35,854 INFO L495 AbstractCegarLoop]: Abstraction has 14063 states and 16012 transitions. [2023-12-25 09:23:35,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:35,854 INFO L276 IsEmpty]: Start isEmpty. Operand 14063 states and 16012 transitions. [2023-12-25 09:23:35,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-25 09:23:35,856 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:35,856 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:23:35,859 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 (45)] Forceful destruction successful, exit code 0 [2023-12-25 09:23:36,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:36,059 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:36,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:36,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1286577601, now seen corresponding path program 1 times [2023-12-25 09:23:36,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:36,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343812859] [2023-12-25 09:23:36,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:36,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:36,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:36,061 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:36,063 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 (46)] Waiting until timeout for monitored process [2023-12-25 09:23:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:36,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-25 09:23:36,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:38,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:23:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:39,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:39,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343812859] [2023-12-25 09:23:39,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1343812859] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:23:39,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:23:39,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20] total 43 [2023-12-25 09:23:39,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993758493] [2023-12-25 09:23:39,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:23:39,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-25 09:23:39,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:39,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-25 09:23:39,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1598, Unknown=0, NotChecked=0, Total=1806 [2023-12-25 09:23:39,751 INFO L87 Difference]: Start difference. First operand 14063 states and 16012 transitions. Second operand has 43 states, 43 states have (on average 4.976744186046512) internal successors, (214), 43 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:26:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:26:39,766 INFO L93 Difference]: Finished difference Result 77314 states and 86874 transitions. [2023-12-25 09:26:39,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 602 states. [2023-12-25 09:26:39,766 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 4.976744186046512) internal successors, (214), 43 states have internal predecessors, (214), 0 states have call successors, (0), 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 112 [2023-12-25 09:26:39,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:26:39,835 INFO L225 Difference]: With dead ends: 77314 [2023-12-25 09:26:39,835 INFO L226 Difference]: Without dead ends: 75583 [2023-12-25 09:26:39,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 639 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190459 ImplicationChecksByTransitivity, 162.7s TimeCoverageRelationStatistics Valid=33757, Invalid=376483, Unknown=0, NotChecked=0, Total=410240 [2023-12-25 09:26:39,873 INFO L413 NwaCegarLoop]: 875 mSDtfsCounter, 15197 mSDsluCounter, 16808 mSDsCounter, 0 mSdLazyCounter, 10044 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15197 SdHoareTripleChecker+Valid, 17683 SdHoareTripleChecker+Invalid, 10326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 10044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2023-12-25 09:26:39,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15197 Valid, 17683 Invalid, 10326 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [282 Valid, 10044 Invalid, 0 Unknown, 0 Unchecked, 17.6s Time] [2023-12-25 09:26:39,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75583 states. [2023-12-25 09:26:40,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75583 to 15934. [2023-12-25 09:26:40,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15934 states, 15933 states have (on average 1.13619531789368) internal successors, (18103), 15933 states have internal predecessors, (18103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:26:40,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15934 states to 15934 states and 18103 transitions. [2023-12-25 09:26:40,320 INFO L78 Accepts]: Start accepts. Automaton has 15934 states and 18103 transitions. Word has length 112 [2023-12-25 09:26:40,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:26:40,320 INFO L495 AbstractCegarLoop]: Abstraction has 15934 states and 18103 transitions. [2023-12-25 09:26:40,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.976744186046512) internal successors, (214), 43 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:26:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 15934 states and 18103 transitions. [2023-12-25 09:26:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-25 09:26:40,323 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:26:40,323 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:26:40,327 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 (46)] Ended with exit code 0 [2023-12-25 09:26:40,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:26:40,524 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:26:40,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:26:40,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1566138800, now seen corresponding path program 1 times [2023-12-25 09:26:40,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:26:40,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201175001] [2023-12-25 09:26:40,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:26:40,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:26:40,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:26:40,526 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:26:40,527 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 (47)] Waiting until timeout for monitored process [2023-12-25 09:26:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:26:40,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-25 09:26:40,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:26:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:26:42,563 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:26:42,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:26:42,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201175001] [2023-12-25 09:26:42,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [201175001] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:26:42,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:26:42,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2023-12-25 09:26:42,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855827071] [2023-12-25 09:26:42,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:26:42,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 09:26:42,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:26:42,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 09:26:42,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2023-12-25 09:26:42,564 INFO L87 Difference]: Start difference. First operand 15934 states and 18103 transitions. Second operand has 23 states, 23 states have (on average 4.913043478260869) internal successors, (113), 23 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:26:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:26:57,006 INFO L93 Difference]: Finished difference Result 37594 states and 42626 transitions. [2023-12-25 09:26:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-25 09:26:57,007 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.913043478260869) internal successors, (113), 23 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2023-12-25 09:26:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:26:57,040 INFO L225 Difference]: With dead ends: 37594 [2023-12-25 09:26:57,041 INFO L226 Difference]: Without dead ends: 34390 [2023-12-25 09:26:57,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=432, Invalid=2538, Unknown=0, NotChecked=0, Total=2970 [2023-12-25 09:26:57,052 INFO L413 NwaCegarLoop]: 460 mSDtfsCounter, 1489 mSDsluCounter, 6337 mSDsCounter, 0 mSdLazyCounter, 3507 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 6797 SdHoareTripleChecker+Invalid, 3510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-12-25 09:26:57,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1489 Valid, 6797 Invalid, 3510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3507 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2023-12-25 09:26:57,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34390 states. [2023-12-25 09:26:57,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34390 to 17622. [2023-12-25 09:26:57,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17622 states, 17621 states have (on average 1.1350093638272516) internal successors, (20000), 17621 states have internal predecessors, (20000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:26:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17622 states to 17622 states and 20000 transitions. [2023-12-25 09:26:57,342 INFO L78 Accepts]: Start accepts. Automaton has 17622 states and 20000 transitions. Word has length 113 [2023-12-25 09:26:57,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:26:57,342 INFO L495 AbstractCegarLoop]: Abstraction has 17622 states and 20000 transitions. [2023-12-25 09:26:57,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.913043478260869) internal successors, (113), 23 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:26:57,342 INFO L276 IsEmpty]: Start isEmpty. Operand 17622 states and 20000 transitions. [2023-12-25 09:26:57,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-25 09:26:57,346 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:26:57,346 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:26:57,348 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 (47)] Forceful destruction successful, exit code 0 [2023-12-25 09:26:57,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:26:57,548 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:26:57,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:26:57,549 INFO L85 PathProgramCache]: Analyzing trace with hash -937767464, now seen corresponding path program 1 times [2023-12-25 09:26:57,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:26:57,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306175327] [2023-12-25 09:26:57,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:26:57,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:26:57,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:26:57,550 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:26:57,568 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 (48)] Waiting until timeout for monitored process [2023-12-25 09:26:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:26:57,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-25 09:26:57,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:27:00,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:27:00,295 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:27:00,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:27:00,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306175327] [2023-12-25 09:27:00,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306175327] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:27:00,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:27:00,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2023-12-25 09:27:00,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771158054] [2023-12-25 09:27:00,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:27:00,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-25 09:27:00,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:27:00,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-25 09:27:00,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2023-12-25 09:27:00,297 INFO L87 Difference]: Start difference. First operand 17622 states and 20000 transitions. Second operand has 29 states, 29 states have (on average 3.896551724137931) internal successors, (113), 29 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:08,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:27:08,562 INFO L93 Difference]: Finished difference Result 28266 states and 32029 transitions. [2023-12-25 09:27:08,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-25 09:27:08,562 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.896551724137931) internal successors, (113), 29 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2023-12-25 09:27:08,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:27:08,589 INFO L225 Difference]: With dead ends: 28266 [2023-12-25 09:27:08,589 INFO L226 Difference]: Without dead ends: 27259 [2023-12-25 09:27:08,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=305, Invalid=2047, Unknown=0, NotChecked=0, Total=2352 [2023-12-25 09:27:08,599 INFO L413 NwaCegarLoop]: 399 mSDtfsCounter, 1336 mSDsluCounter, 6904 mSDsCounter, 0 mSdLazyCounter, 4094 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 7303 SdHoareTripleChecker+Invalid, 4097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-12-25 09:27:08,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1336 Valid, 7303 Invalid, 4097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4094 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2023-12-25 09:27:08,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27259 states. [2023-12-25 09:27:08,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27259 to 17607. [2023-12-25 09:27:08,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17607 states, 17606 states have (on average 1.1347835965011928) internal successors, (19979), 17606 states have internal predecessors, (19979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:08,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17607 states to 17607 states and 19979 transitions. [2023-12-25 09:27:08,822 INFO L78 Accepts]: Start accepts. Automaton has 17607 states and 19979 transitions. Word has length 113 [2023-12-25 09:27:08,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:27:08,822 INFO L495 AbstractCegarLoop]: Abstraction has 17607 states and 19979 transitions. [2023-12-25 09:27:08,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.896551724137931) internal successors, (113), 29 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:08,823 INFO L276 IsEmpty]: Start isEmpty. Operand 17607 states and 19979 transitions. [2023-12-25 09:27:08,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-25 09:27:08,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:27:08,825 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:27:08,828 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 (48)] Forceful destruction successful, exit code 0 [2023-12-25 09:27:09,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:27:09,028 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:27:09,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:27:09,028 INFO L85 PathProgramCache]: Analyzing trace with hash -259050060, now seen corresponding path program 1 times [2023-12-25 09:27:09,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:27:09,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085801626] [2023-12-25 09:27:09,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:27:09,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:27:09,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:27:09,030 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:27:09,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2023-12-25 09:27:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:27:09,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:27:09,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:27:09,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:27:09,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:27:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:27:10,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:27:10,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085801626] [2023-12-25 09:27:10,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085801626] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:27:10,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:27:10,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2023-12-25 09:27:10,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999468504] [2023-12-25 09:27:10,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:27:10,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 09:27:10,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:27:10,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 09:27:10,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2023-12-25 09:27:10,144 INFO L87 Difference]: Start difference. First operand 17607 states and 19979 transitions. Second operand has 23 states, 23 states have (on average 9.217391304347826) internal successors, (212), 23 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:14,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:27:14,027 INFO L93 Difference]: Finished difference Result 36730 states and 41216 transitions. [2023-12-25 09:27:14,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-12-25 09:27:14,028 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.217391304347826) internal successors, (212), 23 states have internal predecessors, (212), 0 states have call successors, (0), 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 113 [2023-12-25 09:27:14,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:27:14,059 INFO L225 Difference]: With dead ends: 36730 [2023-12-25 09:27:14,059 INFO L226 Difference]: Without dead ends: 34872 [2023-12-25 09:27:14,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1307, Invalid=3949, Unknown=0, NotChecked=0, Total=5256 [2023-12-25 09:27:14,069 INFO L413 NwaCegarLoop]: 548 mSDtfsCounter, 2065 mSDsluCounter, 5614 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2065 SdHoareTripleChecker+Valid, 6162 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:27:14,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2065 Valid, 6162 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1435 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-25 09:27:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34872 states. [2023-12-25 09:27:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34872 to 20132. [2023-12-25 09:27:14,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20132 states, 20131 states have (on average 1.1300978590233968) internal successors, (22750), 20131 states have internal predecessors, (22750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20132 states to 20132 states and 22750 transitions. [2023-12-25 09:27:14,298 INFO L78 Accepts]: Start accepts. Automaton has 20132 states and 22750 transitions. Word has length 113 [2023-12-25 09:27:14,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:27:14,298 INFO L495 AbstractCegarLoop]: Abstraction has 20132 states and 22750 transitions. [2023-12-25 09:27:14,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.217391304347826) internal successors, (212), 23 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 20132 states and 22750 transitions. [2023-12-25 09:27:14,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-25 09:27:14,301 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:27:14,301 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:27:14,303 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 (49)] Ended with exit code 0 [2023-12-25 09:27:14,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:27:14,503 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:27:14,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:27:14,503 INFO L85 PathProgramCache]: Analyzing trace with hash -977948882, now seen corresponding path program 1 times [2023-12-25 09:27:14,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:27:14,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686949652] [2023-12-25 09:27:14,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:27:14,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:27:14,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:27:14,505 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:27:14,506 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 (50)] Waiting until timeout for monitored process [2023-12-25 09:27:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:27:14,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 09:27:14,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:27:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:27:15,409 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:27:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:27:16,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:27:16,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686949652] [2023-12-25 09:27:16,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686949652] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:27:16,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:27:16,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2023-12-25 09:27:16,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535803820] [2023-12-25 09:27:16,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:27:16,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-25 09:27:16,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:27:16,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-25 09:27:16,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1233, Unknown=0, NotChecked=0, Total=1332 [2023-12-25 09:27:16,190 INFO L87 Difference]: Start difference. First operand 20132 states and 22750 transitions. Second operand has 37 states, 37 states have (on average 5.27027027027027) internal successors, (195), 37 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:50,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:27:50,518 INFO L93 Difference]: Finished difference Result 45643 states and 50840 transitions. [2023-12-25 09:27:50,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 307 states. [2023-12-25 09:27:50,518 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 5.27027027027027) internal successors, (195), 37 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2023-12-25 09:27:50,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:27:50,554 INFO L225 Difference]: With dead ends: 45643 [2023-12-25 09:27:50,554 INFO L226 Difference]: Without dead ends: 45433 [2023-12-25 09:27:50,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 193 SyntacticMatches, 2 SemanticMatches, 331 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 44573 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=9135, Invalid=101421, Unknown=0, NotChecked=0, Total=110556 [2023-12-25 09:27:50,575 INFO L413 NwaCegarLoop]: 921 mSDtfsCounter, 6249 mSDsluCounter, 17157 mSDsCounter, 0 mSdLazyCounter, 7174 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6249 SdHoareTripleChecker+Valid, 18078 SdHoareTripleChecker+Invalid, 7333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 7174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:27:50,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6249 Valid, 18078 Invalid, 7333 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [159 Valid, 7174 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2023-12-25 09:27:50,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45433 states. [2023-12-25 09:27:50,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45433 to 21111. [2023-12-25 09:27:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21111 states, 21110 states have (on average 1.1302226432970157) internal successors, (23859), 21110 states have internal predecessors, (23859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21111 states to 21111 states and 23859 transitions. [2023-12-25 09:27:50,882 INFO L78 Accepts]: Start accepts. Automaton has 21111 states and 23859 transitions. Word has length 115 [2023-12-25 09:27:50,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:27:50,882 INFO L495 AbstractCegarLoop]: Abstraction has 21111 states and 23859 transitions. [2023-12-25 09:27:50,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.27027027027027) internal successors, (195), 37 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:50,882 INFO L276 IsEmpty]: Start isEmpty. Operand 21111 states and 23859 transitions. [2023-12-25 09:27:50,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-25 09:27:50,886 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:27:50,887 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-25 09:27:50,891 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 (50)] Forceful destruction successful, exit code 0 [2023-12-25 09:27:51,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:27:51,089 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:27:51,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:27:51,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1034612321, now seen corresponding path program 1 times [2023-12-25 09:27:51,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:27:51,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211557541] [2023-12-25 09:27:51,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:27:51,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:27:51,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:27:51,092 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:27:51,093 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 (51)] Waiting until timeout for monitored process [2023-12-25 09:27:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:27:51,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 09:27:51,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:27:51,618 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-25 09:27:51,619 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:27:51,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:27:51,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211557541] [2023-12-25 09:27:51,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211557541] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:27:51,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:27:51,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-25 09:27:51,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827085284] [2023-12-25 09:27:51,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:27:51,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 09:27:51,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:27:51,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 09:27:51,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-25 09:27:51,620 INFO L87 Difference]: Start difference. First operand 21111 states and 23859 transitions. Second operand has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:52,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:27:52,524 INFO L93 Difference]: Finished difference Result 31295 states and 35490 transitions. [2023-12-25 09:27:52,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 09:27:52,525 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 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 133 [2023-12-25 09:27:52,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:27:52,546 INFO L225 Difference]: With dead ends: 31295 [2023-12-25 09:27:52,546 INFO L226 Difference]: Without dead ends: 23377 [2023-12-25 09:27:52,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2023-12-25 09:27:52,556 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 1432 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1432 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:27:52,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1432 Valid, 1544 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 09:27:52,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23377 states. [2023-12-25 09:27:52,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23377 to 16969. [2023-12-25 09:27:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16969 states, 16968 states have (on average 1.1254125412541254) internal successors, (19096), 16968 states have internal predecessors, (19096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16969 states to 16969 states and 19096 transitions. [2023-12-25 09:27:52,723 INFO L78 Accepts]: Start accepts. Automaton has 16969 states and 19096 transitions. Word has length 133 [2023-12-25 09:27:52,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:27:52,723 INFO L495 AbstractCegarLoop]: Abstraction has 16969 states and 19096 transitions. [2023-12-25 09:27:52,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 16969 states and 19096 transitions. [2023-12-25 09:27:52,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-25 09:27:52,731 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:27:52,731 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-25 09:27:52,734 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 (51)] Ended with exit code 0 [2023-12-25 09:27:52,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:27:52,934 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:27:52,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:27:52,934 INFO L85 PathProgramCache]: Analyzing trace with hash -549015721, now seen corresponding path program 1 times [2023-12-25 09:27:52,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:27:52,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215834218] [2023-12-25 09:27:52,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:27:52,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:27:52,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:27:52,935 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:27:52,937 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 (52)] Waiting until timeout for monitored process [2023-12-25 09:27:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 09:27:53,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 09:27:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 09:27:53,162 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 09:27:53,163 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 09:27:53,163 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 09:27:53,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Forceful destruction successful, exit code 0 [2023-12-25 09:27:53,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:27:53,370 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, 1, 1, 1, 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-25 09:27:53,373 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 09:27:53,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 09:27:53 BoogieIcfgContainer [2023-12-25 09:27:53,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 09:27:53,623 INFO L158 Benchmark]: Toolchain (without parser) took 316854.20ms. Allocated memory was 202.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 138.5MB in the beginning and 943.4MB in the end (delta: -804.9MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2023-12-25 09:27:53,623 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 202.4MB. Free memory was 154.2MB in the beginning and 154.1MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 09:27:53,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.72ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 138.3MB in the beginning and 209.2MB in the end (delta: -70.9MB). Peak memory consumption was 25.6MB. Max. memory is 8.0GB. [2023-12-25 09:27:53,623 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.24ms. Allocated memory is still 243.3MB. Free memory was 209.2MB in the beginning and 206.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 09:27:53,623 INFO L158 Benchmark]: Boogie Preprocessor took 64.51ms. Allocated memory is still 243.3MB. Free memory was 206.0MB in the beginning and 202.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-25 09:27:53,623 INFO L158 Benchmark]: RCFGBuilder took 631.30ms. Allocated memory is still 243.3MB. Free memory was 202.4MB in the beginning and 162.0MB in the end (delta: 40.4MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2023-12-25 09:27:53,623 INFO L158 Benchmark]: TraceAbstraction took 315694.90ms. Allocated memory was 243.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 161.5MB in the beginning and 943.4MB in the end (delta: -781.9MB). Peak memory consumption was 990.1MB. Max. memory is 8.0GB. [2023-12-25 09:27:53,624 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.40ms. Allocated memory is still 202.4MB. Free memory was 154.2MB in the beginning and 154.1MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 394.72ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 138.3MB in the beginning and 209.2MB in the end (delta: -70.9MB). Peak memory consumption was 25.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.24ms. Allocated memory is still 243.3MB. Free memory was 209.2MB in the beginning and 206.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.51ms. Allocated memory is still 243.3MB. Free memory was 206.0MB in the beginning and 202.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 631.30ms. Allocated memory is still 243.3MB. Free memory was 202.4MB in the beginning and 162.0MB in the end (delta: 40.4MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * TraceAbstraction took 315694.90ms. Allocated memory was 243.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 161.5MB in the beginning and 943.4MB in the end (delta: -781.9MB). Peak memory consumption was 990.1MB. 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 - CounterExampleResult [Line: 391]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L26] msg_t nomsg = (msg_t )-1; [L27] unsigned char r1 = '\x0'; [L28] port_t p1 = 0; [L29] char p1_old = '\x0'; [L30] char p1_new = '\x0'; [L31] char id1 = '\x0'; [L32] char st1 = '\x0'; [L33] msg_t send1 = '\x0'; [L34] _Bool mode1 = 0; [L35] _Bool alive1 = 0; [L36] port_t p2 = 0; [L37] char p2_old = '\x0'; [L38] char p2_new = '\x0'; [L39] char id2 = '\x0'; [L40] char st2 = '\x0'; [L41] msg_t send2 = '\x0'; [L42] _Bool mode2 = 0; [L43] _Bool alive2 = 0; [L44] port_t p3 = 0; [L45] char p3_old = '\x0'; [L46] char p3_new = '\x0'; [L47] char id3 = '\x0'; [L48] char st3 = '\x0'; [L49] msg_t send3 = '\x0'; [L50] _Bool mode3 = 0; [L51] _Bool alive3 = 0; [L55] void (*nodes[3])() = { &node1, &node2, &node3 }; [L59] int __return_5979; [L60] int __return_6056; [L61] int __return_6117; [L62] int __return_6183; [L63] int __return_6353; [L66] int main__c1; [L67] int main__i2; [L68] main__c1 = 0 [L69] r1 = __VERIFIER_nondet_uchar() [L70] id1 = __VERIFIER_nondet_char() [L71] st1 = __VERIFIER_nondet_char() [L72] send1 = __VERIFIER_nondet_char() [L73] mode1 = __VERIFIER_nondet_bool() [L74] alive1 = __VERIFIER_nondet_bool() [L75] id2 = __VERIFIER_nondet_char() [L76] st2 = __VERIFIER_nondet_char() [L77] send2 = __VERIFIER_nondet_char() [L78] mode2 = __VERIFIER_nondet_bool() [L79] alive2 = __VERIFIER_nondet_bool() [L80] id3 = __VERIFIER_nondet_char() [L81] st3 = __VERIFIER_nondet_char() [L82] send3 = __VERIFIER_nondet_char() [L83] mode3 = __VERIFIER_nondet_bool() [L84] alive3 = __VERIFIER_nondet_bool() [L86] int init__tmp; VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0] [L87] COND TRUE ((int)r1) == 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0] [L89] COND TRUE ((((int)alive1) + ((int)alive2)) + ((int)alive3)) >= 1 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0] [L91] COND TRUE ((int)id1) >= 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0] [L93] COND TRUE ((int)st1) == 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, st1=0] [L95] COND TRUE ((int)send1) == ((int)id1) VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, st1=0] [L97] COND TRUE ((int)mode1) == 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, main__c1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, st1=0] [L99] COND TRUE ((int)id2) >= 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, main__c1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, st1=0] [L101] COND TRUE ((int)st2) == 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, main__c1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, st1=0, st2=0] [L103] COND TRUE ((int)send2) == ((int)id2) VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, main__c1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, st1=0, st2=0] [L105] COND TRUE ((int)mode2) == 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, main__c1=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, st1=0, st2=0] [L107] COND TRUE ((int)id3) >= 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, main__c1=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, st1=0, st2=0] [L109] COND TRUE ((int)st3) == 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, main__c1=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, st1=0, st2=0, st3=0] [L111] COND TRUE ((int)send3) == ((int)id3) VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, main__c1=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L113] COND TRUE ((int)mode3) == 0 VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L115] COND TRUE ((int)id1) != ((int)id2) VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L117] COND TRUE ((int)id1) != ((int)id3) VAL [__return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L119] COND TRUE ((int)id2) != ((int)id3) [L121] init__tmp = 1 [L122] __return_5979 = init__tmp [L123] main__i2 = __return_5979 VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L124] COND TRUE main__i2 != 0 [L126] p1_old = nomsg [L127] p1_new = nomsg [L128] p2_old = nomsg [L129] p2_new = nomsg [L130] p3_old = nomsg [L131] p3_new = nomsg [L132] main__i2 = 0 [L134] msg_t node1__m1; [L135] node1__m1 = nomsg VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L136] COND FALSE !(!(mode1 == 0)) VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L142] COND FALSE !(!(alive1 == 0)) VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L153] mode1 = 1 [L155] msg_t node2__m2; [L156] node2__m2 = nomsg VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L157] COND FALSE !(!(mode2 == 0)) VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L163] COND FALSE !(!(alive2 == 0)) VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L921] COND FALSE !(((int)send2) != ((int)id2)) VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L174] mode2 = 1 [L176] msg_t node3__m3; [L177] node3__m3 = nomsg VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L178] COND FALSE !(!(mode3 == 0)) VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L184] COND TRUE !(alive3 == 0) [L186] int node3____CPAchecker_TMP_0; VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L187] COND TRUE send3 != nomsg VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L189] COND TRUE p3_new == nomsg [L191] node3____CPAchecker_TMP_0 = send3 VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L193] p3_new = node3____CPAchecker_TMP_0 VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L195] mode3 = 1 [L196] p1_old = p1_new [L197] p1_new = nomsg [L198] p2_old = p2_new [L199] p2_new = nomsg [L200] p3_old = p3_new [L201] p3_new = nomsg [L203] int check__tmp; VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L204] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L206] COND TRUE ((int)r1) < 3 [L208] check__tmp = 1 [L209] __return_6056 = check__tmp [L210] main__c1 = __return_6056 [L212] _Bool __tmp_1; [L213] __tmp_1 = main__c1 [L214] _Bool assert__arg; [L215] assert__arg = __tmp_1 VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L216] COND FALSE !(assert__arg == 0) [L223] msg_t node1__m1; [L224] node1__m1 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L225] COND TRUE !(mode1 == 0) VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L227] COND FALSE !(r1 == 255) [L233] r1 = r1 + 1 [L234] node1__m1 = p3_old [L235] p3_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L236] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L238] COND FALSE !(!(alive1 == 0)) [L835] send1 = node1__m1 VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L245] mode1 = 0 [L247] msg_t node2__m2; [L248] node2__m2 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L249] COND TRUE !(mode2 == 0) [L251] node2__m2 = p1_old [L252] p1_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L253] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L262] mode2 = 0 [L264] msg_t node3__m3; [L265] node3__m3 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L266] COND TRUE !(mode3 == 0) [L268] node3__m3 = p2_old [L269] p2_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L270] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L279] mode3 = 0 [L280] p1_old = p1_new [L281] p1_new = nomsg [L282] p2_old = p2_new [L283] p2_new = nomsg [L284] p3_old = p3_new [L285] p3_new = nomsg [L287] int check__tmp; VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L288] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L290] COND TRUE ((int)r1) < 3 [L292] check__tmp = 1 [L293] __return_6117 = check__tmp [L294] main__c1 = __return_6117 [L296] _Bool __tmp_2; [L297] __tmp_2 = main__c1 [L298] _Bool assert__arg; [L299] assert__arg = __tmp_2 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L300] COND FALSE !(assert__arg == 0) [L307] msg_t node1__m1; [L308] node1__m1 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L309] COND FALSE !(!(mode1 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L711] COND FALSE !(!(alive1 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L722] mode1 = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L331] msg_t node2__m2; [L332] node2__m2 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L333] COND FALSE !(!(mode2 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L620] COND FALSE !(!(alive2 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L648] COND FALSE !(((int)send2) != ((int)id2)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L631] mode2 = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L349] msg_t node3__m3; [L350] node3__m3 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L351] COND FALSE !(!(mode3 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L534] COND TRUE !(alive3 == 0) [L536] int node3____CPAchecker_TMP_0; VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L537] COND TRUE send3 != nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L539] COND TRUE p3_new == nomsg [L541] node3____CPAchecker_TMP_0 = send3 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L543] p3_new = node3____CPAchecker_TMP_0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L545] mode3 = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L366] p1_old = p1_new [L367] p1_new = nomsg [L368] p2_old = p2_new [L369] p2_new = nomsg [L370] p3_old = p3_new [L371] p3_new = nomsg [L373] int check__tmp; VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L374] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L376] COND TRUE ((int)r1) < 3 [L378] check__tmp = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L381] __return_6183 = check__tmp [L382] main__c1 = __return_6183 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L385] _Bool __tmp_3; [L386] __tmp_3 = main__c1 [L387] _Bool assert__arg; [L388] assert__arg = __tmp_3 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L389] COND FALSE !(assert__arg == 0) [L397] msg_t node1__m1; [L398] node1__m1 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L399] COND TRUE !(mode1 == 0) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L401] COND FALSE !(r1 == 255) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L405] r1 = r1 + 1 [L406] node1__m1 = p3_old [L407] p3_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L408] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L410] COND FALSE !(!(alive1 == 0)) [L436] send1 = node1__m1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L417] mode1 = 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L331] msg_t node2__m2; [L332] node2__m2 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L333] COND TRUE !(mode2 == 0) [L335] node2__m2 = p1_old [L336] p1_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L337] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L346] mode2 = 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L349] msg_t node3__m3; [L350] node3__m3 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L351] COND TRUE !(mode3 == 0) [L353] node3__m3 = p2_old [L354] p2_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L355] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L364] mode3 = 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L366] p1_old = p1_new [L367] p1_new = nomsg [L368] p2_old = p2_new [L369] p2_new = nomsg [L370] p3_old = p3_new [L371] p3_new = nomsg [L373] int check__tmp; VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L374] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L376] COND TRUE ((int)r1) < 3 [L378] check__tmp = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L381] __return_6183 = check__tmp [L382] main__c1 = __return_6183 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L385] _Bool __tmp_3; [L386] __tmp_3 = main__c1 [L387] _Bool assert__arg; [L388] assert__arg = __tmp_3 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L389] COND FALSE !(assert__arg == 0) [L397] msg_t node1__m1; [L398] node1__m1 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L399] COND FALSE !(!(mode1 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L452] COND FALSE !(!(alive1 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L463] mode1 = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L331] msg_t node2__m2; [L332] node2__m2 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L333] COND FALSE !(!(mode2 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L620] COND FALSE !(!(alive2 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L648] COND FALSE !(((int)send2) != ((int)id2)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L631] mode2 = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L349] msg_t node3__m3; [L350] node3__m3 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L351] COND FALSE !(!(mode3 == 0)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L534] COND TRUE !(alive3 == 0) [L536] int node3____CPAchecker_TMP_0; VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L537] COND TRUE send3 != nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L539] COND TRUE p3_new == nomsg [L541] node3____CPAchecker_TMP_0 = send3 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L543] p3_new = node3____CPAchecker_TMP_0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L545] mode3 = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L366] p1_old = p1_new [L367] p1_new = nomsg [L368] p2_old = p2_new [L369] p2_new = nomsg [L370] p3_old = p3_new [L371] p3_new = nomsg [L373] int check__tmp; VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L374] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L376] COND TRUE ((int)r1) < 3 [L378] check__tmp = 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L381] __return_6183 = check__tmp [L382] main__c1 = __return_6183 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L385] _Bool __tmp_3; [L386] __tmp_3 = main__c1 [L387] _Bool assert__arg; [L388] assert__arg = __tmp_3 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L389] COND FALSE !(assert__arg == 0) [L397] msg_t node1__m1; [L398] node1__m1 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L399] COND TRUE !(mode1 == 0) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L401] COND FALSE !(r1 == 255) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L405] r1 = r1 + 1 [L406] node1__m1 = p3_old [L407] p3_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L408] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L410] COND FALSE !(!(alive1 == 0)) [L436] send1 = node1__m1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L417] mode1 = 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L331] msg_t node2__m2; [L332] node2__m2 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L333] COND TRUE !(mode2 == 0) [L335] node2__m2 = p1_old [L336] p1_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L337] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L346] mode2 = 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L349] msg_t node3__m3; [L350] node3__m3 = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L351] COND TRUE !(mode3 == 0) [L353] node3__m3 = p2_old [L354] p2_old = nomsg VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L355] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L364] mode3 = 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L366] p1_old = p1_new [L367] p1_new = nomsg [L368] p2_old = p2_new [L369] p2_new = nomsg [L370] p3_old = p3_new [L371] p3_new = nomsg [L373] int check__tmp; VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L374] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L376] COND FALSE !(((int)r1) < 3) VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L489] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 1) [L496] check__tmp = 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L381] __return_6183 = check__tmp [L382] main__c1 = __return_6183 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L385] _Bool __tmp_3; [L386] __tmp_3 = main__c1 [L387] _Bool assert__arg; [L388] assert__arg = __tmp_3 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=0, alive1=0, alive2=0, alive3=1, assert__arg=0, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L389] COND TRUE assert__arg == 0 VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=0, alive1=0, alive2=0, alive3=1, assert__arg=0, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L391] reach_error() VAL [__return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=0, alive1=0, alive2=0, alive3=1, assert__arg=0, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=96, node1__m1=96, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3____CPAchecker_TMP_0=96, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 315.4s, OverallIterations: 51, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 269.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59556 SdHoareTripleChecker+Valid, 56.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59556 mSDsluCounter, 110057 SdHoareTripleChecker+Invalid, 52.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96226 mSDsCounter, 861 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44145 IncrementalHoareTripleChecker+Invalid, 45006 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 861 mSolverCounterUnsat, 13831 mSDtfsCounter, 44145 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6231 GetRequests, 4523 SyntacticMatches, 2 SemanticMatches, 1706 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 239257 ImplicationChecksByTransitivity, 216.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29388occurred in iteration=31, InterpolantAutomatonStates: 1514, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.7s AutomataMinimizationTime, 50 MinimizatonAttempts, 251162 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 25.4s InterpolantComputationTime, 4101 NumberOfCodeBlocks, 4101 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 4954 ConstructedInterpolants, 1354 QuantifiedInterpolants, 55943 SizeOfPredicates, 207 NumberOfNonLiveVariables, 8890 ConjunctsInSsa, 441 ConjunctsInUnsatCore, 60 InterpolantComputations, 40 PerfectInterpolantSequences, 309/377 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 proved your program to be incorrect! [2023-12-25 09:27:53,860 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 09:27:53,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...