/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/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 07:35:13,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 07:35:13,552 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 07:35:13,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 07:35:13,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 07:35:13,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 07:35:13,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 07:35:13,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 07:35:13,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 07:35:13,571 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 07:35:13,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 07:35:13,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 07:35:13,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 07:35:13,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 07:35:13,572 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 07:35:13,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 07:35:13,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 07:35:13,573 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 07:35:13,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 07:35:13,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 07:35:13,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 07:35:13,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 07:35:13,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 07:35:13,574 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 07:35:13,575 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 07:35:13,575 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 07:35:13,575 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 07:35:13,575 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 07:35:13,576 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 07:35:13,576 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 07:35:13,576 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 07:35:13,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 07:35:13,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 07:35:13,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 07:35:13,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:35:13,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 07:35:13,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 07:35:13,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 07:35:13,578 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 07:35:13,578 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 07:35:13,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 07:35:13,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 07:35:13,579 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 07:35:13,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 07:35:13,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 07:35:13,580 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 07:35:13,580 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 07:35:13,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 07:35:13,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 07:35:13,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 07:35:13,736 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 07:35:13,736 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 07:35:13,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c [2023-12-25 07:35:14,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 07:35:14,961 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 07:35:14,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c [2023-12-25 07:35:14,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a199b7f6/536b7398d9074bc3adfa183953e09ca5/FLAGd9d753ac0 [2023-12-25 07:35:14,983 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a199b7f6/536b7398d9074bc3adfa183953e09ca5 [2023-12-25 07:35:14,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 07:35:14,986 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 07:35:14,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 07:35:14,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 07:35:14,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 07:35:14,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:35:14" (1/1) ... [2023-12-25 07:35:14,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@211ff50a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:14, skipping insertion in model container [2023-12-25 07:35:14,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:35:14" (1/1) ... [2023-12-25 07:35:15,040 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 07:35:15,210 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/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c[6940,6953] [2023-12-25 07:35:15,215 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:35:15,227 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 07:35:15,273 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/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c[6940,6953] [2023-12-25 07:35:15,274 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:35:15,288 INFO L206 MainTranslator]: Completed translation [2023-12-25 07:35:15,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:15 WrapperNode [2023-12-25 07:35:15,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 07:35:15,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 07:35:15,292 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 07:35:15,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 07:35:15,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:15" (1/1) ... [2023-12-25 07:35:15,313 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:15" (1/1) ... [2023-12-25 07:35:15,339 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 233 [2023-12-25 07:35:15,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 07:35:15,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 07:35:15,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 07:35:15,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 07:35:15,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:15" (1/1) ... [2023-12-25 07:35:15,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:15" (1/1) ... [2023-12-25 07:35:15,355 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:15" (1/1) ... [2023-12-25 07:35:15,365 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 07:35:15,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:15" (1/1) ... [2023-12-25 07:35:15,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:15" (1/1) ... [2023-12-25 07:35:15,370 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:15" (1/1) ... [2023-12-25 07:35:15,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:15" (1/1) ... [2023-12-25 07:35:15,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:15" (1/1) ... [2023-12-25 07:35:15,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:15" (1/1) ... [2023-12-25 07:35:15,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 07:35:15,393 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 07:35:15,393 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 07:35:15,394 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 07:35:15,394 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:15" (1/1) ... [2023-12-25 07:35:15,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:35:15,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 07:35:15,461 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 07:35:15,477 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 07:35:15,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 07:35:15,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 07:35:15,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 07:35:15,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 07:35:15,586 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 07:35:15,589 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 07:35:15,895 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 07:35:15,920 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 07:35:15,920 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 07:35:15,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:35:15 BoogieIcfgContainer [2023-12-25 07:35:15,920 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 07:35:15,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 07:35:15,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 07:35:15,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 07:35:15,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 07:35:14" (1/3) ... [2023-12-25 07:35:15,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fea6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:35:15, skipping insertion in model container [2023-12-25 07:35:15,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:15" (2/3) ... [2023-12-25 07:35:15,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fea6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:35:15, skipping insertion in model container [2023-12-25 07:35:15,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:35:15" (3/3) ... [2023-12-25 07:35:15,955 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c [2023-12-25 07:35:15,967 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 07:35:15,968 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 07:35:16,009 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 07:35:16,015 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;@2d588a35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 07:35:16,015 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 07:35:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 63 states have internal predecessors, (109), 0 states have call successors, (0), 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 07:35:16,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-25 07:35:16,026 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:16,027 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] [2023-12-25 07:35:16,027 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:16,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:16,031 INFO L85 PathProgramCache]: Analyzing trace with hash 553341809, now seen corresponding path program 1 times [2023-12-25 07:35:16,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:16,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072699930] [2023-12-25 07:35:16,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:16,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:16,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:16,049 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 07:35:16,069 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 07:35:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:16,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 07:35:16,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:16,201 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 07:35:16,201 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:16,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:16,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072699930] [2023-12-25 07:35:16,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072699930] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:16,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:16,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:35:16,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121731754] [2023-12-25 07:35:16,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:16,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:35:16,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:16,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:35:16,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:35:16,236 INFO L87 Difference]: Start difference. First operand has 64 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 63 states have internal predecessors, (109), 0 states have call successors, (0), 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 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 07:35:16,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:16,304 INFO L93 Difference]: Finished difference Result 108 states and 182 transitions. [2023-12-25 07:35:16,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:35:16,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2023-12-25 07:35:16,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:16,312 INFO L225 Difference]: With dead ends: 108 [2023-12-25 07:35:16,312 INFO L226 Difference]: Without dead ends: 62 [2023-12-25 07:35:16,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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 07:35:16,319 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:16,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 283 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:16,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-25 07:35:16,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-25 07:35:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 61 states have internal predecessors, (87), 0 states have call successors, (0), 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 07:35:16,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2023-12-25 07:35:16,350 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 87 transitions. Word has length 22 [2023-12-25 07:35:16,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:16,350 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 87 transitions. [2023-12-25 07:35:16,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 07:35:16,351 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2023-12-25 07:35:16,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 07:35:16,352 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:16,352 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] [2023-12-25 07:35:16,367 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 07:35:16,555 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 07:35:16,556 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:16,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:16,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1178010663, now seen corresponding path program 1 times [2023-12-25 07:35:16,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:16,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086270143] [2023-12-25 07:35:16,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:16,559 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 07:35:16,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:16,564 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 07:35:16,566 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 07:35:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:16,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:16,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:16,657 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 07:35:16,657 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:16,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:16,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086270143] [2023-12-25 07:35:16,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086270143] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:16,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:16,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:16,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699540126] [2023-12-25 07:35:16,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:16,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:16,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:16,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:16,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:16,660 INFO L87 Difference]: Start difference. First operand 62 states and 87 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 07:35:16,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:16,677 INFO L93 Difference]: Finished difference Result 136 states and 205 transitions. [2023-12-25 07:35:16,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:16,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2023-12-25 07:35:16,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:16,678 INFO L225 Difference]: With dead ends: 136 [2023-12-25 07:35:16,678 INFO L226 Difference]: Without dead ends: 95 [2023-12-25 07:35:16,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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 07:35:16,680 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 50 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:16,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 177 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:16,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-25 07:35:16,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2023-12-25 07:35:16,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 92 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2023-12-25 07:35:16,687 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 38 [2023-12-25 07:35:16,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:16,687 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2023-12-25 07:35:16,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 07:35:16,687 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2023-12-25 07:35:16,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 07:35:16,688 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:16,688 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] [2023-12-25 07:35:16,709 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 07:35:16,890 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 07:35:16,891 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:16,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:16,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2089214662, now seen corresponding path program 1 times [2023-12-25 07:35:16,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:16,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673665279] [2023-12-25 07:35:16,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:16,893 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 07:35:16,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:16,895 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 07:35:16,896 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 07:35:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:16,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:35:16,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:17,186 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 07:35:17,187 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:17,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:17,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673665279] [2023-12-25 07:35:17,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673665279] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:17,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:17,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:35:17,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762332372] [2023-12-25 07:35:17,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:17,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:35:17,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:17,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:35:17,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:35:17,195 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 07:35:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:17,269 INFO L93 Difference]: Finished difference Result 381 states and 601 transitions. [2023-12-25 07:35:17,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:35:17,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2023-12-25 07:35:17,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:17,275 INFO L225 Difference]: With dead ends: 381 [2023-12-25 07:35:17,275 INFO L226 Difference]: Without dead ends: 309 [2023-12-25 07:35:17,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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 07:35:17,278 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 341 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:17,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 266 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:17,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-12-25 07:35:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 163. [2023-12-25 07:35:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 0 states have call successors, (0), 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 07:35:17,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2023-12-25 07:35:17,295 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 38 [2023-12-25 07:35:17,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:17,295 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2023-12-25 07:35:17,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 07:35:17,296 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2023-12-25 07:35:17,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-25 07:35:17,305 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:17,306 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] [2023-12-25 07:35:17,308 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 07:35:17,508 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 07:35:17,508 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:17,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:17,513 INFO L85 PathProgramCache]: Analyzing trace with hash 328114147, now seen corresponding path program 1 times [2023-12-25 07:35:17,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:17,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056506095] [2023-12-25 07:35:17,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:17,514 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 07:35:17,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:17,518 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 07:35:17,520 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 07:35:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:17,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 07:35:17,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:17,590 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 07:35:17,590 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:17,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:17,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056506095] [2023-12-25 07:35:17,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056506095] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:17,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:17,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:35:17,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696057622] [2023-12-25 07:35:17,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:17,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:35:17,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:17,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:35:17,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:35:17,592 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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 07:35:17,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:17,609 INFO L93 Difference]: Finished difference Result 177 states and 265 transitions. [2023-12-25 07:35:17,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:35:17,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2023-12-25 07:35:17,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:17,610 INFO L225 Difference]: With dead ends: 177 [2023-12-25 07:35:17,610 INFO L226 Difference]: Without dead ends: 175 [2023-12-25 07:35:17,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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 07:35:17,611 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:17,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 242 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:17,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-12-25 07:35:17,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2023-12-25 07:35:17,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.5058823529411764) internal successors, (256), 170 states have internal predecessors, (256), 0 states have call successors, (0), 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 07:35:17,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 256 transitions. [2023-12-25 07:35:17,618 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 256 transitions. Word has length 39 [2023-12-25 07:35:17,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:17,619 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 256 transitions. [2023-12-25 07:35:17,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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 07:35:17,619 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 256 transitions. [2023-12-25 07:35:17,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-25 07:35:17,619 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:17,620 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] [2023-12-25 07:35:17,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 07:35:17,822 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 07:35:17,823 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:17,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:17,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1582634382, now seen corresponding path program 1 times [2023-12-25 07:35:17,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:17,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764096722] [2023-12-25 07:35:17,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:17,824 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 07:35:17,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:17,825 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 07:35:17,827 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 07:35:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:17,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:17,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:17,914 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 07:35:17,914 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:17,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:17,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764096722] [2023-12-25 07:35:17,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764096722] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:17,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:17,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:17,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584063444] [2023-12-25 07:35:17,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:17,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:17,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:17,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:17,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:17,916 INFO L87 Difference]: Start difference. First operand 171 states and 256 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 07:35:17,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:17,933 INFO L93 Difference]: Finished difference Result 443 states and 678 transitions. [2023-12-25 07:35:17,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:17,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2023-12-25 07:35:17,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:17,936 INFO L225 Difference]: With dead ends: 443 [2023-12-25 07:35:17,936 INFO L226 Difference]: Without dead ends: 293 [2023-12-25 07:35:17,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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 07:35:17,939 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 38 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:17,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 141 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:17,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2023-12-25 07:35:17,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 287. [2023-12-25 07:35:17,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.5034965034965035) internal successors, (430), 286 states have internal predecessors, (430), 0 states have call successors, (0), 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 07:35:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 430 transitions. [2023-12-25 07:35:17,966 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 430 transitions. Word has length 40 [2023-12-25 07:35:17,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:17,966 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 430 transitions. [2023-12-25 07:35:17,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 07:35:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 430 transitions. [2023-12-25 07:35:17,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-25 07:35:17,967 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:17,967 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] [2023-12-25 07:35:17,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 07:35:18,170 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 07:35:18,170 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:18,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:18,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1783001514, now seen corresponding path program 1 times [2023-12-25 07:35:18,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:18,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253366748] [2023-12-25 07:35:18,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:18,172 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 07:35:18,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:18,173 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 07:35:18,175 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 07:35:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:18,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:18,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:18,274 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 07:35:18,274 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:18,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:18,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253366748] [2023-12-25 07:35:18,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253366748] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:18,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:18,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:18,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697344373] [2023-12-25 07:35:18,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:18,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:18,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:18,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:18,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:18,276 INFO L87 Difference]: Start difference. First operand 287 states and 430 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 07:35:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:18,291 INFO L93 Difference]: Finished difference Result 755 states and 1136 transitions. [2023-12-25 07:35:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:18,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2023-12-25 07:35:18,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:18,294 INFO L225 Difference]: With dead ends: 755 [2023-12-25 07:35:18,294 INFO L226 Difference]: Without dead ends: 489 [2023-12-25 07:35:18,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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 07:35:18,297 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 46 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:18,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 175 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:18,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2023-12-25 07:35:18,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 487. [2023-12-25 07:35:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 1.477366255144033) internal successors, (718), 486 states have internal predecessors, (718), 0 states have call successors, (0), 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 07:35:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 718 transitions. [2023-12-25 07:35:18,312 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 718 transitions. Word has length 41 [2023-12-25 07:35:18,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:18,312 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 718 transitions. [2023-12-25 07:35:18,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 07:35:18,314 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 718 transitions. [2023-12-25 07:35:18,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 07:35:18,316 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:18,316 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] [2023-12-25 07:35:18,330 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 07:35:18,518 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 07:35:18,520 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:18,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:18,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2069403532, now seen corresponding path program 1 times [2023-12-25 07:35:18,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:18,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665808587] [2023-12-25 07:35:18,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:18,521 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 07:35:18,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:18,534 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 07:35:18,536 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 07:35:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:18,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:18,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:18,616 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 07:35:18,616 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:18,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:18,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665808587] [2023-12-25 07:35:18,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665808587] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:18,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:18,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:18,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684618882] [2023-12-25 07:35:18,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:18,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:18,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:18,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:18,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:18,618 INFO L87 Difference]: Start difference. First operand 487 states and 718 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 07:35:18,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:18,636 INFO L93 Difference]: Finished difference Result 942 states and 1404 transitions. [2023-12-25 07:35:18,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:18,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2023-12-25 07:35:18,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:18,640 INFO L225 Difference]: With dead ends: 942 [2023-12-25 07:35:18,640 INFO L226 Difference]: Without dead ends: 675 [2023-12-25 07:35:18,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 07:35:18,641 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 51 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:18,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 187 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:18,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2023-12-25 07:35:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 673. [2023-12-25 07:35:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 672 states have (on average 1.4642857142857142) internal successors, (984), 672 states have internal predecessors, (984), 0 states have call successors, (0), 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 07:35:18,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 984 transitions. [2023-12-25 07:35:18,657 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 984 transitions. Word has length 42 [2023-12-25 07:35:18,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:18,657 INFO L495 AbstractCegarLoop]: Abstraction has 673 states and 984 transitions. [2023-12-25 07:35:18,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 07:35:18,657 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 984 transitions. [2023-12-25 07:35:18,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 07:35:18,658 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:18,658 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 07:35:18,667 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 07:35:18,860 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 07:35:18,861 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:18,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:18,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1411089419, now seen corresponding path program 1 times [2023-12-25 07:35:18,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:18,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826905286] [2023-12-25 07:35:18,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:18,862 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 07:35:18,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:18,863 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 07:35:18,865 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 07:35:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:18,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:18,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:18,928 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:18,928 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:18,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:18,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826905286] [2023-12-25 07:35:18,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826905286] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:18,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:18,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:18,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553565536] [2023-12-25 07:35:18,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:18,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:18,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:18,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:18,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:18,930 INFO L87 Difference]: Start difference. First operand 673 states and 984 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 07:35:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:18,946 INFO L93 Difference]: Finished difference Result 1147 states and 1687 transitions. [2023-12-25 07:35:18,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:18,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2023-12-25 07:35:18,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:18,948 INFO L225 Difference]: With dead ends: 1147 [2023-12-25 07:35:18,948 INFO L226 Difference]: Without dead ends: 497 [2023-12-25 07:35:18,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 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 07:35:18,949 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 44 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:18,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 178 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:18,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2023-12-25 07:35:18,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 495. [2023-12-25 07:35:18,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 494 states have (on average 1.4493927125506072) internal successors, (716), 494 states have internal predecessors, (716), 0 states have call successors, (0), 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 07:35:18,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 716 transitions. [2023-12-25 07:35:18,961 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 716 transitions. Word has length 59 [2023-12-25 07:35:18,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:18,961 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 716 transitions. [2023-12-25 07:35:18,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 07:35:18,961 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 716 transitions. [2023-12-25 07:35:18,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 07:35:18,962 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:18,962 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 07:35:18,976 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 07:35:19,177 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 07:35:19,177 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:19,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:19,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1593197684, now seen corresponding path program 1 times [2023-12-25 07:35:19,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:19,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489611904] [2023-12-25 07:35:19,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:19,178 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 07:35:19,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:19,193 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 07:35:19,252 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 07:35:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:19,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 07:35:19,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:19,824 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:35:20,084 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:20,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:20,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489611904] [2023-12-25 07:35:20,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489611904] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:35:20,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:35:20,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 07:35:20,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276397727] [2023-12-25 07:35:20,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:35:20,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:35:20,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:20,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:35:20,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:35:20,087 INFO L87 Difference]: Start difference. First operand 495 states and 716 transitions. Second operand has 16 states, 16 states have (on average 6.5) internal successors, (104), 15 states have internal predecessors, (104), 0 states have call successors, (0), 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 07:35:20,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:20,698 INFO L93 Difference]: Finished difference Result 1699 states and 2443 transitions. [2023-12-25 07:35:20,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 07:35:20,698 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.5) internal successors, (104), 15 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-12-25 07:35:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:20,702 INFO L225 Difference]: With dead ends: 1699 [2023-12-25 07:35:20,702 INFO L226 Difference]: Without dead ends: 1249 [2023-12-25 07:35:20,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=516, Unknown=0, NotChecked=0, Total=702 [2023-12-25 07:35:20,703 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 493 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:20,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 531 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 07:35:20,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2023-12-25 07:35:20,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1013. [2023-12-25 07:35:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 1012 states have (on average 1.448616600790514) internal successors, (1466), 1012 states have internal predecessors, (1466), 0 states have call successors, (0), 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 07:35:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1466 transitions. [2023-12-25 07:35:20,734 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1466 transitions. Word has length 60 [2023-12-25 07:35:20,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:20,735 INFO L495 AbstractCegarLoop]: Abstraction has 1013 states and 1466 transitions. [2023-12-25 07:35:20,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.5) internal successors, (104), 15 states have internal predecessors, (104), 0 states have call successors, (0), 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 07:35:20,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1466 transitions. [2023-12-25 07:35:20,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 07:35:20,736 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:20,736 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 07:35:20,753 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 07:35:20,939 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 07:35:20,939 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:20,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:20,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1272185863, now seen corresponding path program 1 times [2023-12-25 07:35:20,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:20,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554221848] [2023-12-25 07:35:20,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:20,940 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 07:35:20,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:20,941 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 07:35:20,943 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 07:35:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:20,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:20,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:21,022 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 07:35:21,022 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:21,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:21,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554221848] [2023-12-25 07:35:21,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554221848] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:21,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:21,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:21,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395969365] [2023-12-25 07:35:21,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:21,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:21,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:21,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:21,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:21,024 INFO L87 Difference]: Start difference. First operand 1013 states and 1466 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 07:35:21,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:21,061 INFO L93 Difference]: Finished difference Result 2911 states and 4214 transitions. [2023-12-25 07:35:21,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:21,061 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 07:35:21,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:21,066 INFO L225 Difference]: With dead ends: 2911 [2023-12-25 07:35:21,066 INFO L226 Difference]: Without dead ends: 1953 [2023-12-25 07:35:21,067 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 07:35:21,067 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 41 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:21,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 160 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2023-12-25 07:35:21,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1951. [2023-12-25 07:35:21,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1950 states have (on average 1.4235897435897436) internal successors, (2776), 1950 states have internal predecessors, (2776), 0 states have call successors, (0), 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 07:35:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 2776 transitions. [2023-12-25 07:35:21,136 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 2776 transitions. Word has length 61 [2023-12-25 07:35:21,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:21,136 INFO L495 AbstractCegarLoop]: Abstraction has 1951 states and 2776 transitions. [2023-12-25 07:35:21,136 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 07:35:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 2776 transitions. [2023-12-25 07:35:21,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 07:35:21,137 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:21,137 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:35:21,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-25 07:35:21,340 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 07:35:21,340 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:21,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:21,340 INFO L85 PathProgramCache]: Analyzing trace with hash 628722855, now seen corresponding path program 1 times [2023-12-25 07:35:21,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:21,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605344491] [2023-12-25 07:35:21,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:21,341 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 07:35:21,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:21,342 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 07:35:21,369 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 07:35:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:21,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 07:35:21,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:21,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:21,791 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:35:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:21,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:21,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605344491] [2023-12-25 07:35:21,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605344491] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:35:21,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:35:21,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-25 07:35:21,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725134257] [2023-12-25 07:35:21,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:35:21,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:35:21,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:21,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:35:21,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:35:21,972 INFO L87 Difference]: Start difference. First operand 1951 states and 2776 transitions. Second operand has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 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 07:35:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:23,359 INFO L93 Difference]: Finished difference Result 7019 states and 9948 transitions. [2023-12-25 07:35:23,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-25 07:35:23,359 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 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 61 [2023-12-25 07:35:23,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:23,373 INFO L225 Difference]: With dead ends: 7019 [2023-12-25 07:35:23,373 INFO L226 Difference]: Without dead ends: 5133 [2023-12-25 07:35:23,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=286, Invalid=904, Unknown=0, NotChecked=0, Total=1190 [2023-12-25 07:35:23,376 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 649 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:23,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1250 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 07:35:23,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2023-12-25 07:35:23,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 4411. [2023-12-25 07:35:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4411 states, 4410 states have (on average 1.415419501133787) internal successors, (6242), 4410 states have internal predecessors, (6242), 0 states have call successors, (0), 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 07:35:23,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4411 states to 4411 states and 6242 transitions. [2023-12-25 07:35:23,533 INFO L78 Accepts]: Start accepts. Automaton has 4411 states and 6242 transitions. Word has length 61 [2023-12-25 07:35:23,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:23,533 INFO L495 AbstractCegarLoop]: Abstraction has 4411 states and 6242 transitions. [2023-12-25 07:35:23,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 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 07:35:23,533 INFO L276 IsEmpty]: Start isEmpty. Operand 4411 states and 6242 transitions. [2023-12-25 07:35:23,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 07:35:23,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:23,535 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:35:23,539 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 (12)] Ended with exit code 0 [2023-12-25 07:35:23,737 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 07:35:23,737 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:23,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:23,738 INFO L85 PathProgramCache]: Analyzing trace with hash 793846499, now seen corresponding path program 1 times [2023-12-25 07:35:23,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:23,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753081733] [2023-12-25 07:35:23,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:23,738 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 07:35:23,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:23,740 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 07:35:23,741 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 07:35:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:23,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 07:35:23,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:24,181 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:35:24,334 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:24,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:24,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753081733] [2023-12-25 07:35:24,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753081733] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:35:24,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:35:24,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 07:35:24,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983903208] [2023-12-25 07:35:24,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:35:24,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:35:24,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:24,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:35:24,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:35:24,337 INFO L87 Difference]: Start difference. First operand 4411 states and 6242 transitions. Second operand has 16 states, 16 states have (on average 6.875) internal successors, (110), 15 states have internal predecessors, (110), 0 states have call successors, (0), 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 07:35:25,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:25,167 INFO L93 Difference]: Finished difference Result 16993 states and 24102 transitions. [2023-12-25 07:35:25,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 07:35:25,168 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.875) internal successors, (110), 15 states have internal predecessors, (110), 0 states have call successors, (0), 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 07:35:25,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:25,206 INFO L225 Difference]: With dead ends: 16993 [2023-12-25 07:35:25,206 INFO L226 Difference]: Without dead ends: 12667 [2023-12-25 07:35:25,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2023-12-25 07:35:25,217 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 1205 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:25,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 445 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 07:35:25,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12667 states. [2023-12-25 07:35:25,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12667 to 9445. [2023-12-25 07:35:25,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9445 states, 9444 states have (on average 1.4130664972469293) internal successors, (13345), 9444 states have internal predecessors, (13345), 0 states have call successors, (0), 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 07:35:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 13345 transitions. [2023-12-25 07:35:25,602 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 13345 transitions. Word has length 61 [2023-12-25 07:35:25,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:25,602 INFO L495 AbstractCegarLoop]: Abstraction has 9445 states and 13345 transitions. [2023-12-25 07:35:25,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.875) internal successors, (110), 15 states have internal predecessors, (110), 0 states have call successors, (0), 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 07:35:25,603 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 13345 transitions. [2023-12-25 07:35:25,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 07:35:25,604 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:25,604 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 07:35:25,607 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 07:35:25,807 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 07:35:25,807 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:25,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:25,808 INFO L85 PathProgramCache]: Analyzing trace with hash 287561154, now seen corresponding path program 1 times [2023-12-25 07:35:25,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:25,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424722597] [2023-12-25 07:35:25,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:25,808 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 07:35:25,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:25,810 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 07:35:25,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 07:35:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:25,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:25,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:25,885 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:25,885 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:25,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:25,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424722597] [2023-12-25 07:35:25,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424722597] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:25,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:25,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:25,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779301601] [2023-12-25 07:35:25,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:25,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:25,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:25,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:25,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:25,886 INFO L87 Difference]: Start difference. First operand 9445 states and 13345 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 07:35:26,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:26,001 INFO L93 Difference]: Finished difference Result 14519 states and 20509 transitions. [2023-12-25 07:35:26,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:26,001 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 07:35:26,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:26,014 INFO L225 Difference]: With dead ends: 14519 [2023-12-25 07:35:26,014 INFO L226 Difference]: Without dead ends: 5189 [2023-12-25 07:35:26,022 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 07:35:26,022 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 35 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:26,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 159 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:26,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5189 states. [2023-12-25 07:35:26,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5189 to 5187. [2023-12-25 07:35:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5187 states, 5186 states have (on average 1.378519089857308) internal successors, (7149), 5186 states have internal predecessors, (7149), 0 states have call successors, (0), 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 07:35:26,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5187 states to 5187 states and 7149 transitions. [2023-12-25 07:35:26,198 INFO L78 Accepts]: Start accepts. Automaton has 5187 states and 7149 transitions. Word has length 61 [2023-12-25 07:35:26,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:26,198 INFO L495 AbstractCegarLoop]: Abstraction has 5187 states and 7149 transitions. [2023-12-25 07:35:26,198 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 07:35:26,198 INFO L276 IsEmpty]: Start isEmpty. Operand 5187 states and 7149 transitions. [2023-12-25 07:35:26,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 07:35:26,199 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:26,199 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:35:26,202 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 07:35:26,401 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 07:35:26,402 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:26,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:26,402 INFO L85 PathProgramCache]: Analyzing trace with hash -73118296, now seen corresponding path program 1 times [2023-12-25 07:35:26,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:26,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952432289] [2023-12-25 07:35:26,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:26,403 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 07:35:26,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:26,404 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 07:35:26,405 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 07:35:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:26,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:26,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:26,466 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 07:35:26,466 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:26,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:26,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952432289] [2023-12-25 07:35:26,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952432289] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:26,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:26,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:26,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049702866] [2023-12-25 07:35:26,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:26,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:26,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:26,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:26,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:26,468 INFO L87 Difference]: Start difference. First operand 5187 states and 7149 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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 07:35:26,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:26,645 INFO L93 Difference]: Finished difference Result 15178 states and 20817 transitions. [2023-12-25 07:35:26,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:26,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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 07:35:26,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:26,665 INFO L225 Difference]: With dead ends: 15178 [2023-12-25 07:35:26,665 INFO L226 Difference]: Without dead ends: 10106 [2023-12-25 07:35:26,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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 07:35:26,671 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 40 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:26,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 167 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:26,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10106 states. [2023-12-25 07:35:26,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10106 to 10104. [2023-12-25 07:35:26,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10104 states, 10103 states have (on average 1.3495991289715925) internal successors, (13635), 10103 states have internal predecessors, (13635), 0 states have call successors, (0), 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 07:35:26,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10104 states to 10104 states and 13635 transitions. [2023-12-25 07:35:26,946 INFO L78 Accepts]: Start accepts. Automaton has 10104 states and 13635 transitions. Word has length 62 [2023-12-25 07:35:26,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:26,946 INFO L495 AbstractCegarLoop]: Abstraction has 10104 states and 13635 transitions. [2023-12-25 07:35:26,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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 07:35:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 10104 states and 13635 transitions. [2023-12-25 07:35:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 07:35:26,948 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:26,948 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:35:26,952 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 (15)] Ended with exit code 0 [2023-12-25 07:35:27,150 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 07:35:27,151 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:27,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:27,151 INFO L85 PathProgramCache]: Analyzing trace with hash -183291626, now seen corresponding path program 1 times [2023-12-25 07:35:27,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:27,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672728347] [2023-12-25 07:35:27,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:27,152 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 07:35:27,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:27,153 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 07:35:27,178 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 07:35:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:27,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 07:35:27,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:27,619 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:27,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:35:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:27,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:27,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672728347] [2023-12-25 07:35:27,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672728347] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:35:27,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:35:27,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-25 07:35:27,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038634172] [2023-12-25 07:35:27,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:35:27,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:35:27,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:27,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:35:27,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:35:27,867 INFO L87 Difference]: Start difference. First operand 10104 states and 13635 transitions. Second operand has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 0 states have call successors, (0), 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 07:35:29,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:29,071 INFO L93 Difference]: Finished difference Result 25779 states and 34788 transitions. [2023-12-25 07:35:29,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 07:35:29,072 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 0 states have call successors, (0), 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 07:35:29,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:29,102 INFO L225 Difference]: With dead ends: 25779 [2023-12-25 07:35:29,102 INFO L226 Difference]: Without dead ends: 15810 [2023-12-25 07:35:29,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2023-12-25 07:35:29,111 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 655 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:29,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1025 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 07:35:29,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15810 states. [2023-12-25 07:35:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15810 to 12911. [2023-12-25 07:35:29,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12911 states, 12910 states have (on average 1.351742835011619) internal successors, (17451), 12910 states have internal predecessors, (17451), 0 states have call successors, (0), 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 07:35:29,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12911 states to 12911 states and 17451 transitions. [2023-12-25 07:35:29,480 INFO L78 Accepts]: Start accepts. Automaton has 12911 states and 17451 transitions. Word has length 62 [2023-12-25 07:35:29,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:29,481 INFO L495 AbstractCegarLoop]: Abstraction has 12911 states and 17451 transitions. [2023-12-25 07:35:29,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 0 states have call successors, (0), 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 07:35:29,481 INFO L276 IsEmpty]: Start isEmpty. Operand 12911 states and 17451 transitions. [2023-12-25 07:35:29,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 07:35:29,483 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:29,483 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 07:35:29,501 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 07:35:29,685 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 07:35:29,686 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:29,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:29,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1451387862, now seen corresponding path program 1 times [2023-12-25 07:35:29,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:29,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305730592] [2023-12-25 07:35:29,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:29,687 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 07:35:29,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:29,688 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 07:35:29,690 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 07:35:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:29,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:29,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:29,748 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 07:35:29,748 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:29,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:29,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305730592] [2023-12-25 07:35:29,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305730592] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:29,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:29,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:29,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172227681] [2023-12-25 07:35:29,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:29,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:29,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:29,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:29,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:29,750 INFO L87 Difference]: Start difference. First operand 12911 states and 17451 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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 07:35:29,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:29,948 INFO L93 Difference]: Finished difference Result 19421 states and 26219 transitions. [2023-12-25 07:35:29,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:29,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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 07:35:29,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:29,958 INFO L225 Difference]: With dead ends: 19421 [2023-12-25 07:35:29,958 INFO L226 Difference]: Without dead ends: 6645 [2023-12-25 07:35:29,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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 07:35:29,967 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 29 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:29,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 140 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:29,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6645 states. [2023-12-25 07:35:30,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6645 to 6643. [2023-12-25 07:35:30,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6643 states, 6642 states have (on average 1.3274616079494128) internal successors, (8817), 6642 states have internal predecessors, (8817), 0 states have call successors, (0), 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 07:35:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6643 states to 6643 states and 8817 transitions. [2023-12-25 07:35:30,193 INFO L78 Accepts]: Start accepts. Automaton has 6643 states and 8817 transitions. Word has length 62 [2023-12-25 07:35:30,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:30,193 INFO L495 AbstractCegarLoop]: Abstraction has 6643 states and 8817 transitions. [2023-12-25 07:35:30,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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 07:35:30,193 INFO L276 IsEmpty]: Start isEmpty. Operand 6643 states and 8817 transitions. [2023-12-25 07:35:30,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 07:35:30,195 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:30,195 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] [2023-12-25 07:35:30,208 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 07:35:30,397 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 07:35:30,398 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:30,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:30,398 INFO L85 PathProgramCache]: Analyzing trace with hash 500734411, now seen corresponding path program 1 times [2023-12-25 07:35:30,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:30,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989508348] [2023-12-25 07:35:30,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:30,399 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 07:35:30,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:30,400 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 07:35:30,427 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 07:35:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:30,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 07:35:30,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:30,886 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:35:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:31,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:31,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989508348] [2023-12-25 07:35:31,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989508348] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:35:31,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:35:31,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 07:35:31,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345645706] [2023-12-25 07:35:31,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:35:31,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:35:31,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:31,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:35:31,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:35:31,070 INFO L87 Difference]: Start difference. First operand 6643 states and 8817 transitions. Second operand has 16 states, 16 states have (on average 7.25) internal successors, (116), 15 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:31,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:31,851 INFO L93 Difference]: Finished difference Result 24268 states and 32315 transitions. [2023-12-25 07:35:31,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 07:35:31,852 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.25) internal successors, (116), 15 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-12-25 07:35:31,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:31,918 INFO L225 Difference]: With dead ends: 24268 [2023-12-25 07:35:31,918 INFO L226 Difference]: Without dead ends: 17760 [2023-12-25 07:35:31,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2023-12-25 07:35:31,947 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 820 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:31,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 457 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 07:35:31,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17760 states. [2023-12-25 07:35:32,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17760 to 15737. [2023-12-25 07:35:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15737 states, 15736 states have (on average 1.3221276054905948) internal successors, (20805), 15736 states have internal predecessors, (20805), 0 states have call successors, (0), 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 07:35:32,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15737 states to 15737 states and 20805 transitions. [2023-12-25 07:35:32,419 INFO L78 Accepts]: Start accepts. Automaton has 15737 states and 20805 transitions. Word has length 62 [2023-12-25 07:35:32,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:32,420 INFO L495 AbstractCegarLoop]: Abstraction has 15737 states and 20805 transitions. [2023-12-25 07:35:32,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.25) internal successors, (116), 15 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand 15737 states and 20805 transitions. [2023-12-25 07:35:32,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 07:35:32,422 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:32,422 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] [2023-12-25 07:35:32,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-25 07:35:32,625 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 07:35:32,625 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:32,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:32,626 INFO L85 PathProgramCache]: Analyzing trace with hash 2076897688, now seen corresponding path program 1 times [2023-12-25 07:35:32,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:32,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659433661] [2023-12-25 07:35:32,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:32,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:32,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:32,627 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 07:35:32,655 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 07:35:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:32,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:35:32,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 07:35:32,719 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:35:32,775 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 07:35:32,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:32,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659433661] [2023-12-25 07:35:32,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659433661] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:35:32,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:35:32,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-25 07:35:32,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946567045] [2023-12-25 07:35:32,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:35:32,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 07:35:32,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:32,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 07:35:32,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:35:32,777 INFO L87 Difference]: Start difference. First operand 15737 states and 20805 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 07:35:33,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:33,707 INFO L93 Difference]: Finished difference Result 49731 states and 65382 transitions. [2023-12-25 07:35:33,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:35:33,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 07:35:33,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:33,750 INFO L225 Difference]: With dead ends: 49731 [2023-12-25 07:35:33,750 INFO L226 Difference]: Without dead ends: 34179 [2023-12-25 07:35:33,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:35:33,764 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 189 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:33,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 325 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:33,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34179 states. [2023-12-25 07:35:34,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34179 to 33815. [2023-12-25 07:35:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33815 states, 33814 states have (on average 1.2701839474773762) internal successors, (42950), 33814 states have internal predecessors, (42950), 0 states have call successors, (0), 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 07:35:34,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33815 states to 33815 states and 42950 transitions. [2023-12-25 07:35:34,849 INFO L78 Accepts]: Start accepts. Automaton has 33815 states and 42950 transitions. Word has length 63 [2023-12-25 07:35:34,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:34,849 INFO L495 AbstractCegarLoop]: Abstraction has 33815 states and 42950 transitions. [2023-12-25 07:35:34,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 07:35:34,850 INFO L276 IsEmpty]: Start isEmpty. Operand 33815 states and 42950 transitions. [2023-12-25 07:35:34,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 07:35:34,852 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:34,852 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] [2023-12-25 07:35:34,856 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 07:35:35,054 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 07:35:35,055 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:35,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:35,055 INFO L85 PathProgramCache]: Analyzing trace with hash -2077374834, now seen corresponding path program 1 times [2023-12-25 07:35:35,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:35,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112240793] [2023-12-25 07:35:35,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:35,056 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 07:35:35,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:35,057 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 07:35:35,061 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 07:35:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:35,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 07:35:35,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:35,717 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:35:35,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:35,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:35,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112240793] [2023-12-25 07:35:35,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112240793] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:35:35,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:35:35,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-25 07:35:35,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856050261] [2023-12-25 07:35:35,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:35:35,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:35:35,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:35,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:35:35,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:35:35,905 INFO L87 Difference]: Start difference. First operand 33815 states and 42950 transitions. Second operand has 16 states, 16 states have (on average 7.5) internal successors, (120), 16 states have internal predecessors, (120), 0 states have call successors, (0), 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 07:35:37,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:37,964 INFO L93 Difference]: Finished difference Result 87171 states and 110671 transitions. [2023-12-25 07:35:37,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 07:35:37,965 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.5) internal successors, (120), 16 states have internal predecessors, (120), 0 states have call successors, (0), 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 07:35:37,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:38,040 INFO L225 Difference]: With dead ends: 87171 [2023-12-25 07:35:38,040 INFO L226 Difference]: Without dead ends: 53763 [2023-12-25 07:35:38,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2023-12-25 07:35:38,085 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 1033 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:38,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 642 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 07:35:38,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53763 states. [2023-12-25 07:35:39,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53763 to 43949. [2023-12-25 07:35:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43949 states, 43948 states have (on average 1.2761217802857923) internal successors, (56083), 43948 states have internal predecessors, (56083), 0 states have call successors, (0), 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 07:35:39,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43949 states to 43949 states and 56083 transitions. [2023-12-25 07:35:39,797 INFO L78 Accepts]: Start accepts. Automaton has 43949 states and 56083 transitions. Word has length 63 [2023-12-25 07:35:39,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:39,797 INFO L495 AbstractCegarLoop]: Abstraction has 43949 states and 56083 transitions. [2023-12-25 07:35:39,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.5) internal successors, (120), 16 states have internal predecessors, (120), 0 states have call successors, (0), 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 07:35:39,797 INFO L276 IsEmpty]: Start isEmpty. Operand 43949 states and 56083 transitions. [2023-12-25 07:35:39,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 07:35:39,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:39,799 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] [2023-12-25 07:35:39,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-25 07:35:40,003 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 07:35:40,004 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:40,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:40,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1818270645, now seen corresponding path program 1 times [2023-12-25 07:35:40,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:40,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697219458] [2023-12-25 07:35:40,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:40,005 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 07:35:40,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:40,006 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 07:35:40,011 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 07:35:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:40,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:35:40,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:40,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:40,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:35:40,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:40,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:40,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697219458] [2023-12-25 07:35:40,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697219458] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:35:40,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:35:40,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 07:35:40,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702927941] [2023-12-25 07:35:40,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:35:40,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 07:35:40,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:40,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 07:35:40,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 07:35:40,187 INFO L87 Difference]: Start difference. First operand 43949 states and 56083 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 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 07:35:41,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:41,557 INFO L93 Difference]: Finished difference Result 74874 states and 95399 transitions. [2023-12-25 07:35:41,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 07:35:41,558 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 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 64 [2023-12-25 07:35:41,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:41,618 INFO L225 Difference]: With dead ends: 74874 [2023-12-25 07:35:41,619 INFO L226 Difference]: Without dead ends: 40737 [2023-12-25 07:35:41,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-25 07:35:41,637 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 256 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:41,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 210 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:41,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40737 states. [2023-12-25 07:35:43,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40737 to 38923. [2023-12-25 07:35:43,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38923 states, 38922 states have (on average 1.2623452032269669) internal successors, (49133), 38922 states have internal predecessors, (49133), 0 states have call successors, (0), 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 07:35:43,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38923 states to 38923 states and 49133 transitions. [2023-12-25 07:35:43,236 INFO L78 Accepts]: Start accepts. Automaton has 38923 states and 49133 transitions. Word has length 64 [2023-12-25 07:35:43,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:43,236 INFO L495 AbstractCegarLoop]: Abstraction has 38923 states and 49133 transitions. [2023-12-25 07:35:43,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 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 07:35:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 38923 states and 49133 transitions. [2023-12-25 07:35:43,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 07:35:43,238 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:43,238 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] [2023-12-25 07:35:43,241 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 07:35:43,440 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 07:35:43,440 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:43,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:43,441 INFO L85 PathProgramCache]: Analyzing trace with hash -460953503, now seen corresponding path program 1 times [2023-12-25 07:35:43,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:43,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306379551] [2023-12-25 07:35:43,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:43,441 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 07:35:43,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:43,442 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 07:35:43,444 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 07:35:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:43,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:35:43,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:43,618 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:35:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:43,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:43,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306379551] [2023-12-25 07:35:43,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306379551] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:35:43,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:35:43,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 07:35:43,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229007170] [2023-12-25 07:35:43,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:35:43,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 07:35:43,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:43,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 07:35:43,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 07:35:43,667 INFO L87 Difference]: Start difference. First operand 38923 states and 49133 transitions. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 0 states have call successors, (0), 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 07:35:44,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:44,723 INFO L93 Difference]: Finished difference Result 68266 states and 85540 transitions. [2023-12-25 07:35:44,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 07:35:44,724 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 0 states have call successors, (0), 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 64 [2023-12-25 07:35:44,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:44,920 INFO L225 Difference]: With dead ends: 68266 [2023-12-25 07:35:44,920 INFO L226 Difference]: Without dead ends: 29794 [2023-12-25 07:35:44,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-25 07:35:44,940 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 115 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:44,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 377 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:35:44,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29794 states. [2023-12-25 07:35:46,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29794 to 29406. [2023-12-25 07:35:46,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29406 states, 29405 states have (on average 1.2368644788301308) internal successors, (36370), 29405 states have internal predecessors, (36370), 0 states have call successors, (0), 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 07:35:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29406 states to 29406 states and 36370 transitions. [2023-12-25 07:35:46,093 INFO L78 Accepts]: Start accepts. Automaton has 29406 states and 36370 transitions. Word has length 64 [2023-12-25 07:35:46,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:46,094 INFO L495 AbstractCegarLoop]: Abstraction has 29406 states and 36370 transitions. [2023-12-25 07:35:46,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 0 states have call successors, (0), 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 07:35:46,094 INFO L276 IsEmpty]: Start isEmpty. Operand 29406 states and 36370 transitions. [2023-12-25 07:35:46,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 07:35:46,108 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:46,108 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] [2023-12-25 07:35:46,113 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 07:35:46,309 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 07:35:46,309 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:46,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:46,309 INFO L85 PathProgramCache]: Analyzing trace with hash -409115935, now seen corresponding path program 1 times [2023-12-25 07:35:46,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:46,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194569393] [2023-12-25 07:35:46,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:46,310 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 07:35:46,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:46,311 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 07:35:46,329 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 07:35:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:46,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:35:46,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:46,459 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 07:35:46,459 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:35:46,498 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 07:35:46,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:46,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194569393] [2023-12-25 07:35:46,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194569393] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:35:46,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:35:46,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 07:35:46,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052740608] [2023-12-25 07:35:46,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:35:46,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 07:35:46,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:46,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 07:35:46,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 07:35:46,500 INFO L87 Difference]: Start difference. First operand 29406 states and 36370 transitions. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 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 07:35:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:47,307 INFO L93 Difference]: Finished difference Result 52609 states and 64978 transitions. [2023-12-25 07:35:47,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 07:35:47,308 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 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 64 [2023-12-25 07:35:47,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:47,339 INFO L225 Difference]: With dead ends: 52609 [2023-12-25 07:35:47,339 INFO L226 Difference]: Without dead ends: 24401 [2023-12-25 07:35:47,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-25 07:35:47,363 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 234 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:47,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 324 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:35:47,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24401 states. [2023-12-25 07:35:48,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24401 to 24137. [2023-12-25 07:35:48,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24137 states, 24136 states have (on average 1.2222820682797482) internal successors, (29501), 24136 states have internal predecessors, (29501), 0 states have call successors, (0), 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 07:35:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24137 states to 24137 states and 29501 transitions. [2023-12-25 07:35:48,759 INFO L78 Accepts]: Start accepts. Automaton has 24137 states and 29501 transitions. Word has length 64 [2023-12-25 07:35:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:48,759 INFO L495 AbstractCegarLoop]: Abstraction has 24137 states and 29501 transitions. [2023-12-25 07:35:48,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 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 07:35:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 24137 states and 29501 transitions. [2023-12-25 07:35:48,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-25 07:35:48,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:48,766 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2023-12-25 07:35:48,768 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 07:35:48,968 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 07:35:48,968 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:48,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:48,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1740509148, now seen corresponding path program 1 times [2023-12-25 07:35:48,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:48,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466821012] [2023-12-25 07:35:48,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:48,969 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 07:35:48,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:48,970 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 07:35:48,977 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 07:35:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:49,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:49,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:49,071 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-25 07:35:49,072 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:49,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:49,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466821012] [2023-12-25 07:35:49,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466821012] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:49,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:49,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:49,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578506950] [2023-12-25 07:35:49,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:49,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:49,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:49,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:49,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:49,073 INFO L87 Difference]: Start difference. First operand 24137 states and 29501 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 07:35:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:49,758 INFO L93 Difference]: Finished difference Result 46022 states and 56340 transitions. [2023-12-25 07:35:49,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:49,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 07:35:49,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:49,788 INFO L225 Difference]: With dead ends: 46022 [2023-12-25 07:35:49,788 INFO L226 Difference]: Without dead ends: 23758 [2023-12-25 07:35:49,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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 07:35:49,804 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 38 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:49,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 184 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23758 states. [2023-12-25 07:35:50,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23758 to 20571. [2023-12-25 07:35:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20571 states, 20570 states have (on average 1.1938745746232378) internal successors, (24558), 20570 states have internal predecessors, (24558), 0 states have call successors, (0), 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 07:35:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20571 states to 20571 states and 24558 transitions. [2023-12-25 07:35:50,600 INFO L78 Accepts]: Start accepts. Automaton has 20571 states and 24558 transitions. Word has length 103 [2023-12-25 07:35:50,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:50,600 INFO L495 AbstractCegarLoop]: Abstraction has 20571 states and 24558 transitions. [2023-12-25 07:35:50,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 07:35:50,600 INFO L276 IsEmpty]: Start isEmpty. Operand 20571 states and 24558 transitions. [2023-12-25 07:35:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-25 07:35:50,605 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:50,605 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:35:50,610 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 (24)] Ended with exit code 0 [2023-12-25 07:35:50,811 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 07:35:50,812 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:50,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:50,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1533254796, now seen corresponding path program 1 times [2023-12-25 07:35:50,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:50,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95784184] [2023-12-25 07:35:50,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:50,812 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 07:35:50,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:50,814 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 07:35:50,815 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 07:35:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:50,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:50,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 07:35:50,910 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:50,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:50,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95784184] [2023-12-25 07:35:50,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95784184] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:50,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:50,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:50,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343226707] [2023-12-25 07:35:50,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:50,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:50,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:50,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:50,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:50,913 INFO L87 Difference]: Start difference. First operand 20571 states and 24558 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 07:35:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:51,379 INFO L93 Difference]: Finished difference Result 28359 states and 33866 transitions. [2023-12-25 07:35:51,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:51,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 105 [2023-12-25 07:35:51,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:51,397 INFO L225 Difference]: With dead ends: 28359 [2023-12-25 07:35:51,397 INFO L226 Difference]: Without dead ends: 16051 [2023-12-25 07:35:51,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 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 07:35:51,407 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 28 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:51,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 204 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:51,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16051 states. [2023-12-25 07:35:51,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16051 to 14209. [2023-12-25 07:35:51,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14209 states, 14208 states have (on average 1.1794763513513513) internal successors, (16758), 14208 states have internal predecessors, (16758), 0 states have call successors, (0), 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 07:35:52,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14209 states to 14209 states and 16758 transitions. [2023-12-25 07:35:52,008 INFO L78 Accepts]: Start accepts. Automaton has 14209 states and 16758 transitions. Word has length 105 [2023-12-25 07:35:52,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:52,008 INFO L495 AbstractCegarLoop]: Abstraction has 14209 states and 16758 transitions. [2023-12-25 07:35:52,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 07:35:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 14209 states and 16758 transitions. [2023-12-25 07:35:52,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-25 07:35:52,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:52,011 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:35:52,014 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 07:35:52,214 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 07:35:52,215 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:52,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:52,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1217443020, now seen corresponding path program 1 times [2023-12-25 07:35:52,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:52,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280862058] [2023-12-25 07:35:52,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:52,216 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 07:35:52,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:52,217 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 07:35:52,219 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 07:35:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:52,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:52,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 07:35:52,311 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:52,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:52,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280862058] [2023-12-25 07:35:52,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280862058] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:52,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:52,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:52,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708380497] [2023-12-25 07:35:52,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:52,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:52,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:52,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:52,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:52,312 INFO L87 Difference]: Start difference. First operand 14209 states and 16758 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 07:35:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:52,640 INFO L93 Difference]: Finished difference Result 19357 states and 22790 transitions. [2023-12-25 07:35:52,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:52,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 105 [2023-12-25 07:35:52,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:52,651 INFO L225 Difference]: With dead ends: 19357 [2023-12-25 07:35:52,652 INFO L226 Difference]: Without dead ends: 10698 [2023-12-25 07:35:52,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 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 07:35:52,658 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 37 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:52,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 200 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:52,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10698 states. [2023-12-25 07:35:52,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10698 to 9012. [2023-12-25 07:35:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9012 states, 9011 states have (on average 1.1626900454999445) internal successors, (10477), 9011 states have internal predecessors, (10477), 0 states have call successors, (0), 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 07:35:52,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9012 states to 9012 states and 10477 transitions. [2023-12-25 07:35:52,980 INFO L78 Accepts]: Start accepts. Automaton has 9012 states and 10477 transitions. Word has length 105 [2023-12-25 07:35:52,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:52,981 INFO L495 AbstractCegarLoop]: Abstraction has 9012 states and 10477 transitions. [2023-12-25 07:35:52,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 07:35:52,981 INFO L276 IsEmpty]: Start isEmpty. Operand 9012 states and 10477 transitions. [2023-12-25 07:35:52,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-25 07:35:52,983 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:52,983 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:35:52,986 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 07:35:53,186 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 07:35:53,186 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:53,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:53,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1294499372, now seen corresponding path program 1 times [2023-12-25 07:35:53,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:53,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930601404] [2023-12-25 07:35:53,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:53,187 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 07:35:53,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:53,189 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 07:35:53,190 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 07:35:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:53,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:53,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:53,296 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-25 07:35:53,296 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:53,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:53,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930601404] [2023-12-25 07:35:53,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930601404] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:53,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:53,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:53,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601093151] [2023-12-25 07:35:53,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:53,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:53,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:53,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:53,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:53,299 INFO L87 Difference]: Start difference. First operand 9012 states and 10477 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 07:35:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:53,616 INFO L93 Difference]: Finished difference Result 14060 states and 16352 transitions. [2023-12-25 07:35:53,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:53,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 105 [2023-12-25 07:35:53,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:53,625 INFO L225 Difference]: With dead ends: 14060 [2023-12-25 07:35:53,626 INFO L226 Difference]: Without dead ends: 8707 [2023-12-25 07:35:53,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 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 07:35:53,630 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 28 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:53,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 205 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8707 states. [2023-12-25 07:35:53,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8707 to 7513. [2023-12-25 07:35:53,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7513 states, 7512 states have (on average 1.1537539936102237) internal successors, (8667), 7512 states have internal predecessors, (8667), 0 states have call successors, (0), 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 07:35:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7513 states to 7513 states and 8667 transitions. [2023-12-25 07:35:53,908 INFO L78 Accepts]: Start accepts. Automaton has 7513 states and 8667 transitions. Word has length 105 [2023-12-25 07:35:53,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:53,908 INFO L495 AbstractCegarLoop]: Abstraction has 7513 states and 8667 transitions. [2023-12-25 07:35:53,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 07:35:53,908 INFO L276 IsEmpty]: Start isEmpty. Operand 7513 states and 8667 transitions. [2023-12-25 07:35:53,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-25 07:35:53,910 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:53,910 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:35:53,913 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 (27)] Ended with exit code 0 [2023-12-25 07:35:54,113 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 07:35:54,113 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:54,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:54,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1428832414, now seen corresponding path program 1 times [2023-12-25 07:35:54,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:54,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721388502] [2023-12-25 07:35:54,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:54,114 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 07:35:54,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:54,115 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 07:35:54,117 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 07:35:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:54,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 07:35:54,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 21 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:54,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:35:55,240 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 21 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:55,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:55,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721388502] [2023-12-25 07:35:55,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721388502] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:35:55,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:35:55,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-25 07:35:55,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931658601] [2023-12-25 07:35:55,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:35:55,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:35:55,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:55,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:35:55,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:35:55,244 INFO L87 Difference]: Start difference. First operand 7513 states and 8667 transitions. Second operand has 26 states, 26 states have (on average 7.730769230769231) internal successors, (201), 25 states have internal predecessors, (201), 0 states have call successors, (0), 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 07:35:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:57,656 INFO L93 Difference]: Finished difference Result 13759 states and 15966 transitions. [2023-12-25 07:35:57,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-25 07:35:57,657 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.730769230769231) internal successors, (201), 25 states have internal predecessors, (201), 0 states have call successors, (0), 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 07:35:57,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:57,666 INFO L225 Difference]: With dead ends: 13759 [2023-12-25 07:35:57,666 INFO L226 Difference]: Without dead ends: 7918 [2023-12-25 07:35:57,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=725, Invalid=3057, Unknown=0, NotChecked=0, Total=3782 [2023-12-25 07:35:57,673 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 1128 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:57,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1128 Valid, 1414 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-25 07:35:57,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7918 states. [2023-12-25 07:35:57,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7918 to 4586. [2023-12-25 07:35:57,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4586 states, 4585 states have (on average 1.1456924754634679) internal successors, (5253), 4585 states have internal predecessors, (5253), 0 states have call successors, (0), 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 07:35:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4586 states to 4586 states and 5253 transitions. [2023-12-25 07:35:57,964 INFO L78 Accepts]: Start accepts. Automaton has 4586 states and 5253 transitions. Word has length 107 [2023-12-25 07:35:57,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:57,964 INFO L495 AbstractCegarLoop]: Abstraction has 4586 states and 5253 transitions. [2023-12-25 07:35:57,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.730769230769231) internal successors, (201), 25 states have internal predecessors, (201), 0 states have call successors, (0), 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 07:35:57,964 INFO L276 IsEmpty]: Start isEmpty. Operand 4586 states and 5253 transitions. [2023-12-25 07:35:57,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-25 07:35:57,965 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:57,966 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2023-12-25 07:35:57,969 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 07:35:58,168 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 07:35:58,169 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:58,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:58,169 INFO L85 PathProgramCache]: Analyzing trace with hash -947165740, now seen corresponding path program 1 times [2023-12-25 07:35:58,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:58,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059725950] [2023-12-25 07:35:58,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:58,170 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 07:35:58,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:58,171 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 07:35:58,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-25 07:35:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:58,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:35:58,228 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 13 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:59,194 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:35:59,648 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 13 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:59,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:59,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059725950] [2023-12-25 07:35:59,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059725950] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:35:59,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:35:59,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-25 07:35:59,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149303404] [2023-12-25 07:35:59,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:35:59,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:35:59,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:59,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:35:59,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:35:59,650 INFO L87 Difference]: Start difference. First operand 4586 states and 5253 transitions. Second operand has 26 states, 26 states have (on average 8.0) internal successors, (208), 26 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:03,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:03,060 INFO L93 Difference]: Finished difference Result 7810 states and 9010 transitions. [2023-12-25 07:36:03,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-25 07:36:03,060 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.0) internal successors, (208), 26 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-12-25 07:36:03,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:03,067 INFO L225 Difference]: With dead ends: 7810 [2023-12-25 07:36:03,068 INFO L226 Difference]: Without dead ends: 6662 [2023-12-25 07:36:03,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=647, Invalid=3385, Unknown=0, NotChecked=0, Total=4032 [2023-12-25 07:36:03,071 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 902 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 1856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:03,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 1811 Invalid, 1856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1828 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-25 07:36:03,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6662 states. [2023-12-25 07:36:03,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6662 to 5150. [2023-12-25 07:36:03,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5150 states, 5149 states have (on average 1.1481841134200816) internal successors, (5912), 5149 states have internal predecessors, (5912), 0 states have call successors, (0), 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 07:36:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5150 states to 5150 states and 5912 transitions. [2023-12-25 07:36:03,330 INFO L78 Accepts]: Start accepts. Automaton has 5150 states and 5912 transitions. Word has length 107 [2023-12-25 07:36:03,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:03,331 INFO L495 AbstractCegarLoop]: Abstraction has 5150 states and 5912 transitions. [2023-12-25 07:36:03,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.0) internal successors, (208), 26 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:03,331 INFO L276 IsEmpty]: Start isEmpty. Operand 5150 states and 5912 transitions. [2023-12-25 07:36:03,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-25 07:36:03,332 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:03,332 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2023-12-25 07:36:03,337 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 07:36:03,535 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 07:36:03,535 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:03,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:03,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1832257480, now seen corresponding path program 1 times [2023-12-25 07:36:03,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:03,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438998819] [2023-12-25 07:36:03,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:03,536 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 07:36:03,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:03,537 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 07:36:03,539 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 07:36:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:03,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:36:03,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 32 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:04,509 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 32 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:04,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:04,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438998819] [2023-12-25 07:36:04,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438998819] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:04,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:04,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-25 07:36:04,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643043754] [2023-12-25 07:36:04,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:04,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:36:04,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:04,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:36:04,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:36:04,989 INFO L87 Difference]: Start difference. First operand 5150 states and 5912 transitions. Second operand has 26 states, 26 states have (on average 7.576923076923077) internal successors, (197), 26 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:11,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:11,253 INFO L93 Difference]: Finished difference Result 10618 states and 12189 transitions. [2023-12-25 07:36:11,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-12-25 07:36:11,254 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.576923076923077) internal successors, (197), 26 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-12-25 07:36:11,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:11,264 INFO L225 Difference]: With dead ends: 10618 [2023-12-25 07:36:11,265 INFO L226 Difference]: Without dead ends: 9547 [2023-12-25 07:36:11,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1381, Invalid=6629, Unknown=0, NotChecked=0, Total=8010 [2023-12-25 07:36:11,270 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 1041 mSDsluCounter, 2936 mSDsCounter, 0 mSdLazyCounter, 2965 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 3145 SdHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:11,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 3145 Invalid, 3003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2965 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-25 07:36:11,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9547 states. [2023-12-25 07:36:11,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9547 to 6530. [2023-12-25 07:36:11,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6530 states, 6529 states have (on average 1.1484147648950835) internal successors, (7498), 6529 states have internal predecessors, (7498), 0 states have call successors, (0), 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 07:36:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6530 states to 6530 states and 7498 transitions. [2023-12-25 07:36:11,648 INFO L78 Accepts]: Start accepts. Automaton has 6530 states and 7498 transitions. Word has length 107 [2023-12-25 07:36:11,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:11,648 INFO L495 AbstractCegarLoop]: Abstraction has 6530 states and 7498 transitions. [2023-12-25 07:36:11,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.576923076923077) internal successors, (197), 26 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:11,649 INFO L276 IsEmpty]: Start isEmpty. Operand 6530 states and 7498 transitions. [2023-12-25 07:36:11,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-25 07:36:11,650 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:11,650 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2023-12-25 07:36:11,653 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 07:36:11,853 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 07:36:11,853 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:11,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:11,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1306424014, now seen corresponding path program 1 times [2023-12-25 07:36:11,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:11,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575599269] [2023-12-25 07:36:11,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:11,854 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 07:36:11,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:11,855 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 07:36:11,856 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 07:36:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:11,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:36:11,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:12,753 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 23 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:12,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:13,207 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 23 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:13,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:13,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575599269] [2023-12-25 07:36:13,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575599269] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:13,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:13,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-25 07:36:13,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545740445] [2023-12-25 07:36:13,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:13,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:36:13,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:13,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:36:13,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:36:13,209 INFO L87 Difference]: Start difference. First operand 6530 states and 7498 transitions. Second operand has 26 states, 26 states have (on average 7.769230769230769) internal successors, (202), 26 states have internal predecessors, (202), 0 states have call successors, (0), 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 07:36:19,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:19,032 INFO L93 Difference]: Finished difference Result 11413 states and 13036 transitions. [2023-12-25 07:36:19,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-12-25 07:36:19,033 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.769230769230769) internal successors, (202), 26 states have internal predecessors, (202), 0 states have call successors, (0), 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 07:36:19,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:19,044 INFO L225 Difference]: With dead ends: 11413 [2023-12-25 07:36:19,044 INFO L226 Difference]: Without dead ends: 10690 [2023-12-25 07:36:19,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1265, Invalid=6045, Unknown=0, NotChecked=0, Total=7310 [2023-12-25 07:36:19,049 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 1302 mSDsluCounter, 2305 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1302 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 2360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:19,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1302 Valid, 2482 Invalid, 2360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-25 07:36:19,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10690 states. [2023-12-25 07:36:19,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10690 to 8040. [2023-12-25 07:36:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8040 states, 8039 states have (on average 1.1433014056474686) internal successors, (9191), 8039 states have internal predecessors, (9191), 0 states have call successors, (0), 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 07:36:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8040 states to 8040 states and 9191 transitions. [2023-12-25 07:36:19,559 INFO L78 Accepts]: Start accepts. Automaton has 8040 states and 9191 transitions. Word has length 107 [2023-12-25 07:36:19,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:19,560 INFO L495 AbstractCegarLoop]: Abstraction has 8040 states and 9191 transitions. [2023-12-25 07:36:19,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.769230769230769) internal successors, (202), 26 states have internal predecessors, (202), 0 states have call successors, (0), 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 07:36:19,560 INFO L276 IsEmpty]: Start isEmpty. Operand 8040 states and 9191 transitions. [2023-12-25 07:36:19,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-25 07:36:19,564 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:19,564 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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 07:36:19,566 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 (31)] Ended with exit code 0 [2023-12-25 07:36:19,766 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 07:36:19,766 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:19,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:19,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1577055368, now seen corresponding path program 2 times [2023-12-25 07:36:19,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:19,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21160765] [2023-12-25 07:36:19,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 07:36:19,767 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 07:36:19,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:19,769 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 07:36:19,778 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 07:36:19,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 07:36:19,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 07:36:19,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 07:36:19,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 132 proven. 24 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-25 07:36:20,415 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:20,629 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 132 proven. 24 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-25 07:36:20,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:20,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21160765] [2023-12-25 07:36:20,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21160765] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:20,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:20,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2023-12-25 07:36:20,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605775246] [2023-12-25 07:36:20,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:20,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 07:36:20,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:20,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 07:36:20,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-12-25 07:36:20,631 INFO L87 Difference]: Start difference. First operand 8040 states and 9191 transitions. Second operand has 18 states, 18 states have (on average 9.777777777777779) internal successors, (176), 18 states have internal predecessors, (176), 0 states have call successors, (0), 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 07:36:22,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:22,785 INFO L93 Difference]: Finished difference Result 10558 states and 12112 transitions. [2023-12-25 07:36:22,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-25 07:36:22,786 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 9.777777777777779) internal successors, (176), 18 states have internal predecessors, (176), 0 states have call successors, (0), 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 145 [2023-12-25 07:36:22,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:22,795 INFO L225 Difference]: With dead ends: 10558 [2023-12-25 07:36:22,795 INFO L226 Difference]: Without dead ends: 8336 [2023-12-25 07:36:22,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=431, Invalid=1549, Unknown=0, NotChecked=0, Total=1980 [2023-12-25 07:36:22,798 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 692 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:22,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1466 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 07:36:22,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8336 states. [2023-12-25 07:36:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8336 to 7800. [2023-12-25 07:36:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7800 states, 7799 states have (on average 1.14322349019105) internal successors, (8916), 7799 states have internal predecessors, (8916), 0 states have call successors, (0), 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 07:36:23,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7800 states to 7800 states and 8916 transitions. [2023-12-25 07:36:23,291 INFO L78 Accepts]: Start accepts. Automaton has 7800 states and 8916 transitions. Word has length 145 [2023-12-25 07:36:23,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:23,291 INFO L495 AbstractCegarLoop]: Abstraction has 7800 states and 8916 transitions. [2023-12-25 07:36:23,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.777777777777779) internal successors, (176), 18 states have internal predecessors, (176), 0 states have call successors, (0), 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 07:36:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 7800 states and 8916 transitions. [2023-12-25 07:36:23,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-25 07:36:23,295 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:23,295 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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 07:36:23,298 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 (32)] Ended with exit code 0 [2023-12-25 07:36:23,497 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 07:36:23,498 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:23,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:23,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1947825414, now seen corresponding path program 1 times [2023-12-25 07:36:23,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:23,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474455866] [2023-12-25 07:36:23,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:23,499 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 07:36:23,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:23,500 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 07:36:23,504 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 07:36:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:23,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 07:36:23,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:24,019 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 130 proven. 18 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-12-25 07:36:24,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:24,252 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 130 proven. 18 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-12-25 07:36:24,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:24,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474455866] [2023-12-25 07:36:24,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474455866] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:24,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:24,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2023-12-25 07:36:24,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953930853] [2023-12-25 07:36:24,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:24,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 07:36:24,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:24,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 07:36:24,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-12-25 07:36:24,253 INFO L87 Difference]: Start difference. First operand 7800 states and 8916 transitions. Second operand has 18 states, 18 states have (on average 9.333333333333334) internal successors, (168), 18 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:26,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:26,448 INFO L93 Difference]: Finished difference Result 12307 states and 14062 transitions. [2023-12-25 07:36:26,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-25 07:36:26,449 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 9.333333333333334) internal successors, (168), 18 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2023-12-25 07:36:26,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:26,456 INFO L225 Difference]: With dead ends: 12307 [2023-12-25 07:36:26,456 INFO L226 Difference]: Without dead ends: 9495 [2023-12-25 07:36:26,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=365, Invalid=1117, Unknown=0, NotChecked=0, Total=1482 [2023-12-25 07:36:26,459 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 669 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:26,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1640 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 07:36:26,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9495 states. [2023-12-25 07:36:26,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9495 to 8036. [2023-12-25 07:36:26,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8036 states, 8035 states have (on average 1.1439950217797137) internal successors, (9192), 8035 states have internal predecessors, (9192), 0 states have call successors, (0), 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 07:36:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8036 states to 8036 states and 9192 transitions. [2023-12-25 07:36:26,970 INFO L78 Accepts]: Start accepts. Automaton has 8036 states and 9192 transitions. Word has length 145 [2023-12-25 07:36:26,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:26,970 INFO L495 AbstractCegarLoop]: Abstraction has 8036 states and 9192 transitions. [2023-12-25 07:36:26,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.333333333333334) internal successors, (168), 18 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:26,971 INFO L276 IsEmpty]: Start isEmpty. Operand 8036 states and 9192 transitions. [2023-12-25 07:36:26,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-25 07:36:26,974 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:26,974 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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 07:36:26,976 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 07:36:27,176 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 07:36:27,176 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:27,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:27,177 INFO L85 PathProgramCache]: Analyzing trace with hash 257460900, now seen corresponding path program 1 times [2023-12-25 07:36:27,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:27,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774234552] [2023-12-25 07:36:27,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:27,177 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 07:36:27,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:27,178 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 07:36:27,180 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 07:36:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:27,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:36:27,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:27,431 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-25 07:36:27,432 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:36:27,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:27,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774234552] [2023-12-25 07:36:27,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774234552] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:36:27,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:36:27,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:36:27,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338635252] [2023-12-25 07:36:27,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:36:27,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:36:27,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:27,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:36:27,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:36:27,433 INFO L87 Difference]: Start difference. First operand 8036 states and 9192 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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 07:36:27,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:27,909 INFO L93 Difference]: Finished difference Result 8042 states and 9195 transitions. [2023-12-25 07:36:27,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:36:27,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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 145 [2023-12-25 07:36:27,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:27,917 INFO L225 Difference]: With dead ends: 8042 [2023-12-25 07:36:27,917 INFO L226 Difference]: Without dead ends: 7904 [2023-12-25 07:36:27,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 141 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 07:36:27,919 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 197 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:27,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 222 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:36:27,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7904 states. [2023-12-25 07:36:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7904 to 7900. [2023-12-25 07:36:28,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7900 states, 7899 states have (on average 1.1457146474237245) internal successors, (9050), 7899 states have internal predecessors, (9050), 0 states have call successors, (0), 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 07:36:28,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 9050 transitions. [2023-12-25 07:36:28,518 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 9050 transitions. Word has length 145 [2023-12-25 07:36:28,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:28,519 INFO L495 AbstractCegarLoop]: Abstraction has 7900 states and 9050 transitions. [2023-12-25 07:36:28,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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 07:36:28,519 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 9050 transitions. [2023-12-25 07:36:28,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-25 07:36:28,522 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:28,522 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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 07:36:28,524 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 07:36:28,724 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 07:36:28,725 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:28,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:28,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2024869226, now seen corresponding path program 1 times [2023-12-25 07:36:28,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:28,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584048140] [2023-12-25 07:36:28,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:28,726 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 07:36:28,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:28,726 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 07:36:28,730 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 07:36:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:28,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 07:36:28,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 134 proven. 31 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-25 07:36:29,323 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:29,554 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 134 proven. 31 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-25 07:36:29,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:29,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584048140] [2023-12-25 07:36:29,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584048140] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:29,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:29,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2023-12-25 07:36:29,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369277300] [2023-12-25 07:36:29,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:29,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 07:36:29,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:29,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 07:36:29,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-12-25 07:36:29,556 INFO L87 Difference]: Start difference. First operand 7900 states and 9050 transitions. Second operand has 18 states, 18 states have (on average 10.333333333333334) internal successors, (186), 18 states have internal predecessors, (186), 0 states have call successors, (0), 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 07:36:31,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:31,710 INFO L93 Difference]: Finished difference Result 10661 states and 12229 transitions. [2023-12-25 07:36:31,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-25 07:36:31,711 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 10.333333333333334) internal successors, (186), 18 states have internal predecessors, (186), 0 states have call successors, (0), 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 145 [2023-12-25 07:36:31,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:31,719 INFO L225 Difference]: With dead ends: 10661 [2023-12-25 07:36:31,719 INFO L226 Difference]: Without dead ends: 7952 [2023-12-25 07:36:31,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=392, Invalid=1414, Unknown=0, NotChecked=0, Total=1806 [2023-12-25 07:36:31,723 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 935 mSDsluCounter, 1391 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:31,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 1540 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 07:36:31,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7952 states. [2023-12-25 07:36:32,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7952 to 7199. [2023-12-25 07:36:32,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7199 states, 7198 states have (on average 1.1415671019727702) internal successors, (8217), 7198 states have internal predecessors, (8217), 0 states have call successors, (0), 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 07:36:32,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7199 states to 7199 states and 8217 transitions. [2023-12-25 07:36:32,189 INFO L78 Accepts]: Start accepts. Automaton has 7199 states and 8217 transitions. Word has length 145 [2023-12-25 07:36:32,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:32,189 INFO L495 AbstractCegarLoop]: Abstraction has 7199 states and 8217 transitions. [2023-12-25 07:36:32,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.333333333333334) internal successors, (186), 18 states have internal predecessors, (186), 0 states have call successors, (0), 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 07:36:32,189 INFO L276 IsEmpty]: Start isEmpty. Operand 7199 states and 8217 transitions. [2023-12-25 07:36:32,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-25 07:36:32,192 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:32,192 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-25 07:36:32,195 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 07:36:32,394 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 07:36:32,395 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:32,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:32,395 INFO L85 PathProgramCache]: Analyzing trace with hash -420541532, now seen corresponding path program 1 times [2023-12-25 07:36:32,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:32,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500414792] [2023-12-25 07:36:32,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:32,396 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 07:36:32,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:32,397 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 07:36:32,398 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 07:36:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:32,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 07:36:32,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:33,616 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 95 proven. 127 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 07:36:33,616 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:34,056 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 95 proven. 127 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 07:36:34,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:34,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500414792] [2023-12-25 07:36:34,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500414792] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:34,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:34,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2023-12-25 07:36:34,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483058919] [2023-12-25 07:36:34,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:34,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-25 07:36:34,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:34,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-25 07:36:34,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2023-12-25 07:36:34,058 INFO L87 Difference]: Start difference. First operand 7199 states and 8217 transitions. Second operand has 28 states, 28 states have (on average 9.321428571428571) internal successors, (261), 28 states have internal predecessors, (261), 0 states have call successors, (0), 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 07:36:42,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:42,138 INFO L93 Difference]: Finished difference Result 9825 states and 11255 transitions. [2023-12-25 07:36:42,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-12-25 07:36:42,138 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.321428571428571) internal successors, (261), 28 states have internal predecessors, (261), 0 states have call successors, (0), 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 147 [2023-12-25 07:36:42,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:42,147 INFO L225 Difference]: With dead ends: 9825 [2023-12-25 07:36:42,147 INFO L226 Difference]: Without dead ends: 8625 [2023-12-25 07:36:42,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3299 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1602, Invalid=10388, Unknown=0, NotChecked=0, Total=11990 [2023-12-25 07:36:42,152 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 1016 mSDsluCounter, 3660 mSDsCounter, 0 mSdLazyCounter, 3962 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 3863 SdHoareTripleChecker+Invalid, 3996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:42,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 3863 Invalid, 3996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3962 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-25 07:36:42,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8625 states. [2023-12-25 07:36:42,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8625 to 7365. [2023-12-25 07:36:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7365 states, 7364 states have (on average 1.1390548614883216) internal successors, (8388), 7364 states have internal predecessors, (8388), 0 states have call successors, (0), 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 07:36:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7365 states to 7365 states and 8388 transitions. [2023-12-25 07:36:42,698 INFO L78 Accepts]: Start accepts. Automaton has 7365 states and 8388 transitions. Word has length 147 [2023-12-25 07:36:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:42,698 INFO L495 AbstractCegarLoop]: Abstraction has 7365 states and 8388 transitions. [2023-12-25 07:36:42,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.321428571428571) internal successors, (261), 28 states have internal predecessors, (261), 0 states have call successors, (0), 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 07:36:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 7365 states and 8388 transitions. [2023-12-25 07:36:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-25 07:36:42,700 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:42,701 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:36:42,705 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 (36)] Forceful destruction successful, exit code 0 [2023-12-25 07:36:42,903 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 07:36:42,903 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:42,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:42,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1122141406, now seen corresponding path program 1 times [2023-12-25 07:36:42,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:42,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742868942] [2023-12-25 07:36:42,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:42,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:42,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:42,905 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 07:36:42,931 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 07:36:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:42,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 07:36:42,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:44,158 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 58 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:44,158 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:44,641 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 58 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:44,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:44,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742868942] [2023-12-25 07:36:44,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742868942] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:44,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:44,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2023-12-25 07:36:44,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241567875] [2023-12-25 07:36:44,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:44,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-25 07:36:44,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:44,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-25 07:36:44,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1124, Unknown=0, NotChecked=0, Total=1260 [2023-12-25 07:36:44,643 INFO L87 Difference]: Start difference. First operand 7365 states and 8388 transitions. Second operand has 36 states, 36 states have (on average 7.666666666666667) internal successors, (276), 35 states have internal predecessors, (276), 0 states have call successors, (0), 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 07:37:10,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:37:10,437 INFO L93 Difference]: Finished difference Result 22142 states and 25447 transitions. [2023-12-25 07:37:10,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 368 states. [2023-12-25 07:37:10,438 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 7.666666666666667) internal successors, (276), 35 states have internal predecessors, (276), 0 states have call successors, (0), 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 147 [2023-12-25 07:37:10,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:37:10,455 INFO L225 Difference]: With dead ends: 22142 [2023-12-25 07:37:10,455 INFO L226 Difference]: Without dead ends: 18982 [2023-12-25 07:37:10,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66862 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=14258, Invalid=146944, Unknown=0, NotChecked=0, Total=161202 [2023-12-25 07:37:10,470 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 3253 mSDsluCounter, 3512 mSDsCounter, 0 mSdLazyCounter, 4103 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3253 SdHoareTripleChecker+Valid, 3696 SdHoareTripleChecker+Invalid, 4209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 4103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-25 07:37:10,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3253 Valid, 3696 Invalid, 4209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 4103 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-12-25 07:37:10,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18982 states. [2023-12-25 07:37:11,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18982 to 7205. [2023-12-25 07:37:11,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7205 states, 7204 states have (on average 1.1345086063298169) internal successors, (8173), 7204 states have internal predecessors, (8173), 0 states have call successors, (0), 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 07:37:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7205 states to 7205 states and 8173 transitions. [2023-12-25 07:37:11,079 INFO L78 Accepts]: Start accepts. Automaton has 7205 states and 8173 transitions. Word has length 147 [2023-12-25 07:37:11,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:37:11,080 INFO L495 AbstractCegarLoop]: Abstraction has 7205 states and 8173 transitions. [2023-12-25 07:37:11,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.666666666666667) internal successors, (276), 35 states have internal predecessors, (276), 0 states have call successors, (0), 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 07:37:11,080 INFO L276 IsEmpty]: Start isEmpty. Operand 7205 states and 8173 transitions. [2023-12-25 07:37:11,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-25 07:37:11,083 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:37:11,083 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-25 07:37:11,087 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 07:37:11,285 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 07:37:11,286 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:37:11,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:37:11,287 INFO L85 PathProgramCache]: Analyzing trace with hash 711854310, now seen corresponding path program 1 times [2023-12-25 07:37:11,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:37:11,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104475375] [2023-12-25 07:37:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:37:11,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:37:11,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:37:11,288 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 07:37:11,291 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 07:37:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:37:11,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 07:37:11,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:37:12,531 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 105 proven. 115 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 07:37:12,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:37:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 105 proven. 115 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 07:37:12,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:37:12,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104475375] [2023-12-25 07:37:12,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104475375] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:37:12,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:37:12,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2023-12-25 07:37:12,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332308082] [2023-12-25 07:37:12,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:37:12,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-25 07:37:12,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:37:12,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-25 07:37:12,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2023-12-25 07:37:12,966 INFO L87 Difference]: Start difference. First operand 7205 states and 8173 transitions. Second operand has 28 states, 28 states have (on average 9.142857142857142) internal successors, (256), 28 states have internal predecessors, (256), 0 states have call successors, (0), 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 07:37:23,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:37:23,836 INFO L93 Difference]: Finished difference Result 10235 states and 11628 transitions. [2023-12-25 07:37:23,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2023-12-25 07:37:23,836 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.142857142857142) internal successors, (256), 28 states have internal predecessors, (256), 0 states have call successors, (0), 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 147 [2023-12-25 07:37:23,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:37:23,846 INFO L225 Difference]: With dead ends: 10235 [2023-12-25 07:37:23,846 INFO L226 Difference]: Without dead ends: 8879 [2023-12-25 07:37:23,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6331 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2992, Invalid=17600, Unknown=0, NotChecked=0, Total=20592 [2023-12-25 07:37:23,850 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 1523 mSDsluCounter, 3131 mSDsCounter, 0 mSdLazyCounter, 3269 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 3380 SdHoareTripleChecker+Invalid, 3321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 3269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:37:23,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 3380 Invalid, 3321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 3269 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-25 07:37:23,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8879 states. [2023-12-25 07:37:24,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8879 to 7347. [2023-12-25 07:37:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7347 states, 7346 states have (on average 1.1335420637081406) internal successors, (8327), 7346 states have internal predecessors, (8327), 0 states have call successors, (0), 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 07:37:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7347 states to 7347 states and 8327 transitions. [2023-12-25 07:37:24,439 INFO L78 Accepts]: Start accepts. Automaton has 7347 states and 8327 transitions. Word has length 147 [2023-12-25 07:37:24,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:37:24,440 INFO L495 AbstractCegarLoop]: Abstraction has 7347 states and 8327 transitions. [2023-12-25 07:37:24,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.142857142857142) internal successors, (256), 28 states have internal predecessors, (256), 0 states have call successors, (0), 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 07:37:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 7347 states and 8327 transitions. [2023-12-25 07:37:24,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-25 07:37:24,442 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:37:24,443 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-25 07:37:24,445 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 (38)] Ended with exit code 0 [2023-12-25 07:37:24,644 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 07:37:24,644 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:37:24,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:37:24,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1872707786, now seen corresponding path program 1 times [2023-12-25 07:37:24,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:37:24,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821831583] [2023-12-25 07:37:24,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:37:24,645 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 07:37:24,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:37:24,652 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 07:37:24,660 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 07:37:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:37:24,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 07:37:24,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:37:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 117 proven. 101 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 07:37:25,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:37:26,097 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 117 proven. 101 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 07:37:26,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:37:26,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821831583] [2023-12-25 07:37:26,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821831583] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:37:26,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:37:26,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2023-12-25 07:37:26,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130829972] [2023-12-25 07:37:26,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:37:26,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-25 07:37:26,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:37:26,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-25 07:37:26,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2023-12-25 07:37:26,099 INFO L87 Difference]: Start difference. First operand 7347 states and 8327 transitions. Second operand has 28 states, 28 states have (on average 8.928571428571429) internal successors, (250), 28 states have internal predecessors, (250), 0 states have call successors, (0), 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 07:37:35,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:37:35,573 INFO L93 Difference]: Finished difference Result 11109 states and 12587 transitions. [2023-12-25 07:37:35,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-12-25 07:37:35,574 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.928571428571429) internal successors, (250), 28 states have internal predecessors, (250), 0 states have call successors, (0), 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 147 [2023-12-25 07:37:35,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:37:35,585 INFO L225 Difference]: With dead ends: 11109 [2023-12-25 07:37:35,585 INFO L226 Difference]: Without dead ends: 9765 [2023-12-25 07:37:35,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3610 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2019, Invalid=11091, Unknown=0, NotChecked=0, Total=13110 [2023-12-25 07:37:35,590 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 1313 mSDsluCounter, 4345 mSDsCounter, 0 mSdLazyCounter, 4256 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 4595 SdHoareTripleChecker+Invalid, 4303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 4256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:37:35,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1313 Valid, 4595 Invalid, 4303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 4256 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-12-25 07:37:35,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9765 states. [2023-12-25 07:37:36,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9765 to 7433. [2023-12-25 07:37:36,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7433 states, 7432 states have (on average 1.133880516684607) internal successors, (8427), 7432 states have internal predecessors, (8427), 0 states have call successors, (0), 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 07:37:36,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7433 states to 7433 states and 8427 transitions. [2023-12-25 07:37:36,280 INFO L78 Accepts]: Start accepts. Automaton has 7433 states and 8427 transitions. Word has length 147 [2023-12-25 07:37:36,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:37:36,280 INFO L495 AbstractCegarLoop]: Abstraction has 7433 states and 8427 transitions. [2023-12-25 07:37:36,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.928571428571429) internal successors, (250), 28 states have internal predecessors, (250), 0 states have call successors, (0), 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 07:37:36,280 INFO L276 IsEmpty]: Start isEmpty. Operand 7433 states and 8427 transitions. [2023-12-25 07:37:36,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-25 07:37:36,283 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:37:36,284 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 07:37:36,289 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 07:37:36,487 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 07:37:36,487 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:37:36,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:37:36,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1785492311, now seen corresponding path program 1 times [2023-12-25 07:37:36,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:37:36,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526430007] [2023-12-25 07:37:36,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:37:36,489 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 07:37:36,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:37:36,491 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 07:37:36,493 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 07:37:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:37:36,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:37:36,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:37:36,970 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2023-12-25 07:37:36,971 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:37:36,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:37:36,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526430007] [2023-12-25 07:37:36,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526430007] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:37:36,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:37:36,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:37:36,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707704185] [2023-12-25 07:37:36,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:37:36,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:37:36,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:37:36,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:37:36,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:37:36,972 INFO L87 Difference]: Start difference. First operand 7433 states and 8427 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:37:37,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:37:37,705 INFO L93 Difference]: Finished difference Result 9728 states and 11127 transitions. [2023-12-25 07:37:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:37:37,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2023-12-25 07:37:37,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:37:37,713 INFO L225 Difference]: With dead ends: 9728 [2023-12-25 07:37:37,713 INFO L226 Difference]: Without dead ends: 8029 [2023-12-25 07:37:37,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 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 07:37:37,716 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 125 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:37:37,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 360 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:37:37,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8029 states. [2023-12-25 07:37:38,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8029 to 7640. [2023-12-25 07:37:38,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7640 states, 7639 states have (on average 1.127241785574028) internal successors, (8611), 7639 states have internal predecessors, (8611), 0 states have call successors, (0), 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 07:37:38,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7640 states to 7640 states and 8611 transitions. [2023-12-25 07:37:38,379 INFO L78 Accepts]: Start accepts. Automaton has 7640 states and 8611 transitions. Word has length 148 [2023-12-25 07:37:38,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:37:38,379 INFO L495 AbstractCegarLoop]: Abstraction has 7640 states and 8611 transitions. [2023-12-25 07:37:38,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:37:38,380 INFO L276 IsEmpty]: Start isEmpty. Operand 7640 states and 8611 transitions. [2023-12-25 07:37:38,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-25 07:37:38,382 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:37:38,382 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 07:37:38,384 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 07:37:38,584 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 07:37:38,585 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:37:38,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:37:38,585 INFO L85 PathProgramCache]: Analyzing trace with hash 566741525, now seen corresponding path program 1 times [2023-12-25 07:37:38,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:37:38,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39525574] [2023-12-25 07:37:38,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:37:38,586 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 07:37:38,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:37:38,587 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 07:37:38,589 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 07:37:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:37:38,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:37:38,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:37:39,021 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2023-12-25 07:37:39,021 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:37:39,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:37:39,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39525574] [2023-12-25 07:37:39,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39525574] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:37:39,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:37:39,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:37:39,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108834623] [2023-12-25 07:37:39,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:37:39,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:37:39,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:37:39,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:37:39,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:37:39,023 INFO L87 Difference]: Start difference. First operand 7640 states and 8611 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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 07:37:39,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:37:39,822 INFO L93 Difference]: Finished difference Result 10101 states and 11498 transitions. [2023-12-25 07:37:39,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:37:39,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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 148 [2023-12-25 07:37:39,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:37:39,831 INFO L225 Difference]: With dead ends: 10101 [2023-12-25 07:37:39,831 INFO L226 Difference]: Without dead ends: 8191 [2023-12-25 07:37:39,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 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 07:37:39,834 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 155 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:37:39,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 326 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:37:39,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8191 states. [2023-12-25 07:37:40,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8191 to 7795. [2023-12-25 07:37:40,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7795 states, 7794 states have (on average 1.1182961252245316) internal successors, (8716), 7794 states have internal predecessors, (8716), 0 states have call successors, (0), 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 07:37:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7795 states to 7795 states and 8716 transitions. [2023-12-25 07:37:40,548 INFO L78 Accepts]: Start accepts. Automaton has 7795 states and 8716 transitions. Word has length 148 [2023-12-25 07:37:40,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:37:40,548 INFO L495 AbstractCegarLoop]: Abstraction has 7795 states and 8716 transitions. [2023-12-25 07:37:40,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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 07:37:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand 7795 states and 8716 transitions. [2023-12-25 07:37:40,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-25 07:37:40,551 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:37:40,551 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 07:37:40,556 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 07:37:40,754 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 07:37:40,754 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:37:40,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:37:40,755 INFO L85 PathProgramCache]: Analyzing trace with hash -187725613, now seen corresponding path program 1 times [2023-12-25 07:37:40,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:37:40,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805428025] [2023-12-25 07:37:40,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:37:40,755 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 07:37:40,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:37:40,756 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 07:37:40,758 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 07:37:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:37:40,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:37:40,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:37:41,217 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-25 07:37:41,218 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:37:41,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:37:41,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805428025] [2023-12-25 07:37:41,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805428025] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:37:41,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:37:41,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:37:41,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708374738] [2023-12-25 07:37:41,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:37:41,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:37:41,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:37:41,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:37:41,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:37:41,219 INFO L87 Difference]: Start difference. First operand 7795 states and 8716 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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 07:37:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:37:42,020 INFO L93 Difference]: Finished difference Result 9963 states and 11258 transitions. [2023-12-25 07:37:42,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:37:42,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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 148 [2023-12-25 07:37:42,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:37:42,029 INFO L225 Difference]: With dead ends: 9963 [2023-12-25 07:37:42,029 INFO L226 Difference]: Without dead ends: 8095 [2023-12-25 07:37:42,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 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 07:37:42,031 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 152 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:37:42,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 330 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:37:42,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8095 states. [2023-12-25 07:37:42,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8095 to 8012. [2023-12-25 07:37:42,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8012 states, 8011 states have (on average 1.1084758457121457) internal successors, (8880), 8011 states have internal predecessors, (8880), 0 states have call successors, (0), 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 07:37:42,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8012 states to 8012 states and 8880 transitions. [2023-12-25 07:37:42,766 INFO L78 Accepts]: Start accepts. Automaton has 8012 states and 8880 transitions. Word has length 148 [2023-12-25 07:37:42,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:37:42,766 INFO L495 AbstractCegarLoop]: Abstraction has 8012 states and 8880 transitions. [2023-12-25 07:37:42,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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 07:37:42,766 INFO L276 IsEmpty]: Start isEmpty. Operand 8012 states and 8880 transitions. [2023-12-25 07:37:42,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-25 07:37:42,769 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:37:42,769 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 07:37:42,775 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 07:37:42,973 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 07:37:42,973 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:37:42,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:37:42,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1150691150, now seen corresponding path program 1 times [2023-12-25 07:37:42,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:37:42,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275981766] [2023-12-25 07:37:42,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:37:42,974 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 07:37:42,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:37:42,976 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 07:37:42,976 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 07:37:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:37:43,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 07:37:43,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:37:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 58 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:37:44,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:37:44,976 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 58 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:37:44,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:37:44,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275981766] [2023-12-25 07:37:44,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275981766] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:37:44,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:37:44,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-25 07:37:44,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289020871] [2023-12-25 07:37:44,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:37:44,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 07:37:44,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:37:44,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 07:37:44,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1006, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:37:44,978 INFO L87 Difference]: Start difference. First operand 8012 states and 8880 transitions. Second operand has 34 states, 34 states have (on average 8.235294117647058) internal successors, (280), 34 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:26,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:38:26,624 INFO L93 Difference]: Finished difference Result 33315 states and 37534 transitions. [2023-12-25 07:38:26,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 362 states. [2023-12-25 07:38:26,625 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 8.235294117647058) internal successors, (280), 34 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2023-12-25 07:38:26,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:38:26,654 INFO L225 Difference]: With dead ends: 33315 [2023-12-25 07:38:26,654 INFO L226 Difference]: Without dead ends: 30639 [2023-12-25 07:38:26,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 389 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64957 ImplicationChecksByTransitivity, 33.8s TimeCoverageRelationStatistics Valid=13841, Invalid=138649, Unknown=0, NotChecked=0, Total=152490 [2023-12-25 07:38:26,667 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 2743 mSDsluCounter, 4804 mSDsCounter, 0 mSdLazyCounter, 4424 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2743 SdHoareTripleChecker+Valid, 5084 SdHoareTripleChecker+Invalid, 4563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 4424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:38:26,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2743 Valid, 5084 Invalid, 4563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 4424 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2023-12-25 07:38:26,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30639 states. [2023-12-25 07:38:29,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30639 to 27373. [2023-12-25 07:38:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27373 states, 27372 states have (on average 1.1190998100248428) internal successors, (30632), 27372 states have internal predecessors, (30632), 0 states have call successors, (0), 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 07:38:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27373 states to 27373 states and 30632 transitions. [2023-12-25 07:38:29,626 INFO L78 Accepts]: Start accepts. Automaton has 27373 states and 30632 transitions. Word has length 149 [2023-12-25 07:38:29,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:38:29,627 INFO L495 AbstractCegarLoop]: Abstraction has 27373 states and 30632 transitions. [2023-12-25 07:38:29,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 8.235294117647058) internal successors, (280), 34 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 27373 states and 30632 transitions. [2023-12-25 07:38:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-25 07:38:29,631 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:29,632 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 07:38:29,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2023-12-25 07:38:29,834 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 07:38:29,834 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:29,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:29,834 INFO L85 PathProgramCache]: Analyzing trace with hash -2057330060, now seen corresponding path program 1 times [2023-12-25 07:38:29,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:29,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405606469] [2023-12-25 07:38:29,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:29,835 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 07:38:29,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:29,836 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 07:38:29,861 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 07:38:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:29,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 07:38:29,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:38:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 27 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:31,082 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:38:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 27 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:31,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:38:31,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405606469] [2023-12-25 07:38:31,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405606469] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:38:31,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:38:31,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-25 07:38:31,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277495145] [2023-12-25 07:38:31,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:38:31,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 07:38:31,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:38:31,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 07:38:31,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1006, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:38:31,895 INFO L87 Difference]: Start difference. First operand 27373 states and 30632 transitions. Second operand has 34 states, 34 states have (on average 8.529411764705882) internal successors, (290), 34 states have internal predecessors, (290), 0 states have call successors, (0), 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 07:38:49,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:38:49,946 INFO L93 Difference]: Finished difference Result 38262 states and 42972 transitions. [2023-12-25 07:38:49,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2023-12-25 07:38:49,946 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 8.529411764705882) internal successors, (290), 34 states have internal predecessors, (290), 0 states have call successors, (0), 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 149 [2023-12-25 07:38:49,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:38:49,964 INFO L225 Difference]: With dead ends: 38262 [2023-12-25 07:38:49,964 INFO L226 Difference]: Without dead ends: 18915 [2023-12-25 07:38:49,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14363 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=5032, Invalid=35974, Unknown=0, NotChecked=0, Total=41006 [2023-12-25 07:38:49,977 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 1617 mSDsluCounter, 3367 mSDsCounter, 0 mSdLazyCounter, 3055 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1617 SdHoareTripleChecker+Valid, 3555 SdHoareTripleChecker+Invalid, 3136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 3055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-25 07:38:49,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1617 Valid, 3555 Invalid, 3136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 3055 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-25 07:38:49,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18915 states. [2023-12-25 07:38:51,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18915 to 15351. [2023-12-25 07:38:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15351 states, 15350 states have (on average 1.1216286644951141) internal successors, (17217), 15350 states have internal predecessors, (17217), 0 states have call successors, (0), 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 07:38:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15351 states to 15351 states and 17217 transitions. [2023-12-25 07:38:51,785 INFO L78 Accepts]: Start accepts. Automaton has 15351 states and 17217 transitions. Word has length 149 [2023-12-25 07:38:51,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:38:51,785 INFO L495 AbstractCegarLoop]: Abstraction has 15351 states and 17217 transitions. [2023-12-25 07:38:51,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 8.529411764705882) internal successors, (290), 34 states have internal predecessors, (290), 0 states have call successors, (0), 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 07:38:51,786 INFO L276 IsEmpty]: Start isEmpty. Operand 15351 states and 17217 transitions. [2023-12-25 07:38:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-25 07:38:51,788 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:51,788 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 07:38:51,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 07:38:51,991 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 07:38:51,991 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:51,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:51,991 INFO L85 PathProgramCache]: Analyzing trace with hash 611499496, now seen corresponding path program 1 times [2023-12-25 07:38:51,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:51,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406285965] [2023-12-25 07:38:51,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:51,992 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 07:38:51,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:51,994 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 07:38:51,995 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 07:38:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:52,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 07:38:52,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:38:53,153 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 43 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:53,153 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:38:53,974 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 43 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:53,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:38:53,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406285965] [2023-12-25 07:38:53,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406285965] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:38:53,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:38:53,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-25 07:38:53,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870780812] [2023-12-25 07:38:53,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:38:53,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 07:38:53,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:38:53,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 07:38:53,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1006, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:38:53,976 INFO L87 Difference]: Start difference. First operand 15351 states and 17217 transitions. Second operand has 34 states, 34 states have (on average 8.382352941176471) internal successors, (285), 34 states have internal predecessors, (285), 0 states have call successors, (0), 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 07:39:07,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:07,237 INFO L93 Difference]: Finished difference Result 17566 states and 19669 transitions. [2023-12-25 07:39:07,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2023-12-25 07:39:07,239 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 8.382352941176471) internal successors, (285), 34 states have internal predecessors, (285), 0 states have call successors, (0), 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 149 [2023-12-25 07:39:07,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:07,242 INFO L225 Difference]: With dead ends: 17566 [2023-12-25 07:39:07,242 INFO L226 Difference]: Without dead ends: 3537 [2023-12-25 07:39:07,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8942 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=3694, Invalid=24028, Unknown=0, NotChecked=0, Total=27722 [2023-12-25 07:39:07,252 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 1677 mSDsluCounter, 3411 mSDsCounter, 0 mSdLazyCounter, 2738 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1677 SdHoareTripleChecker+Valid, 3615 SdHoareTripleChecker+Invalid, 2824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:07,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1677 Valid, 3615 Invalid, 2824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2738 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-25 07:39:07,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states. [2023-12-25 07:39:07,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 2340. [2023-12-25 07:39:07,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2340 states, 2339 states have (on average 1.0863616930312099) internal successors, (2541), 2339 states have internal predecessors, (2541), 0 states have call successors, (0), 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 07:39:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 2340 states and 2541 transitions. [2023-12-25 07:39:07,568 INFO L78 Accepts]: Start accepts. Automaton has 2340 states and 2541 transitions. Word has length 149 [2023-12-25 07:39:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:07,568 INFO L495 AbstractCegarLoop]: Abstraction has 2340 states and 2541 transitions. [2023-12-25 07:39:07,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 8.382352941176471) internal successors, (285), 34 states have internal predecessors, (285), 0 states have call successors, (0), 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 07:39:07,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 2541 transitions. [2023-12-25 07:39:07,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-25 07:39:07,570 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:07,570 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:07,575 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 07:39:07,776 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 07:39:07,777 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:07,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:07,777 INFO L85 PathProgramCache]: Analyzing trace with hash -553635691, now seen corresponding path program 1 times [2023-12-25 07:39:07,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:07,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926181031] [2023-12-25 07:39:07,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:07,778 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 07:39:07,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:07,779 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 07:39:07,781 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 07:39:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:07,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 07:39:07,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 134 proven. 71 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-25 07:39:09,419 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 134 proven. 71 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-25 07:39:10,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:10,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926181031] [2023-12-25 07:39:10,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926181031] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:10,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:10,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-25 07:39:10,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059501489] [2023-12-25 07:39:10,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:10,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 07:39:10,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:10,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 07:39:10,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:39:10,595 INFO L87 Difference]: Start difference. First operand 2340 states and 2541 transitions. Second operand has 34 states, 34 states have (on average 7.0588235294117645) internal successors, (240), 34 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:40,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:40,348 INFO L93 Difference]: Finished difference Result 3783 states and 4097 transitions. [2023-12-25 07:39:40,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2023-12-25 07:39:40,349 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.0588235294117645) internal successors, (240), 34 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2023-12-25 07:39:40,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:40,351 INFO L225 Difference]: With dead ends: 3783 [2023-12-25 07:39:40,351 INFO L226 Difference]: Without dead ends: 3034 [2023-12-25 07:39:40,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11847 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=4790, Invalid=26716, Unknown=0, NotChecked=0, Total=31506 [2023-12-25 07:39:40,356 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 2187 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 2218 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2187 SdHoareTripleChecker+Valid, 2279 SdHoareTripleChecker+Invalid, 2347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 2218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:40,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2187 Valid, 2279 Invalid, 2347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 2218 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-12-25 07:39:40,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3034 states. [2023-12-25 07:39:40,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3034 to 2528. [2023-12-25 07:39:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2528 states, 2527 states have (on average 1.0838939453897902) internal successors, (2739), 2527 states have internal predecessors, (2739), 0 states have call successors, (0), 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 07:39:40,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 2739 transitions. [2023-12-25 07:39:40,648 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 2739 transitions. Word has length 152 [2023-12-25 07:39:40,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:40,648 INFO L495 AbstractCegarLoop]: Abstraction has 2528 states and 2739 transitions. [2023-12-25 07:39:40,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.0588235294117645) internal successors, (240), 34 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:40,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 2739 transitions. [2023-12-25 07:39:40,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-25 07:39:40,650 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:40,650 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:40,654 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 (46)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:40,852 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 07:39:40,853 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:40,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:40,853 INFO L85 PathProgramCache]: Analyzing trace with hash 223091941, now seen corresponding path program 1 times [2023-12-25 07:39:40,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:40,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710664097] [2023-12-25 07:39:40,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:40,853 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 07:39:40,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:40,854 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 07:39:40,880 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 07:39:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:40,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 07:39:40,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:42,552 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 138 proven. 52 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-25 07:39:42,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 138 proven. 52 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-25 07:39:43,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:43,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710664097] [2023-12-25 07:39:43,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710664097] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:43,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:43,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-25 07:39:43,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883632724] [2023-12-25 07:39:43,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:43,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 07:39:43,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:43,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 07:39:43,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=991, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:39:43,788 INFO L87 Difference]: Start difference. First operand 2528 states and 2739 transitions. Second operand has 34 states, 34 states have (on average 6.4411764705882355) internal successors, (219), 34 states have internal predecessors, (219), 0 states have call successors, (0), 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 07:40:33,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:40:33,473 INFO L93 Difference]: Finished difference Result 5062 states and 5498 transitions. [2023-12-25 07:40:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2023-12-25 07:40:33,475 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.4411764705882355) internal successors, (219), 34 states have internal predecessors, (219), 0 states have call successors, (0), 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 152 [2023-12-25 07:40:33,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:40:33,478 INFO L225 Difference]: With dead ends: 5062 [2023-12-25 07:40:33,478 INFO L226 Difference]: Without dead ends: 4438 [2023-12-25 07:40:33,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14588 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=5344, Invalid=33268, Unknown=0, NotChecked=0, Total=38612 [2023-12-25 07:40:33,480 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 2975 mSDsluCounter, 2389 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2975 SdHoareTripleChecker+Valid, 2537 SdHoareTripleChecker+Invalid, 2134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-12-25 07:40:33,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2975 Valid, 2537 Invalid, 2134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2023-12-25 07:40:33,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4438 states. [2023-12-25 07:40:33,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4438 to 2798. [2023-12-25 07:40:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2798 states, 2797 states have (on average 1.0808008580622095) internal successors, (3023), 2797 states have internal predecessors, (3023), 0 states have call successors, (0), 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 07:40:33,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 3023 transitions. [2023-12-25 07:40:33,814 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 3023 transitions. Word has length 152 [2023-12-25 07:40:33,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:40:33,814 INFO L495 AbstractCegarLoop]: Abstraction has 2798 states and 3023 transitions. [2023-12-25 07:40:33,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.4411764705882355) internal successors, (219), 34 states have internal predecessors, (219), 0 states have call successors, (0), 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 07:40:33,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 3023 transitions. [2023-12-25 07:40:33,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-25 07:40:33,816 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:40:33,816 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:40:33,821 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 07:40:34,018 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 07:40:34,019 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:40:34,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:40:34,019 INFO L85 PathProgramCache]: Analyzing trace with hash 804305165, now seen corresponding path program 1 times [2023-12-25 07:40:34,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:40:34,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120259829] [2023-12-25 07:40:34,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:40:34,020 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 07:40:34,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:40:34,021 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 07:40:34,021 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 07:40:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:40:34,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 07:40:34,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:40:35,556 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 136 proven. 61 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-25 07:40:35,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:40:36,797 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 136 proven. 61 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-25 07:40:36,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:40:36,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120259829] [2023-12-25 07:40:36,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120259829] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:40:36,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:40:36,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-25 07:40:36,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072564355] [2023-12-25 07:40:36,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:40:36,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 07:40:36,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:40:36,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 07:40:36,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=989, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:40:36,800 INFO L87 Difference]: Start difference. First operand 2798 states and 3023 transitions. Second operand has 34 states, 34 states have (on average 6.735294117647059) internal successors, (229), 34 states have internal predecessors, (229), 0 states have call successors, (0), 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 07:41:00,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:41:00,915 INFO L93 Difference]: Finished difference Result 3317 states and 3570 transitions. [2023-12-25 07:41:00,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2023-12-25 07:41:00,916 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.735294117647059) internal successors, (229), 34 states have internal predecessors, (229), 0 states have call successors, (0), 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 152 [2023-12-25 07:41:00,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:41:00,918 INFO L225 Difference]: With dead ends: 3317 [2023-12-25 07:41:00,918 INFO L226 Difference]: Without dead ends: 2569 [2023-12-25 07:41:00,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8614 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=3860, Invalid=21262, Unknown=0, NotChecked=0, Total=25122 [2023-12-25 07:41:00,921 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 2186 mSDsluCounter, 2251 mSDsCounter, 0 mSdLazyCounter, 1997 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2186 SdHoareTripleChecker+Valid, 2389 SdHoareTripleChecker+Invalid, 2104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-25 07:41:00,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2186 Valid, 2389 Invalid, 2104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1997 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-12-25 07:41:00,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2023-12-25 07:41:01,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 2435. [2023-12-25 07:41:01,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2435 states, 2434 states have (on average 1.0784716516023007) internal successors, (2625), 2434 states have internal predecessors, (2625), 0 states have call successors, (0), 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 07:41:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 2625 transitions. [2023-12-25 07:41:01,224 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 2625 transitions. Word has length 152 [2023-12-25 07:41:01,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:41:01,224 INFO L495 AbstractCegarLoop]: Abstraction has 2435 states and 2625 transitions. [2023-12-25 07:41:01,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.735294117647059) internal successors, (229), 34 states have internal predecessors, (229), 0 states have call successors, (0), 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 07:41:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 2625 transitions. [2023-12-25 07:41:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-25 07:41:01,226 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:41:01,226 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:41:01,229 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 07:41:01,428 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 07:41:01,428 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:41:01,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:41:01,429 INFO L85 PathProgramCache]: Analyzing trace with hash 949517510, now seen corresponding path program 1 times [2023-12-25 07:41:01,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:41:01,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722083766] [2023-12-25 07:41:01,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:41:01,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:41:01,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:41:01,430 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 07:41:01,433 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 07:41:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:41:01,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 07:41:01,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:41:02,942 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 137 proven. 54 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-25 07:41:02,942 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:41:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 135 proven. 71 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-25 07:41:04,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:41:04,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722083766] [2023-12-25 07:41:04,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722083766] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:41:04,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:41:04,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 35 [2023-12-25 07:41:04,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443060098] [2023-12-25 07:41:04,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:41:04,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-25 07:41:04,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:41:04,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-25 07:41:04,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1018, Unknown=0, NotChecked=0, Total=1190 [2023-12-25 07:41:04,311 INFO L87 Difference]: Start difference. First operand 2435 states and 2625 transitions. Second operand has 35 states, 35 states have (on average 6.628571428571429) internal successors, (232), 35 states have internal predecessors, (232), 0 states have call successors, (0), 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 07:41:24,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:41:24,962 INFO L93 Difference]: Finished difference Result 3814 states and 4122 transitions. [2023-12-25 07:41:24,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2023-12-25 07:41:24,963 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.628571428571429) internal successors, (232), 35 states have internal predecessors, (232), 0 states have call successors, (0), 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 153 [2023-12-25 07:41:24,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:41:24,965 INFO L225 Difference]: With dead ends: 3814 [2023-12-25 07:41:24,965 INFO L226 Difference]: Without dead ends: 2870 [2023-12-25 07:41:24,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12791 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=5758, Invalid=27548, Unknown=0, NotChecked=0, Total=33306 [2023-12-25 07:41:24,968 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 1904 mSDsluCounter, 2086 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1904 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 2407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-25 07:41:24,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1904 Valid, 2223 Invalid, 2407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-25 07:41:24,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2023-12-25 07:41:25,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 2546. [2023-12-25 07:41:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2545 states have (on average 1.0777996070726916) internal successors, (2743), 2545 states have internal predecessors, (2743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:41:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 2743 transitions. [2023-12-25 07:41:25,291 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 2743 transitions. Word has length 153 [2023-12-25 07:41:25,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:41:25,291 INFO L495 AbstractCegarLoop]: Abstraction has 2546 states and 2743 transitions. [2023-12-25 07:41:25,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.628571428571429) internal successors, (232), 35 states have internal predecessors, (232), 0 states have call successors, (0), 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 07:41:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 2743 transitions. [2023-12-25 07:41:25,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-25 07:41:25,292 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:41:25,292 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:41:25,297 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 (49)] Forceful destruction successful, exit code 0 [2023-12-25 07:41:25,498 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 07:41:25,498 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:41:25,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:41:25,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1822960322, now seen corresponding path program 1 times [2023-12-25 07:41:25,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:41:25,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723247218] [2023-12-25 07:41:25,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:41:25,499 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 07:41:25,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:41:25,500 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 07:41:25,501 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 07:41:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 07:41:25,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 07:41:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 07:41:25,731 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 07:41:25,731 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 07:41:25,732 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 07:41:25,738 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 07:41:25,936 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 07:41:25,939 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:41:25,942 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 07:41:26,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 07:41:26 BoogieIcfgContainer [2023-12-25 07:41:26,083 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 07:41:26,083 INFO L158 Benchmark]: Toolchain (without parser) took 371097.70ms. Allocated memory was 196.1MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 145.7MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2023-12-25 07:41:26,083 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 196.1MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 07:41:26,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.68ms. Allocated memory is still 196.1MB. Free memory was 145.7MB in the beginning and 131.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-25 07:41:26,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.28ms. Allocated memory is still 196.1MB. Free memory was 131.0MB in the beginning and 128.6MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 07:41:26,084 INFO L158 Benchmark]: Boogie Preprocessor took 52.49ms. Allocated memory is still 196.1MB. Free memory was 128.6MB in the beginning and 125.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 07:41:26,084 INFO L158 Benchmark]: RCFGBuilder took 527.20ms. Allocated memory is still 196.1MB. Free memory was 125.8MB in the beginning and 102.4MB in the end (delta: 23.4MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-25 07:41:26,085 INFO L158 Benchmark]: TraceAbstraction took 370160.84ms. Allocated memory was 196.1MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 101.7MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2023-12-25 07:41:26,090 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.11ms. Allocated memory is still 196.1MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 303.68ms. Allocated memory is still 196.1MB. Free memory was 145.7MB in the beginning and 131.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.28ms. Allocated memory is still 196.1MB. Free memory was 131.0MB in the beginning and 128.6MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.49ms. Allocated memory is still 196.1MB. Free memory was 128.6MB in the beginning and 125.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 527.20ms. Allocated memory is still 196.1MB. Free memory was 125.8MB in the beginning and 102.4MB in the end (delta: 23.4MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 370160.84ms. Allocated memory was 196.1MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 101.7MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.9GB. 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: 316]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] unsigned char r1 ; [L30] port_t p1 ; [L31] char p1_old ; [L32] char p1_new ; [L33] char id1 ; [L34] char st1 ; [L35] msg_t send1 ; [L36] _Bool mode1 ; [L37] _Bool alive1 ; [L38] port_t p2 ; [L39] char p2_old ; [L40] char p2_new ; [L41] char id2 ; [L42] char st2 ; [L43] msg_t send2 ; [L44] _Bool mode2 ; [L45] _Bool alive2 ; [L46] port_t p3 ; [L47] char p3_old ; [L48] char p3_new ; [L49] char id3 ; [L50] char st3 ; [L51] msg_t send3 ; [L52] _Bool mode3 ; [L53] _Bool alive3 ; [L261] int c1 ; [L262] int i2 ; [L265] c1 = 0 [L266] r1 = __VERIFIER_nondet_uchar() [L267] id1 = __VERIFIER_nondet_char() [L268] st1 = __VERIFIER_nondet_char() [L269] send1 = __VERIFIER_nondet_char() [L270] mode1 = __VERIFIER_nondet_bool() [L271] alive1 = __VERIFIER_nondet_bool() [L272] id2 = __VERIFIER_nondet_char() [L273] st2 = __VERIFIER_nondet_char() [L274] send2 = __VERIFIER_nondet_char() [L275] mode2 = __VERIFIER_nondet_bool() [L276] alive2 = __VERIFIER_nondet_bool() [L277] id3 = __VERIFIER_nondet_char() [L278] st3 = __VERIFIER_nondet_char() [L279] send3 = __VERIFIER_nondet_char() [L280] mode3 = __VERIFIER_nondet_bool() [L281] alive3 = __VERIFIER_nondet_bool() [L282] CALL, EXPR init() [L164] int tmp ; VAL [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] [L167] COND TRUE (int )r1 == 0 VAL [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] [L168] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 VAL [alive1=1, alive2=1, alive3=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] [L169] COND TRUE (int )id1 >= 0 VAL [alive1=1, alive2=1, alive3=0, id1=64, 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] [L170] COND TRUE (int )st1 == 0 VAL [alive1=1, alive2=1, alive3=0, id1=64, 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] [L171] COND TRUE (int )send1 == (int )id1 VAL [alive1=1, alive2=1, alive3=0, id1=64, 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=64, st1=0] [L172] COND TRUE (int )mode1 == 0 VAL [alive1=1, alive2=1, alive3=0, id1=64, 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=64, st1=0] [L173] COND TRUE (int )id2 >= 0 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=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=64, st1=0] [L174] COND TRUE (int )st2 == 0 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=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=64, st1=0, st2=0] [L175] COND TRUE (int )send2 == (int )id2 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=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=64, send2=0, st1=0, st2=0] [L176] COND TRUE (int )mode2 == 0 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=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=64, send2=0, st1=0, st2=0] [L177] COND TRUE (int )id3 >= 0 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=64, send2=0, st1=0, st2=0] [L178] COND TRUE (int )st3 == 0 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=64, send2=0, st1=0, st2=0, st3=0] [L179] COND TRUE (int )send3 == (int )id3 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L180] COND TRUE (int )mode3 == 0 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L181] COND TRUE (int )id1 != (int )id2 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L182] COND TRUE (int )id1 != (int )id3 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L183] COND TRUE (int )id2 != (int )id3 [L184] tmp = 1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=64, send2=0, send3=32, st1=0, st2=0, st3=0, tmp=1] [L236] return (tmp); [L282] RET, EXPR init() [L282] i2 = init() [L283] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, alive1=1, alive2=1, alive3=0, cond=1, id1=64, id2=0, id3=32, 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=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L283] RET assume_abort_if_not(i2) [L284] p1_old = nomsg [L285] p1_new = nomsg [L286] p2_old = nomsg [L287] p2_new = nomsg [L288] p3_old = nomsg [L289] p3_new = nomsg [L290] i2 = 0 VAL [alive1=1, alive2=1, alive3=0, c1=0, i2=0, id1=64, id2=0, id3=32, mode1=0, mode2=0, mode3=0, 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=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L291] COND TRUE 1 [L293] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=0, mode2=0, mode3=0, 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=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L60] COND FALSE !(\read(mode1)) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=0, mode2=0, mode3=0, 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=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L83] COND TRUE \read(alive1) [L84] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L89] mode1 = (_Bool)1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L293] RET node1() [L294] CALL node2() [L96] msg_t m2 ; [L99] m2 = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L100] COND FALSE !(\read(mode2)) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L117] COND TRUE \read(alive2) [L118] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L123] mode2 = (_Bool)1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L294] RET node2() [L295] CALL node3() [L130] msg_t m3 ; [L133] m3 = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L134] COND FALSE !(\read(mode3)) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L151] COND FALSE !(\read(alive3)) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L154] COND FALSE !((int )send3 != (int )id3) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L157] mode3 = (_Bool)1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L295] RET node3() [L296] p1_old = p1_new [L297] p1_new = nomsg [L298] p2_old = p2_new [L299] p2_new = nomsg [L300] p3_old = p3_new [L301] p3_new = nomsg [L302] CALL, EXPR check() [L241] int tmp ; VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L244] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L245] COND TRUE (int )r1 < 3 [L246] tmp = 1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0, tmp=1] [L256] return (tmp); [L302] RET, EXPR check() [L302] c1 = check() [L303] CALL assert(c1) [L314] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=1, alive2=1, alive3=0, arg=1, id1=64, id2=0, id3=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L303] RET assert(c1) [L291] COND TRUE 1 [L293] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L60] COND TRUE \read(mode1) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L61] COND FALSE !(r1 == 255) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L64] r1 = r1 + 1 [L65] m1 = p3_old [L66] p3_old = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L67] COND FALSE !((int )m1 != (int )nomsg) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L81] mode1 = (_Bool)0 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L293] RET node1() [L294] CALL node2() [L96] msg_t m2 ; [L99] m2 = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L100] COND TRUE \read(mode2) [L101] m2 = p1_old [L102] p1_old = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L103] COND TRUE (int )m2 != (int )nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L104] COND TRUE \read(alive2) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L105] COND TRUE (int )m2 > (int )id2 [L106] send2 = m2 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=32, st1=0, st2=0, st3=0] [L115] mode2 = (_Bool)0 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=64, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=32, st1=0, st2=0, st3=0] [L294] RET node2() [L295] CALL node3() [L130] msg_t m3 ; [L133] m3 = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=32, st1=0, st2=0, st3=0] [L134] COND TRUE \read(mode3) [L135] m3 = p2_old [L136] p2_old = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=0, mode1=0, mode2=0, mode3=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=64, send2=64, send3=32, st1=0, st2=0, st3=0] [L137] COND TRUE (int )m3 != (int )nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=0, mode1=0, mode2=0, mode3=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=64, send2=64, send3=32, st1=0, st2=0, st3=0] [L138] COND FALSE !(\read(alive3)) [L146] send3 = m3 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=0, mode1=0, mode2=0, mode3=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=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L149] mode3 = (_Bool)0 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=0, mode1=0, mode2=0, mode3=0, 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=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L295] RET node3() [L296] p1_old = p1_new [L297] p1_new = nomsg [L298] p2_old = p2_new [L299] p2_new = nomsg [L300] p3_old = p3_new [L301] p3_new = nomsg [L302] CALL, EXPR check() [L241] int tmp ; VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, mode1=0, mode2=0, mode3=0, 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=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L244] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, mode1=0, mode2=0, mode3=0, 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=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L245] COND TRUE (int )r1 < 3 [L246] tmp = 1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, mode1=0, mode2=0, mode3=0, 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=64, send2=64, send3=0, st1=0, st2=0, st3=0, tmp=1] [L256] return (tmp); [L302] RET, EXPR check() [L302] c1 = check() [L303] CALL assert(c1) [L314] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=1, alive2=1, alive3=0, arg=1, id1=64, id2=0, id3=32, mode1=0, mode2=0, mode3=0, 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=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L303] RET assert(c1) [L291] COND TRUE 1 [L293] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=0, mode2=0, mode3=0, 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=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L60] COND FALSE !(\read(mode1)) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=0, mode2=0, mode3=0, 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=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L83] COND TRUE \read(alive1) [L84] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L89] mode1 = (_Bool)1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L293] RET node1() [L294] CALL node2() [L96] msg_t m2 ; [L99] m2 = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L100] COND FALSE !(\read(mode2)) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L117] COND TRUE \read(alive2) [L118] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L123] mode2 = (_Bool)1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L294] RET node2() [L295] CALL node3() [L130] msg_t m3 ; [L133] m3 = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L134] COND FALSE !(\read(mode3)) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L151] COND FALSE !(\read(alive3)) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L154] COND TRUE (int )send3 != (int )id3 [L155] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L157] mode3 = (_Bool)1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L295] RET node3() [L296] p1_old = p1_new [L297] p1_new = nomsg [L298] p2_old = p2_new [L299] p2_new = nomsg [L300] p3_old = p3_new [L301] p3_new = nomsg [L302] CALL, EXPR check() [L241] int tmp ; VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=0, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L244] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=0, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L245] COND TRUE (int )r1 < 3 [L246] tmp = 1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=0, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0, tmp=1] [L256] return (tmp); [L302] RET, EXPR check() [L302] c1 = check() [L303] CALL assert(c1) [L314] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=1, alive2=1, alive3=0, arg=1, id1=64, id2=0, id3=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=0, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L303] RET assert(c1) [L291] COND TRUE 1 [L293] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=0, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L60] COND TRUE \read(mode1) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=0, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L61] COND FALSE !(r1 == 255) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=0, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L64] r1 = r1 + 1 [L65] m1 = p3_old [L66] p3_old = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L67] COND TRUE (int )m1 != (int )nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L68] COND TRUE \read(alive1) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L69] COND FALSE !((int )m1 > (int )id1) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L72] COND FALSE !((int )m1 == (int )id1) [L75] send1 = m1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L81] mode1 = (_Bool)0 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L293] RET node1() [L294] CALL node2() [L96] msg_t m2 ; [L99] m2 = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L100] COND TRUE \read(mode2) [L101] m2 = p1_old [L102] p1_old = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L103] COND TRUE (int )m2 != (int )nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L104] COND TRUE \read(alive2) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L105] COND TRUE (int )m2 > (int )id2 [L106] send2 = m2 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L115] mode2 = (_Bool)0 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=64, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L294] RET node2() [L295] CALL node3() [L130] msg_t m3 ; [L133] m3 = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L134] COND TRUE \read(mode3) [L135] m3 = p2_old [L136] p2_old = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=64, mode1=0, mode2=0, mode3=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=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L137] COND TRUE (int )m3 != (int )nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=64, mode1=0, mode2=0, mode3=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=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L138] COND FALSE !(\read(alive3)) [L146] send3 = m3 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=64, mode1=0, mode2=0, mode3=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=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L149] mode3 = (_Bool)0 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=64, mode1=0, mode2=0, mode3=0, 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=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L295] RET node3() [L296] p1_old = p1_new [L297] p1_new = nomsg [L298] p2_old = p2_new [L299] p2_new = nomsg [L300] p3_old = p3_new [L301] p3_new = nomsg [L302] CALL, EXPR check() [L241] int tmp ; VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, mode1=0, mode2=0, mode3=0, 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=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L244] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, mode1=0, mode2=0, mode3=0, 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=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L245] COND TRUE (int )r1 < 3 [L246] tmp = 1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, mode1=0, mode2=0, mode3=0, 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=0, send2=64, send3=64, st1=0, st2=0, st3=0, tmp=1] [L256] return (tmp); [L302] RET, EXPR check() [L302] c1 = check() [L303] CALL assert(c1) [L314] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=1, alive2=1, alive3=0, arg=1, id1=64, id2=0, id3=32, mode1=0, mode2=0, mode3=0, 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=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L303] RET assert(c1) [L291] COND TRUE 1 [L293] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=0, mode2=0, mode3=0, 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=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L60] COND FALSE !(\read(mode1)) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=0, mode2=0, mode3=0, 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=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L83] COND TRUE \read(alive1) [L84] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L89] mode1 = (_Bool)1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L293] RET node1() [L294] CALL node2() [L96] msg_t m2 ; [L99] m2 = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L100] COND FALSE !(\read(mode2)) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L117] COND TRUE \read(alive2) [L118] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L123] mode2 = (_Bool)1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L294] RET node2() [L295] CALL node3() [L130] msg_t m3 ; [L133] m3 = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L134] COND FALSE !(\read(mode3)) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L151] COND FALSE !(\read(alive3)) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L154] COND TRUE (int )send3 != (int )id3 [L155] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=64, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L157] mode3 = (_Bool)1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=64, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L295] RET node3() [L296] p1_old = p1_new [L297] p1_new = nomsg [L298] p2_old = p2_new [L299] p2_new = nomsg [L300] p3_old = p3_new [L301] p3_new = nomsg [L302] CALL, EXPR check() [L241] int tmp ; VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L244] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L245] COND TRUE (int )r1 < 3 [L246] tmp = 1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0, tmp=1] [L256] return (tmp); [L302] RET, EXPR check() [L302] c1 = check() [L303] CALL assert(c1) [L314] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=1, alive2=1, alive3=0, arg=1, id1=64, id2=0, id3=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L303] RET assert(c1) [L291] COND TRUE 1 [L293] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L60] COND TRUE \read(mode1) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L61] COND FALSE !(r1 == 255) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L64] r1 = r1 + 1 [L65] m1 = p3_old [L66] p3_old = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L67] COND TRUE (int )m1 != (int )nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L68] COND TRUE \read(alive1) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L69] COND FALSE !((int )m1 > (int )id1) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L72] COND TRUE (int )m1 == (int )id1 [L73] st1 = (char)1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L81] mode1 = (_Bool)0 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m1=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L293] RET node1() [L294] CALL node2() [L96] msg_t m2 ; [L99] m2 = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L100] COND TRUE \read(mode2) [L101] m2 = p1_old [L102] p1_old = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L103] COND TRUE (int )m2 != (int )nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L104] COND TRUE \read(alive2) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L105] COND FALSE !((int )m2 > (int )id2) VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L108] COND TRUE (int )m2 == (int )id2 [L109] st2 = (char)1 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L115] mode2 = (_Bool)0 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m2=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L294] RET node2() [L295] CALL node3() [L130] msg_t m3 ; [L133] m3 = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L134] COND TRUE \read(mode3) [L135] m3 = p2_old [L136] p2_old = nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=64, mode1=0, mode2=0, mode3=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=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L137] COND TRUE (int )m3 != (int )nomsg VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=64, mode1=0, mode2=0, mode3=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=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L138] COND FALSE !(\read(alive3)) [L146] send3 = m3 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=64, mode1=0, mode2=0, mode3=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=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L149] mode3 = (_Bool)0 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, m3=64, mode1=0, mode2=0, mode3=0, 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=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L295] RET node3() [L296] p1_old = p1_new [L297] p1_new = nomsg [L298] p2_old = p2_new [L299] p2_new = nomsg [L300] p3_old = p3_new [L301] p3_new = nomsg [L302] CALL, EXPR check() [L241] int tmp ; VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, mode1=0, mode2=0, mode3=0, 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=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L244] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L254] tmp = 0 VAL [alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, mode1=0, mode2=0, mode3=0, 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=0, send2=64, send3=64, st1=1, st2=1, st3=0, tmp=0] [L256] return (tmp); [L302] RET, EXPR check() [L302] c1 = check() [L303] CALL assert(c1) [L314] COND TRUE ! arg VAL [\old(arg)=0, alive1=1, alive2=1, alive3=0, arg=0, id1=64, id2=0, id3=32, mode1=0, mode2=0, mode3=0, 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=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L316] reach_error() VAL [\old(arg)=0, alive1=1, alive2=1, alive3=0, arg=0, id1=64, id2=0, id3=32, mode1=0, mode2=0, mode3=0, 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=0, send2=64, send3=64, st1=1, st2=1, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 369.9s, OverallIterations: 49, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 293.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36188 SdHoareTripleChecker+Valid, 51.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36188 mSDsluCounter, 60606 SdHoareTripleChecker+Invalid, 46.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54373 mSDsCounter, 1424 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50428 IncrementalHoareTripleChecker+Invalid, 51852 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1424 mSolverCounterUnsat, 6233 mSDtfsCounter, 50428 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10014 GetRequests, 7136 SyntacticMatches, 0 SemanticMatches, 2878 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223739 ImplicationChecksByTransitivity, 224.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43949occurred in iteration=19, InterpolantAutomatonStates: 2465, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 25.6s AutomataMinimizationTime, 48 MinimizatonAttempts, 71490 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 37.2s InterpolantComputationTime, 4856 NumberOfCodeBlocks, 4856 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 7758 ConstructedInterpolants, 1845 QuantifiedInterpolants, 88444 SizeOfPredicates, 229 NumberOfNonLiveVariables, 8670 ConjunctsInSsa, 414 ConjunctsInUnsatCore, 76 InterpolantComputations, 20 PerfectInterpolantSequences, 5182/8529 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 07:41:26,304 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 07:41:26,334 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...