/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.2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 07:35:52,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 07:35:52,554 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:52,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 07:35:52,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 07:35:52,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 07:35:52,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 07:35:52,573 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 07:35:52,573 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 07:35:52,573 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 07:35:52,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 07:35:52,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 07:35:52,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 07:35:52,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 07:35:52,575 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 07:35:52,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 07:35:52,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 07:35:52,575 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 07:35:52,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 07:35:52,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 07:35:52,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 07:35:52,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 07:35:52,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 07:35:52,577 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 07:35:52,577 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 07:35:52,577 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 07:35:52,578 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 07:35:52,578 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 07:35:52,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 07:35:52,578 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 07:35:52,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 07:35:52,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 07:35:52,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 07:35:52,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 07:35:52,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:35:52,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 07:35:52,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 07:35:52,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 07:35:52,580 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 07:35:52,580 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 07:35:52,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 07:35:52,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 07:35:52,580 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 07:35:52,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 07:35:52,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 07:35:52,581 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 07:35:52,581 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:52,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 07:35:52,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 07:35:52,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 07:35:52,750 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 07:35:52,750 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 07:35:52,752 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.2.ufo.UNBOUNDED.pals.c [2023-12-25 07:35:53,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 07:35:53,961 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 07:35:53,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c [2023-12-25 07:35:53,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66987e1d1/d470b9bb125c4ad7b007fcc23a35f515/FLAGaa07dc8c5 [2023-12-25 07:35:53,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66987e1d1/d470b9bb125c4ad7b007fcc23a35f515 [2023-12-25 07:35:53,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 07:35:53,993 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 07:35:53,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 07:35:53,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 07:35:53,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 07:35:53,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:35:53" (1/1) ... [2023-12-25 07:35:53,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@775c01a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:53, skipping insertion in model container [2023-12-25 07:35:53,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:35:53" (1/1) ... [2023-12-25 07:35:54,037 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 07:35:54,189 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.2.ufo.UNBOUNDED.pals.c[6787,6800] [2023-12-25 07:35:54,192 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:35:54,204 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 07:35:54,237 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.2.ufo.UNBOUNDED.pals.c[6787,6800] [2023-12-25 07:35:54,237 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:35:54,254 INFO L206 MainTranslator]: Completed translation [2023-12-25 07:35:54,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:54 WrapperNode [2023-12-25 07:35:54,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 07:35:54,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 07:35:54,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 07:35:54,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 07:35:54,261 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:54" (1/1) ... [2023-12-25 07:35:54,269 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:54" (1/1) ... [2023-12-25 07:35:54,299 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 230 [2023-12-25 07:35:54,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 07:35:54,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 07:35:54,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 07:35:54,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 07:35:54,309 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:54" (1/1) ... [2023-12-25 07:35:54,309 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:54" (1/1) ... [2023-12-25 07:35:54,311 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:54" (1/1) ... [2023-12-25 07:35:54,326 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:54,326 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:54" (1/1) ... [2023-12-25 07:35:54,326 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:54" (1/1) ... [2023-12-25 07:35:54,331 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:54" (1/1) ... [2023-12-25 07:35:54,334 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:54" (1/1) ... [2023-12-25 07:35:54,335 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:54" (1/1) ... [2023-12-25 07:35:54,336 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:54" (1/1) ... [2023-12-25 07:35:54,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 07:35:54,340 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 07:35:54,340 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 07:35:54,340 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 07:35:54,340 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:54" (1/1) ... [2023-12-25 07:35:54,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:35:54,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 07:35:54,387 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:54,405 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:54,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 07:35:54,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 07:35:54,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 07:35:54,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 07:35:54,498 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 07:35:54,500 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 07:35:54,863 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 07:35:54,894 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 07:35:54,894 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 07:35:54,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:35:54 BoogieIcfgContainer [2023-12-25 07:35:54,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 07:35:54,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 07:35:54,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 07:35:54,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 07:35:54,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 07:35:53" (1/3) ... [2023-12-25 07:35:54,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc97f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:35:54, skipping insertion in model container [2023-12-25 07:35:54,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:54" (2/3) ... [2023-12-25 07:35:54,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc97f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:35:54, skipping insertion in model container [2023-12-25 07:35:54,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:35:54" (3/3) ... [2023-12-25 07:35:54,923 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c [2023-12-25 07:35:54,938 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 07:35:54,938 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 07:35:54,985 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 07:35:54,991 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;@66f0bdc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 07:35:54,991 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 07:35:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 61 states have (on average 1.7540983606557377) internal successors, (107), 62 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:55,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-25 07:35:55,001 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:55,002 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:55,002 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:55,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:55,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1278615738, now seen corresponding path program 1 times [2023-12-25 07:35:55,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:55,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412914628] [2023-12-25 07:35:55,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:55,015 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:55,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:55,017 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:55,018 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:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:55,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 07:35:55,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:55,141 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:55,141 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:55,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:55,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412914628] [2023-12-25 07:35:55,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412914628] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:55,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:55,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:35:55,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500539278] [2023-12-25 07:35:55,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:55,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:35:55,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:55,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:35:55,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:35:55,172 INFO L87 Difference]: Start difference. First operand has 63 states, 61 states have (on average 1.7540983606557377) internal successors, (107), 62 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:55,242 INFO L93 Difference]: Finished difference Result 106 states and 178 transitions. [2023-12-25 07:35:55,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:35:55,244 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:55,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:55,250 INFO L225 Difference]: With dead ends: 106 [2023-12-25 07:35:55,250 INFO L226 Difference]: Without dead ends: 61 [2023-12-25 07:35:55,252 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:55,254 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 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:55,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 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:55,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-25 07:35:55,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-12-25 07:35:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 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:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 85 transitions. [2023-12-25 07:35:55,279 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 85 transitions. Word has length 22 [2023-12-25 07:35:55,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:55,280 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 85 transitions. [2023-12-25 07:35:55,280 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:55,280 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 85 transitions. [2023-12-25 07:35:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 07:35:55,281 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:55,282 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:55,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 07:35:55,484 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:55,484 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:55,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash 728852336, now seen corresponding path program 1 times [2023-12-25 07:35:55,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:55,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794932109] [2023-12-25 07:35:55,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:55,486 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:55,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:55,487 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:55,488 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:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:55,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:35:55,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:55,802 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:55,803 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:55,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:55,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794932109] [2023-12-25 07:35:55,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794932109] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:55,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:55,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:35:55,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317089368] [2023-12-25 07:35:55,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:55,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:35:55,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:55,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:35:55,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:35:55,806 INFO L87 Difference]: Start difference. First operand 61 states and 85 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:55,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:55,884 INFO L93 Difference]: Finished difference Result 221 states and 341 transitions. [2023-12-25 07:35:55,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:35:55,885 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:55,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:55,889 INFO L225 Difference]: With dead ends: 221 [2023-12-25 07:35:55,890 INFO L226 Difference]: Without dead ends: 181 [2023-12-25 07:35:55,890 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:55,891 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 220 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:55,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 296 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:55,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-25 07:35:55,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 99. [2023-12-25 07:35:55,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.489795918367347) internal successors, (146), 98 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 146 transitions. [2023-12-25 07:35:55,917 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 146 transitions. Word has length 38 [2023-12-25 07:35:55,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:55,917 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 146 transitions. [2023-12-25 07:35:55,917 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:55,917 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 146 transitions. [2023-12-25 07:35:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-25 07:35:55,918 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:55,918 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:55,924 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:56,119 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:56,120 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:56,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:56,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1106554996, now seen corresponding path program 1 times [2023-12-25 07:35:56,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:56,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395023441] [2023-12-25 07:35:56,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:56,121 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:56,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:56,123 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:56,137 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:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:56,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 07:35:56,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:56,229 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:56,229 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:56,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:56,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395023441] [2023-12-25 07:35:56,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395023441] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:56,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:56,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:35:56,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051500453] [2023-12-25 07:35:56,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:56,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:35:56,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:56,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:35:56,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:35:56,236 INFO L87 Difference]: Start difference. First operand 99 states and 146 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:56,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:56,263 INFO L93 Difference]: Finished difference Result 107 states and 155 transitions. [2023-12-25 07:35:56,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:35:56,263 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:56,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:56,264 INFO L225 Difference]: With dead ends: 107 [2023-12-25 07:35:56,264 INFO L226 Difference]: Without dead ends: 105 [2023-12-25 07:35:56,265 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:56,265 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 236 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:56,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 236 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:56,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-25 07:35:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2023-12-25 07:35:56,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.4705882352941178) internal successors, (150), 102 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have 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:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2023-12-25 07:35:56,274 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 39 [2023-12-25 07:35:56,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:56,274 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2023-12-25 07:35:56,274 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:56,274 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2023-12-25 07:35:56,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-25 07:35:56,275 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:56,275 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:56,280 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:56,484 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:56,485 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:56,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:56,485 INFO L85 PathProgramCache]: Analyzing trace with hash -55503080, now seen corresponding path program 1 times [2023-12-25 07:35:56,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:56,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554396380] [2023-12-25 07:35:56,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:56,486 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:56,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:56,487 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:56,490 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:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:56,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:56,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:56,568 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:56,568 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:56,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:56,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554396380] [2023-12-25 07:35:56,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554396380] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:56,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:56,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:56,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190527742] [2023-12-25 07:35:56,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:56,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:56,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:56,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:56,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:56,574 INFO L87 Difference]: Start difference. First operand 103 states and 150 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:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:56,597 INFO L93 Difference]: Finished difference Result 253 states and 384 transitions. [2023-12-25 07:35:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:56,597 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:56,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:56,600 INFO L225 Difference]: With dead ends: 253 [2023-12-25 07:35:56,600 INFO L226 Difference]: Without dead ends: 171 [2023-12-25 07:35:56,602 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:56,603 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 36 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 137 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:56,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 137 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:56,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-25 07:35:56,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2023-12-25 07:35:56,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.4939759036144578) internal successors, (248), 166 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:56,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 248 transitions. [2023-12-25 07:35:56,612 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 248 transitions. Word has length 40 [2023-12-25 07:35:56,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:56,613 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 248 transitions. [2023-12-25 07:35:56,613 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:56,613 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2023-12-25 07:35:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-25 07:35:56,614 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:56,614 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:56,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 07:35:56,817 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:56,817 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:56,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:56,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1754619557, now seen corresponding path program 1 times [2023-12-25 07:35:56,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:56,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725680822] [2023-12-25 07:35:56,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:56,818 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:56,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:56,819 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:56,820 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:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:56,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:56,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:56,909 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:56,909 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:56,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:56,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725680822] [2023-12-25 07:35:56,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725680822] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:56,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:56,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:56,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004731345] [2023-12-25 07:35:56,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:56,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:56,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:56,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:56,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:56,911 INFO L87 Difference]: Start difference. First operand 167 states and 248 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:56,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:56,925 INFO L93 Difference]: Finished difference Result 427 states and 646 transitions. [2023-12-25 07:35:56,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:56,926 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:56,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:56,928 INFO L225 Difference]: With dead ends: 427 [2023-12-25 07:35:56,928 INFO L226 Difference]: Without dead ends: 281 [2023-12-25 07:35:56,931 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:56,932 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 44 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 161 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:56,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 161 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:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-12-25 07:35:56,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2023-12-25 07:35:56,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.4892086330935252) internal successors, (414), 278 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have 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:56,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 414 transitions. [2023-12-25 07:35:56,956 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 414 transitions. Word has length 41 [2023-12-25 07:35:56,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:56,957 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 414 transitions. [2023-12-25 07:35:56,957 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:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 414 transitions. [2023-12-25 07:35:56,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-25 07:35:56,958 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:56,958 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:56,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:57,161 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:57,161 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:57,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:57,162 INFO L85 PathProgramCache]: Analyzing trace with hash 2066619003, now seen corresponding path program 1 times [2023-12-25 07:35:57,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:57,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445587619] [2023-12-25 07:35:57,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:57,163 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:57,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:57,164 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:57,165 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:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:57,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:57,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:57,230 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:57,231 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:57,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:57,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445587619] [2023-12-25 07:35:57,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445587619] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:57,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:57,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:57,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834077662] [2023-12-25 07:35:57,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:57,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:57,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:57,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:57,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:57,232 INFO L87 Difference]: Start difference. First operand 279 states and 414 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:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:57,247 INFO L93 Difference]: Finished difference Result 731 states and 1088 transitions. [2023-12-25 07:35:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:57,247 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:57,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:57,249 INFO L225 Difference]: With dead ends: 731 [2023-12-25 07:35:57,249 INFO L226 Difference]: Without dead ends: 473 [2023-12-25 07:35:57,249 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:57,250 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 48 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 174 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:57,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 174 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:57,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2023-12-25 07:35:57,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 471. [2023-12-25 07:35:57,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 1.4595744680851064) internal successors, (686), 470 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have 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,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 686 transitions. [2023-12-25 07:35:57,260 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 686 transitions. Word has length 41 [2023-12-25 07:35:57,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:57,260 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 686 transitions. [2023-12-25 07:35:57,261 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:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 686 transitions. [2023-12-25 07:35:57,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 07:35:57,261 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:57,262 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:57,264 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:57,464 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:57,464 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:57,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:57,465 INFO L85 PathProgramCache]: Analyzing trace with hash -837991207, now seen corresponding path program 1 times [2023-12-25 07:35:57,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:57,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204624622] [2023-12-25 07:35:57,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:57,466 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:57,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:57,467 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:57,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 07:35:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:57,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:57,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:57,576 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:57,576 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:57,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:57,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204624622] [2023-12-25 07:35:57,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204624622] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:57,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:57,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:57,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972553567] [2023-12-25 07:35:57,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:57,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:57,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:57,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:57,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:57,578 INFO L87 Difference]: Start difference. First operand 471 states and 686 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:57,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:57,598 INFO L93 Difference]: Finished difference Result 918 states and 1356 transitions. [2023-12-25 07:35:57,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:57,599 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:57,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:57,602 INFO L225 Difference]: With dead ends: 918 [2023-12-25 07:35:57,602 INFO L226 Difference]: Without dead ends: 659 [2023-12-25 07:35:57,603 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:57,604 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 49 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 185 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:57,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 185 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:57,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2023-12-25 07:35:57,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 657. [2023-12-25 07:35:57,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 1.451219512195122) internal successors, (952), 656 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have 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,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 952 transitions. [2023-12-25 07:35:57,623 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 952 transitions. Word has length 42 [2023-12-25 07:35:57,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:57,624 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 952 transitions. [2023-12-25 07:35:57,624 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:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 952 transitions. [2023-12-25 07:35:57,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 07:35:57,632 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:57,632 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:57,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 07:35:57,837 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:57,838 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:57,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:57,838 INFO L85 PathProgramCache]: Analyzing trace with hash -2131350025, now seen corresponding path program 1 times [2023-12-25 07:35:57,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:57,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395502559] [2023-12-25 07:35:57,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:57,839 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:57,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:57,840 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:57,841 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:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:57,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:57,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:57,914 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:57,914 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:57,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:57,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395502559] [2023-12-25 07:35:57,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395502559] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:57,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:57,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:57,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672067228] [2023-12-25 07:35:57,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:57,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:57,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:57,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:57,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:57,916 INFO L87 Difference]: Start difference. First operand 657 states and 952 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:57,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:57,938 INFO L93 Difference]: Finished difference Result 1122 states and 1637 transitions. [2023-12-25 07:35:57,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:57,939 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:57,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:57,942 INFO L225 Difference]: With dead ends: 1122 [2023-12-25 07:35:57,942 INFO L226 Difference]: Without dead ends: 488 [2023-12-25 07:35:57,943 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:57,944 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 44 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 174 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:57,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 174 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:57,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2023-12-25 07:35:57,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 486. [2023-12-25 07:35:57,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 1.4391752577319588) internal successors, (698), 485 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have 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,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 698 transitions. [2023-12-25 07:35:57,957 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 698 transitions. Word has length 59 [2023-12-25 07:35:57,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:57,957 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 698 transitions. [2023-12-25 07:35:57,957 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:57,957 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 698 transitions. [2023-12-25 07:35:57,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 07:35:57,958 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:57,958 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 07:35:57,964 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:58,164 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:58,164 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:58,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:58,165 INFO L85 PathProgramCache]: Analyzing trace with hash 368266173, now seen corresponding path program 1 times [2023-12-25 07:35:58,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:58,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161824213] [2023-12-25 07:35:58,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:58,165 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,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:58,166 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:58,168 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:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:58,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 07:35:58,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:58,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:35:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:59,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:59,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161824213] [2023-12-25 07:35:59,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161824213] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:35:59,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:35:59,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 07:35:59,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974990807] [2023-12-25 07:35:59,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:35:59,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:35:59,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:59,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:35:59,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:35:59,006 INFO L87 Difference]: Start difference. First operand 486 states and 698 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:59,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:59,550 INFO L93 Difference]: Finished difference Result 1670 states and 2385 transitions. [2023-12-25 07:35:59,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 07:35:59,551 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:59,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:59,554 INFO L225 Difference]: With dead ends: 1670 [2023-12-25 07:35:59,554 INFO L226 Difference]: Without dead ends: 1228 [2023-12-25 07:35:59,555 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:59,556 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 510 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:59,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 430 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 07:35:59,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2023-12-25 07:35:59,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 996. [2023-12-25 07:35:59,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 995 states have (on average 1.4391959798994975) internal successors, (1432), 995 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have 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:59,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1432 transitions. [2023-12-25 07:35:59,589 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1432 transitions. Word has length 60 [2023-12-25 07:35:59,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:59,589 INFO L495 AbstractCegarLoop]: Abstraction has 996 states and 1432 transitions. [2023-12-25 07:35:59,589 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:59,589 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1432 transitions. [2023-12-25 07:35:59,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 07:35:59,590 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:59,590 INFO L195 NwaCegarLoop]: trace histogram [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:59,599 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:59,792 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:59,793 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:59,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:59,793 INFO L85 PathProgramCache]: Analyzing trace with hash -839369468, now seen corresponding path program 1 times [2023-12-25 07:35:59,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:59,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911208877] [2023-12-25 07:35:59,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:59,794 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:59,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:59,795 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:59,796 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:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:59,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:59,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:59,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:59,885 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:59,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:59,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911208877] [2023-12-25 07:35:59,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911208877] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:59,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:59,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:59,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982773147] [2023-12-25 07:35:59,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:59,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:59,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:59,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:59,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:59,887 INFO L87 Difference]: Start difference. First operand 996 states and 1432 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:59,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:59,931 INFO L93 Difference]: Finished difference Result 2878 states and 4148 transitions. [2023-12-25 07:35:59,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:59,932 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:59,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:59,937 INFO L225 Difference]: With dead ends: 2878 [2023-12-25 07:35:59,938 INFO L226 Difference]: Without dead ends: 1936 [2023-12-25 07:35:59,939 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:59,940 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 41 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 156 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:59,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 156 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:59,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2023-12-25 07:35:59,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1934. [2023-12-25 07:35:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1934 states, 1933 states have (on average 1.4185204345576823) internal successors, (2742), 1933 states have internal predecessors, (2742), 0 states have call successors, (0), 0 states have 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:59,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 2742 transitions. [2023-12-25 07:35:59,994 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 2742 transitions. Word has length 61 [2023-12-25 07:35:59,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:59,995 INFO L495 AbstractCegarLoop]: Abstraction has 1934 states and 2742 transitions. [2023-12-25 07:35:59,995 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:59,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2742 transitions. [2023-12-25 07:35:59,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 07:35:59,996 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:59,996 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:36:00,004 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:36:00,198 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:36:00,199 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:00,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:00,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1100940078, now seen corresponding path program 1 times [2023-12-25 07:36:00,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:00,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978833286] [2023-12-25 07:36:00,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:00,200 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:00,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:00,201 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:36:00,205 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:36:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:00,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 07:36:00,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:00,717 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:00,717 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:00,949 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:00,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:00,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978833286] [2023-12-25 07:36:00,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978833286] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:00,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:00,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-25 07:36:00,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531752072] [2023-12-25 07:36:00,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:00,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:36:00,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:00,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:36:00,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:36:00,951 INFO L87 Difference]: Start difference. First operand 1934 states and 2742 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:36:02,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:02,347 INFO L93 Difference]: Finished difference Result 6966 states and 9842 transitions. [2023-12-25 07:36:02,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-25 07:36:02,348 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:36:02,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:02,363 INFO L225 Difference]: With dead ends: 6966 [2023-12-25 07:36:02,363 INFO L226 Difference]: Without dead ends: 5096 [2023-12-25 07:36:02,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=286, Invalid=904, Unknown=0, NotChecked=0, Total=1190 [2023-12-25 07:36:02,367 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 780 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:02,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1094 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 07:36:02,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5096 states. [2023-12-25 07:36:02,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5096 to 4378. [2023-12-25 07:36:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4378 states, 4377 states have (on average 1.4110121087502856) internal successors, (6176), 4377 states have internal predecessors, (6176), 0 states have call successors, (0), 0 states have 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:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4378 states to 4378 states and 6176 transitions. [2023-12-25 07:36:02,510 INFO L78 Accepts]: Start accepts. Automaton has 4378 states and 6176 transitions. Word has length 61 [2023-12-25 07:36:02,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:02,510 INFO L495 AbstractCegarLoop]: Abstraction has 4378 states and 6176 transitions. [2023-12-25 07:36:02,511 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:36:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 4378 states and 6176 transitions. [2023-12-25 07:36:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 07:36:02,512 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:02,512 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:36:02,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 07:36:02,714 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:36:02,715 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:02,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:02,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1467957549, now seen corresponding path program 1 times [2023-12-25 07:36:02,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:02,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940371910] [2023-12-25 07:36:02,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:02,716 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:02,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:02,717 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:36:02,719 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:36:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:02,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:36:02,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:02,775 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:36:02,776 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:36:02,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:02,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940371910] [2023-12-25 07:36:02,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940371910] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:36:02,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:36:02,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:36:02,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263070601] [2023-12-25 07:36:02,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:36:02,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:36:02,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:02,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:36:02,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:36:02,777 INFO L87 Difference]: Start difference. First operand 4378 states and 6176 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:36:02,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:02,857 INFO L93 Difference]: Finished difference Result 6528 states and 9220 transitions. [2023-12-25 07:36:02,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:36:02,858 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:36:02,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:02,863 INFO L225 Difference]: With dead ends: 6528 [2023-12-25 07:36:02,863 INFO L226 Difference]: Without dead ends: 2234 [2023-12-25 07:36:02,868 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:36:02,868 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 35 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 155 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:36:02,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 155 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:36:02,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2023-12-25 07:36:02,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2232. [2023-12-25 07:36:02,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2232 states, 2231 states have (on average 1.388614970865083) internal successors, (3098), 2231 states have internal predecessors, (3098), 0 states have call successors, (0), 0 states have 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:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 3098 transitions. [2023-12-25 07:36:02,926 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 3098 transitions. Word has length 61 [2023-12-25 07:36:02,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:02,926 INFO L495 AbstractCegarLoop]: Abstraction has 2232 states and 3098 transitions. [2023-12-25 07:36:02,926 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:36:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 3098 transitions. [2023-12-25 07:36:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 07:36:02,927 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:02,927 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:36:02,932 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:36:03,130 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:36:03,130 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:03,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:03,131 INFO L85 PathProgramCache]: Analyzing trace with hash -961672204, now seen corresponding path program 1 times [2023-12-25 07:36:03,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:03,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138443318] [2023-12-25 07:36:03,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:03,131 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,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:03,132 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:36:03,171 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:36:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:03,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 07:36:03,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:03,576 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:36:03,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:03,735 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:36:03,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:03,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138443318] [2023-12-25 07:36:03,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138443318] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:03,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:03,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 07:36:03,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59870889] [2023-12-25 07:36:03,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:03,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:36:03,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:03,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:36:03,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:36:03,737 INFO L87 Difference]: Start difference. First operand 2232 states and 3098 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:36:04,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:04,249 INFO L93 Difference]: Finished difference Result 6266 states and 8705 transitions. [2023-12-25 07:36:04,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 07:36:04,249 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:36:04,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:04,263 INFO L225 Difference]: With dead ends: 6266 [2023-12-25 07:36:04,264 INFO L226 Difference]: Without dead ends: 5028 [2023-12-25 07:36:04,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2023-12-25 07:36:04,268 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 746 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:04,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 422 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:36:04,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5028 states. [2023-12-25 07:36:04,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5028 to 4466. [2023-12-25 07:36:04,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4466 states, 4465 states have (on average 1.3903695408734602) internal successors, (6208), 4465 states have internal predecessors, (6208), 0 states have call successors, (0), 0 states have 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:04,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 6208 transitions. [2023-12-25 07:36:04,437 INFO L78 Accepts]: Start accepts. Automaton has 4466 states and 6208 transitions. Word has length 61 [2023-12-25 07:36:04,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:04,437 INFO L495 AbstractCegarLoop]: Abstraction has 4466 states and 6208 transitions. [2023-12-25 07:36:04,437 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:36:04,437 INFO L276 IsEmpty]: Start isEmpty. Operand 4466 states and 6208 transitions. [2023-12-25 07:36:04,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 07:36:04,438 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:04,438 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:36:04,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-25 07:36:04,641 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:36:04,641 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:04,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:04,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1362443421, now seen corresponding path program 1 times [2023-12-25 07:36:04,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:04,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299562904] [2023-12-25 07:36:04,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:04,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:04,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:04,645 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:36:04,702 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:36:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:04,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:36:04,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:04,741 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:36:04,741 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:36:04,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:04,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299562904] [2023-12-25 07:36:04,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299562904] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:36:04,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:36:04,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:36:04,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023265032] [2023-12-25 07:36:04,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:36:04,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:36:04,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:04,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:36:04,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:36:04,743 INFO L87 Difference]: Start difference. First operand 4466 states and 6208 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:36:04,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:04,799 INFO L93 Difference]: Finished difference Result 6702 states and 9310 transitions. [2023-12-25 07:36:04,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:36:04,800 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:36:04,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:04,806 INFO L225 Difference]: With dead ends: 6702 [2023-12-25 07:36:04,806 INFO L226 Difference]: Without dead ends: 2320 [2023-12-25 07:36:04,810 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:36:04,811 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 29 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 136 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:36:04,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 136 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:36:04,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2023-12-25 07:36:04,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2318. [2023-12-25 07:36:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2317 states have (on average 1.362969356927061) internal successors, (3158), 2317 states have internal predecessors, (3158), 0 states have call successors, (0), 0 states have 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:04,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 3158 transitions. [2023-12-25 07:36:04,873 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 3158 transitions. Word has length 61 [2023-12-25 07:36:04,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:04,873 INFO L495 AbstractCegarLoop]: Abstraction has 2318 states and 3158 transitions. [2023-12-25 07:36:04,873 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:36:04,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 3158 transitions. [2023-12-25 07:36:04,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 07:36:04,874 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:04,874 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] [2023-12-25 07:36:04,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-25 07:36:05,076 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:36:05,077 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:05,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:05,077 INFO L85 PathProgramCache]: Analyzing trace with hash 589678852, now seen corresponding path program 1 times [2023-12-25 07:36:05,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:05,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212924153] [2023-12-25 07:36:05,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:05,078 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:05,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:05,079 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:36:05,109 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:36:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:05,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 07:36:05,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:05,511 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:36:05,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:05,710 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:36:05,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:05,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212924153] [2023-12-25 07:36:05,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212924153] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:05,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:05,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 07:36:05,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030881471] [2023-12-25 07:36:05,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:05,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:36:05,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:05,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:36:05,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:36:05,711 INFO L87 Difference]: Start difference. First operand 2318 states and 3158 transitions. Second operand has 16 states, 16 states have (on average 7.125) internal successors, (114), 15 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:36:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:06,430 INFO L93 Difference]: Finished difference Result 9602 states and 13071 transitions. [2023-12-25 07:36:06,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 07:36:06,430 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 15 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 61 [2023-12-25 07:36:06,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:06,456 INFO L225 Difference]: With dead ends: 9602 [2023-12-25 07:36:06,456 INFO L226 Difference]: Without dead ends: 7368 [2023-12-25 07:36:06,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2023-12-25 07:36:06,459 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 720 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:06,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 444 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 07:36:06,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7368 states. [2023-12-25 07:36:06,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7368 to 6218. [2023-12-25 07:36:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6218 states, 6217 states have (on average 1.3504905903168731) internal successors, (8396), 6217 states have internal predecessors, (8396), 0 states have call successors, (0), 0 states have 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:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 8396 transitions. [2023-12-25 07:36:06,662 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 8396 transitions. Word has length 61 [2023-12-25 07:36:06,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:06,662 INFO L495 AbstractCegarLoop]: Abstraction has 6218 states and 8396 transitions. [2023-12-25 07:36:06,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 15 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:36:06,663 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 8396 transitions. [2023-12-25 07:36:06,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 07:36:06,664 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:06,664 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:36:06,668 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:36:06,866 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:36:06,866 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:06,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:06,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1387793406, now seen corresponding path program 1 times [2023-12-25 07:36:06,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:06,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975393744] [2023-12-25 07:36:06,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:06,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:06,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:06,868 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:36:06,872 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:36:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:06,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:36:06,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:06,934 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:36:06,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:06,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975393744] [2023-12-25 07:36:06,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975393744] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:36:06,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:36:06,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:36:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213163711] [2023-12-25 07:36:06,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:36:06,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:36:06,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:06,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:36:06,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:36:06,936 INFO L87 Difference]: Start difference. First operand 6218 states and 8396 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:36:07,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:07,120 INFO L93 Difference]: Finished difference Result 14470 states and 19560 transitions. [2023-12-25 07:36:07,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:36:07,121 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:36:07,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:07,133 INFO L225 Difference]: With dead ends: 14470 [2023-12-25 07:36:07,133 INFO L226 Difference]: Without dead ends: 8386 [2023-12-25 07:36:07,140 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:36:07,140 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 38 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 182 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:36:07,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 182 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:36:07,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8386 states. [2023-12-25 07:36:07,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8386 to 6988. [2023-12-25 07:36:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6988 states, 6987 states have (on average 1.3341920709889796) internal successors, (9322), 6987 states have internal predecessors, (9322), 0 states have call successors, (0), 0 states have 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:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6988 states to 6988 states and 9322 transitions. [2023-12-25 07:36:07,339 INFO L78 Accepts]: Start accepts. Automaton has 6988 states and 9322 transitions. Word has length 62 [2023-12-25 07:36:07,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:07,339 INFO L495 AbstractCegarLoop]: Abstraction has 6988 states and 9322 transitions. [2023-12-25 07:36:07,340 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:36:07,340 INFO L276 IsEmpty]: Start isEmpty. Operand 6988 states and 9322 transitions. [2023-12-25 07:36:07,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 07:36:07,341 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:07,341 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] [2023-12-25 07:36:07,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-25 07:36:07,544 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:36:07,544 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:07,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:07,545 INFO L85 PathProgramCache]: Analyzing trace with hash 679902832, now seen corresponding path program 1 times [2023-12-25 07:36:07,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:07,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949005881] [2023-12-25 07:36:07,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:07,545 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:07,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:07,546 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:36:07,556 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:36:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:07,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 07:36:07,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:08,029 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:36:08,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:08,256 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:36:08,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:08,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949005881] [2023-12-25 07:36:08,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949005881] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:08,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:08,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-25 07:36:08,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905578019] [2023-12-25 07:36:08,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:08,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:36:08,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:08,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:36:08,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:36:08,258 INFO L87 Difference]: Start difference. First operand 6988 states and 9322 transitions. Second operand has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have 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:09,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:09,429 INFO L93 Difference]: Finished difference Result 23786 states and 31466 transitions. [2023-12-25 07:36:09,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-25 07:36:09,430 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 0 states have call successors, (0), 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:36:09,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:09,458 INFO L225 Difference]: With dead ends: 23786 [2023-12-25 07:36:09,458 INFO L226 Difference]: Without dead ends: 17722 [2023-12-25 07:36:09,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=255, Invalid=867, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:36:09,467 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 983 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:09,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 710 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 07:36:09,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17722 states. [2023-12-25 07:36:10,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17722 to 15860. [2023-12-25 07:36:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15860 states, 15859 states have (on average 1.3229081278769153) internal successors, (20980), 15859 states have internal predecessors, (20980), 0 states have call successors, (0), 0 states have 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:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15860 states to 15860 states and 20980 transitions. [2023-12-25 07:36:10,069 INFO L78 Accepts]: Start accepts. Automaton has 15860 states and 20980 transitions. Word has length 62 [2023-12-25 07:36:10,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:10,070 INFO L495 AbstractCegarLoop]: Abstraction has 15860 states and 20980 transitions. [2023-12-25 07:36:10,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have 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:10,070 INFO L276 IsEmpty]: Start isEmpty. Operand 15860 states and 20980 transitions. [2023-12-25 07:36:10,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 07:36:10,072 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:10,073 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:36:10,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-12-25 07:36:10,275 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:36:10,275 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:10,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:10,276 INFO L85 PathProgramCache]: Analyzing trace with hash 600812563, now seen corresponding path program 1 times [2023-12-25 07:36:10,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:10,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749183869] [2023-12-25 07:36:10,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:10,276 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:10,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:10,277 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:36:10,278 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:36:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:10,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:36:10,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:10,374 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:36:10,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:10,439 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:36:10,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:10,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749183869] [2023-12-25 07:36:10,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749183869] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:10,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:10,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-25 07:36:10,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303220861] [2023-12-25 07:36:10,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:10,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 07:36:10,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:10,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 07:36:10,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:36:10,441 INFO L87 Difference]: Start difference. First operand 15860 states and 20980 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have 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,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:11,173 INFO L93 Difference]: Finished difference Result 48874 states and 64116 transitions. [2023-12-25 07:36:11,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:36:11,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 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:36:11,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:11,234 INFO L225 Difference]: With dead ends: 48874 [2023-12-25 07:36:11,235 INFO L226 Difference]: Without dead ends: 33148 [2023-12-25 07:36:11,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 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:36:11,251 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 146 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:11,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 347 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:36:11,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33148 states. [2023-12-25 07:36:12,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33148 to 32832. [2023-12-25 07:36:12,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32832 states, 32831 states have (on average 1.2686485333983126) internal successors, (41651), 32831 states have internal predecessors, (41651), 0 states have call successors, (0), 0 states have 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:12,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32832 states to 32832 states and 41651 transitions. [2023-12-25 07:36:12,390 INFO L78 Accepts]: Start accepts. Automaton has 32832 states and 41651 transitions. Word has length 62 [2023-12-25 07:36:12,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:12,391 INFO L495 AbstractCegarLoop]: Abstraction has 32832 states and 41651 transitions. [2023-12-25 07:36:12,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have 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:12,391 INFO L276 IsEmpty]: Start isEmpty. Operand 32832 states and 41651 transitions. [2023-12-25 07:36:12,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 07:36:12,393 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:12,393 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:36:12,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-25 07:36:12,595 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:36:12,596 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:12,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:12,596 INFO L85 PathProgramCache]: Analyzing trace with hash 977447893, now seen corresponding path program 1 times [2023-12-25 07:36:12,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:12,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216359843] [2023-12-25 07:36:12,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:12,597 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:12,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:12,598 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:36:12,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-25 07:36:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:12,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 07:36:12,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:13,193 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:36:13,193 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:13,396 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:36:13,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:13,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216359843] [2023-12-25 07:36:13,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216359843] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:13,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:13,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-25 07:36:13,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177960530] [2023-12-25 07:36:13,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:13,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:36:13,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:13,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:36:13,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:36:13,398 INFO L87 Difference]: Start difference. First operand 32832 states and 41651 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 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:36:15,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:15,089 INFO L93 Difference]: Finished difference Result 52868 states and 66542 transitions. [2023-12-25 07:36:15,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 07:36:15,090 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 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 63 [2023-12-25 07:36:15,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:15,189 INFO L225 Difference]: With dead ends: 52868 [2023-12-25 07:36:15,189 INFO L226 Difference]: Without dead ends: 49013 [2023-12-25 07:36:15,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2023-12-25 07:36:15,213 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 783 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:15,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 619 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 07:36:15,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49013 states. [2023-12-25 07:36:16,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49013 to 43101. [2023-12-25 07:36:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43101 states, 43100 states have (on average 1.2689095127610208) internal successors, (54690), 43100 states have internal predecessors, (54690), 0 states have call successors, (0), 0 states have 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:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43101 states to 43101 states and 54690 transitions. [2023-12-25 07:36:16,874 INFO L78 Accepts]: Start accepts. Automaton has 43101 states and 54690 transitions. Word has length 63 [2023-12-25 07:36:16,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:16,875 INFO L495 AbstractCegarLoop]: Abstraction has 43101 states and 54690 transitions. [2023-12-25 07:36:16,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 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:36:16,875 INFO L276 IsEmpty]: Start isEmpty. Operand 43101 states and 54690 transitions. [2023-12-25 07:36:16,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 07:36:16,877 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:16,877 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:36:16,881 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:36:17,079 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:36:17,079 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:17,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:17,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1502322314, now seen corresponding path program 1 times [2023-12-25 07:36:17,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:17,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2184205] [2023-12-25 07:36:17,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:17,080 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:17,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:17,081 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:36:17,082 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:36:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:17,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:36:17,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:17,204 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:36:17,205 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:17,237 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:36:17,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:17,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2184205] [2023-12-25 07:36:17,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2184205] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:17,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:17,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 07:36:17,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599371173] [2023-12-25 07:36:17,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:17,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 07:36:17,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:17,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 07:36:17,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 07:36:17,239 INFO L87 Difference]: Start difference. First operand 43101 states and 54690 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 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:36:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:18,386 INFO L93 Difference]: Finished difference Result 70333 states and 88612 transitions. [2023-12-25 07:36:18,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 07:36:18,387 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 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 63 [2023-12-25 07:36:18,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:18,433 INFO L225 Difference]: With dead ends: 70333 [2023-12-25 07:36:18,434 INFO L226 Difference]: Without dead ends: 35517 [2023-12-25 07:36:18,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-25 07:36:18,447 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 131 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:18,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 228 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:36:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35517 states. [2023-12-25 07:36:19,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35517 to 35279. [2023-12-25 07:36:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35279 states, 35278 states have (on average 1.2565054708316798) internal successors, (44327), 35278 states have internal predecessors, (44327), 0 states have call successors, (0), 0 states have 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,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35279 states to 35279 states and 44327 transitions. [2023-12-25 07:36:19,667 INFO L78 Accepts]: Start accepts. Automaton has 35279 states and 44327 transitions. Word has length 63 [2023-12-25 07:36:19,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:19,667 INFO L495 AbstractCegarLoop]: Abstraction has 35279 states and 44327 transitions. [2023-12-25 07:36:19,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 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:36:19,667 INFO L276 IsEmpty]: Start isEmpty. Operand 35279 states and 44327 transitions. [2023-12-25 07:36:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 07:36:19,669 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:19,669 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:36:19,673 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:36:19,871 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:36:19,871 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:19,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:19,872 INFO L85 PathProgramCache]: Analyzing trace with hash -394359405, now seen corresponding path program 1 times [2023-12-25 07:36:19,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:19,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008791450] [2023-12-25 07:36:19,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:19,872 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,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:19,873 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:36:19,873 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:36:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:19,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:36:19,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:20,016 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:36:20,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:20,055 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:36:20,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:20,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008791450] [2023-12-25 07:36:20,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008791450] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:20,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:20,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 07:36:20,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993177354] [2023-12-25 07:36:20,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:20,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 07:36:20,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:20,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 07:36:20,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 07:36:20,058 INFO L87 Difference]: Start difference. First operand 35279 states and 44327 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:21,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:21,006 INFO L93 Difference]: Finished difference Result 58820 states and 73288 transitions. [2023-12-25 07:36:21,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 07:36:21,006 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2023-12-25 07:36:21,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:21,036 INFO L225 Difference]: With dead ends: 58820 [2023-12-25 07:36:21,036 INFO L226 Difference]: Without dead ends: 23867 [2023-12-25 07:36:21,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 117 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:36:21,054 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 249 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:21,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 258 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:36:21,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23867 states. [2023-12-25 07:36:21,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23867 to 23501. [2023-12-25 07:36:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23501 states, 23500 states have (on average 1.2256595744680852) internal successors, (28803), 23500 states have internal predecessors, (28803), 0 states have call successors, (0), 0 states have 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:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23501 states to 23501 states and 28803 transitions. [2023-12-25 07:36:21,957 INFO L78 Accepts]: Start accepts. Automaton has 23501 states and 28803 transitions. Word has length 63 [2023-12-25 07:36:21,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:21,957 INFO L495 AbstractCegarLoop]: Abstraction has 23501 states and 28803 transitions. [2023-12-25 07:36:21,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:21,957 INFO L276 IsEmpty]: Start isEmpty. Operand 23501 states and 28803 transitions. [2023-12-25 07:36:21,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 07:36:21,958 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:21,958 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:36:21,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-12-25 07:36:22,158 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:36:22,159 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:22,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:22,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1349261026, now seen corresponding path program 1 times [2023-12-25 07:36:22,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:22,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056100564] [2023-12-25 07:36:22,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:22,160 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:22,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:22,161 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:36:22,161 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:36:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:22,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:36:22,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:22,404 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:36:22,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:22,446 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:36:22,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:22,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056100564] [2023-12-25 07:36:22,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056100564] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:22,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:22,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 07:36:22,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790349535] [2023-12-25 07:36:22,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:22,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 07:36:22,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:22,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 07:36:22,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 07:36:22,448 INFO L87 Difference]: Start difference. First operand 23501 states and 28803 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have 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,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:23,203 INFO L93 Difference]: Finished difference Result 43625 states and 53367 transitions. [2023-12-25 07:36:23,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 07:36:23,206 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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:36:23,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:23,227 INFO L225 Difference]: With dead ends: 43625 [2023-12-25 07:36:23,227 INFO L226 Difference]: Without dead ends: 21595 [2023-12-25 07:36:23,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 117 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:36:23,235 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 234 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:23,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 279 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:36:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21595 states. [2023-12-25 07:36:23,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21595 to 19064. [2023-12-25 07:36:23,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19064 states, 19063 states have (on average 1.2099879347426952) internal successors, (23066), 19063 states have internal predecessors, (23066), 0 states have call successors, (0), 0 states have 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,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19064 states to 19064 states and 23066 transitions. [2023-12-25 07:36:23,812 INFO L78 Accepts]: Start accepts. Automaton has 19064 states and 23066 transitions. Word has length 63 [2023-12-25 07:36:23,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:23,812 INFO L495 AbstractCegarLoop]: Abstraction has 19064 states and 23066 transitions. [2023-12-25 07:36:23,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have 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,812 INFO L276 IsEmpty]: Start isEmpty. Operand 19064 states and 23066 transitions. [2023-12-25 07:36:23,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-25 07:36:23,817 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:23,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-25 07:36:24,019 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:36:24,020 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:24,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:24,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1824830081, now seen corresponding path program 1 times [2023-12-25 07:36:24,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:24,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419215916] [2023-12-25 07:36:24,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:24,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:36:24,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:24,021 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:36:24,022 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:36:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:24,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:36:24,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-25 07:36:24,105 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:36:24,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:24,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419215916] [2023-12-25 07:36:24,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419215916] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:36:24,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:36:24,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:36:24,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531817303] [2023-12-25 07:36:24,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:36:24,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:36:24,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:24,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:36:24,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:36:24,107 INFO L87 Difference]: Start difference. First operand 19064 states and 23066 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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:24,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:24,588 INFO L93 Difference]: Finished difference Result 33668 states and 40831 transitions. [2023-12-25 07:36:24,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:36:24,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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 102 [2023-12-25 07:36:24,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:24,608 INFO L225 Difference]: With dead ends: 33668 [2023-12-25 07:36:24,608 INFO L226 Difference]: Without dead ends: 16283 [2023-12-25 07:36:24,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 100 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:36:24,622 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 29 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 162 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:36:24,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 162 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:36:24,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16283 states. [2023-12-25 07:36:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16283 to 14197. [2023-12-25 07:36:25,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14197 states, 14196 states have (on average 1.1835023950408565) internal successors, (16801), 14196 states have internal predecessors, (16801), 0 states have call successors, (0), 0 states have 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:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14197 states to 14197 states and 16801 transitions. [2023-12-25 07:36:25,129 INFO L78 Accepts]: Start accepts. Automaton has 14197 states and 16801 transitions. Word has length 102 [2023-12-25 07:36:25,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:25,130 INFO L495 AbstractCegarLoop]: Abstraction has 14197 states and 16801 transitions. [2023-12-25 07:36:25,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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:25,130 INFO L276 IsEmpty]: Start isEmpty. Operand 14197 states and 16801 transitions. [2023-12-25 07:36:25,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-25 07:36:25,134 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:25,134 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-25 07:36:25,336 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:36:25,336 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:25,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:25,337 INFO L85 PathProgramCache]: Analyzing trace with hash 796584259, now seen corresponding path program 1 times [2023-12-25 07:36:25,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:25,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251159777] [2023-12-25 07:36:25,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:25,337 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:25,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:25,338 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:36:25,339 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:36:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:25,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:36:25,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 07:36:25,428 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:36:25,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:25,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251159777] [2023-12-25 07:36:25,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251159777] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:36:25,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:36:25,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:36:25,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389848982] [2023-12-25 07:36:25,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:36:25,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:36:25,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:25,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:36:25,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:36:25,430 INFO L87 Difference]: Start difference. First operand 14197 states and 16801 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have 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,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:26,051 INFO L93 Difference]: Finished difference Result 20032 states and 23684 transitions. [2023-12-25 07:36:26,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:36:26,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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:36:26,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:26,064 INFO L225 Difference]: With dead ends: 20032 [2023-12-25 07:36:26,064 INFO L226 Difference]: Without dead ends: 11583 [2023-12-25 07:36:26,072 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:36:26,072 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 39 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 191 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:36:26,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 191 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:36:26,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11583 states. [2023-12-25 07:36:26,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11583 to 10027. [2023-12-25 07:36:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10027 states, 10026 states have (on average 1.170656293636545) internal successors, (11737), 10026 states have internal predecessors, (11737), 0 states have call successors, (0), 0 states have 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,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10027 states to 10027 states and 11737 transitions. [2023-12-25 07:36:26,535 INFO L78 Accepts]: Start accepts. Automaton has 10027 states and 11737 transitions. Word has length 103 [2023-12-25 07:36:26,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:26,535 INFO L495 AbstractCegarLoop]: Abstraction has 10027 states and 11737 transitions. [2023-12-25 07:36:26,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have 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,535 INFO L276 IsEmpty]: Start isEmpty. Operand 10027 states and 11737 transitions. [2023-12-25 07:36:26,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-25 07:36:26,538 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:26,538 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:36:26,540 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:36:26,738 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:36:26,738 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:26,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:26,739 INFO L85 PathProgramCache]: Analyzing trace with hash -410402315, now seen corresponding path program 1 times [2023-12-25 07:36:26,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:26,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649042700] [2023-12-25 07:36:26,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:26,739 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:26,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:26,740 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:36:26,748 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:36:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:26,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:36:26,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-25 07:36:26,816 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:36:26,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:26,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649042700] [2023-12-25 07:36:26,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649042700] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:36:26,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:36:26,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:36:26,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920753214] [2023-12-25 07:36:26,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:36:26,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:36:26,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:26,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:36:26,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:36:26,818 INFO L87 Difference]: Start difference. First operand 10027 states and 11737 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:27,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:27,041 INFO L93 Difference]: Finished difference Result 15736 states and 18469 transitions. [2023-12-25 07:36:27,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:36:27,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2023-12-25 07:36:27,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:27,048 INFO L225 Difference]: With dead ends: 15736 [2023-12-25 07:36:27,048 INFO L226 Difference]: Without dead ends: 7376 [2023-12-25 07:36:27,052 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:36:27,052 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 25 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 186 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:36:27,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 186 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:36:27,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2023-12-25 07:36:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7156. [2023-12-25 07:36:27,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7156 states, 7155 states have (on average 1.164220824598183) internal successors, (8330), 7155 states have internal predecessors, (8330), 0 states have call successors, (0), 0 states have 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,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7156 states to 7156 states and 8330 transitions. [2023-12-25 07:36:27,287 INFO L78 Accepts]: Start accepts. Automaton has 7156 states and 8330 transitions. Word has length 103 [2023-12-25 07:36:27,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:27,287 INFO L495 AbstractCegarLoop]: Abstraction has 7156 states and 8330 transitions. [2023-12-25 07:36:27,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:27,288 INFO L276 IsEmpty]: Start isEmpty. Operand 7156 states and 8330 transitions. [2023-12-25 07:36:27,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-25 07:36:27,289 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:27,289 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:36:27,292 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:36:27,490 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:36:27,490 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:27,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:27,490 INFO L85 PathProgramCache]: Analyzing trace with hash 869176632, now seen corresponding path program 1 times [2023-12-25 07:36:27,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:27,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656854299] [2023-12-25 07:36:27,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:27,491 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,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:27,492 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:36:27,492 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:36:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:27,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:36:27,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:27,598 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:36:27,598 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:36:27,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:27,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656854299] [2023-12-25 07:36:27,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656854299] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:36:27,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:36:27,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:36:27,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528423929] [2023-12-25 07:36:27,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:36:27,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:36:27,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:27,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:36:27,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:36:27,599 INFO L87 Difference]: Start difference. First operand 7156 states and 8330 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:36:27,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:27,784 INFO L93 Difference]: Finished difference Result 9349 states and 10853 transitions. [2023-12-25 07:36:27,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:36:27,784 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:36:27,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:27,789 INFO L225 Difference]: With dead ends: 9349 [2023-12-25 07:36:27,790 INFO L226 Difference]: Without dead ends: 5349 [2023-12-25 07:36:27,792 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:36:27,793 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 26 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 206 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:36:27,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 206 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:36:27,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5349 states. [2023-12-25 07:36:27,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5349 to 4218. [2023-12-25 07:36:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4218 states, 4217 states have (on average 1.139672753142044) internal successors, (4806), 4217 states have internal predecessors, (4806), 0 states have call successors, (0), 0 states have 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,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4218 states to 4218 states and 4806 transitions. [2023-12-25 07:36:27,966 INFO L78 Accepts]: Start accepts. Automaton has 4218 states and 4806 transitions. Word has length 105 [2023-12-25 07:36:27,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:27,966 INFO L495 AbstractCegarLoop]: Abstraction has 4218 states and 4806 transitions. [2023-12-25 07:36:27,966 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:36:27,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4218 states and 4806 transitions. [2023-12-25 07:36:27,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-25 07:36:27,968 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:27,968 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:27,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-12-25 07:36:28,168 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:36:28,169 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:28,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:28,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1968343673, now seen corresponding path program 1 times [2023-12-25 07:36:28,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:28,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105063881] [2023-12-25 07:36:28,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:28,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:36:28,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:28,170 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:36:28,171 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:36:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:28,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:36:28,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:29,164 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:29,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:29,582 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:29,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:29,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105063881] [2023-12-25 07:36:29,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105063881] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:29,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:29,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-25 07:36:29,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820457027] [2023-12-25 07:36:29,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:29,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:36:29,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:29,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:36:29,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:36:29,583 INFO L87 Difference]: Start difference. First operand 4218 states and 4806 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:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:34,864 INFO L93 Difference]: Finished difference Result 7844 states and 8923 transitions. [2023-12-25 07:36:34,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-12-25 07:36:34,865 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:34,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:34,872 INFO L225 Difference]: With dead ends: 7844 [2023-12-25 07:36:34,872 INFO L226 Difference]: Without dead ends: 6848 [2023-12-25 07:36:34,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2017 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1381, Invalid=6629, Unknown=0, NotChecked=0, Total=8010 [2023-12-25 07:36:34,875 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 1115 mSDsluCounter, 2200 mSDsCounter, 0 mSdLazyCounter, 2228 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 2274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:34,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 2393 Invalid, 2274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2228 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-25 07:36:34,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6848 states. [2023-12-25 07:36:35,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6848 to 4152. [2023-12-25 07:36:35,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4152 states, 4151 states have (on average 1.1361117802939051) internal successors, (4716), 4151 states have internal predecessors, (4716), 0 states have call successors, (0), 0 states have 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:35,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 4716 transitions. [2023-12-25 07:36:35,069 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 4716 transitions. Word has length 107 [2023-12-25 07:36:35,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:35,069 INFO L495 AbstractCegarLoop]: Abstraction has 4152 states and 4716 transitions. [2023-12-25 07:36:35,070 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:35,070 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 4716 transitions. [2023-12-25 07:36:35,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-25 07:36:35,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:35,071 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:35,073 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 (28)] Ended with exit code 0 [2023-12-25 07:36:35,271 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:36:35,272 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:35,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:35,272 INFO L85 PathProgramCache]: Analyzing trace with hash -21647904, now seen corresponding path program 1 times [2023-12-25 07:36:35,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:35,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835037962] [2023-12-25 07:36:35,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:35,272 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:35,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:35,273 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:36:35,274 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:36:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:35,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:36:35,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:36,262 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:36:36,262 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:36,687 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:36:36,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:36,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835037962] [2023-12-25 07:36:36,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835037962] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:36,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:36,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-25 07:36:36,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737775573] [2023-12-25 07:36:36,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:36,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:36:36,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:36,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:36:36,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:36:36,690 INFO L87 Difference]: Start difference. First operand 4152 states and 4716 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:43,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:43,414 INFO L93 Difference]: Finished difference Result 9071 states and 10370 transitions. [2023-12-25 07:36:43,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-12-25 07:36:43,414 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:43,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:43,421 INFO L225 Difference]: With dead ends: 9071 [2023-12-25 07:36:43,421 INFO L226 Difference]: Without dead ends: 7751 [2023-12-25 07:36:43,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2163 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1335, Invalid=7037, Unknown=0, NotChecked=0, Total=8372 [2023-12-25 07:36:43,423 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 882 mSDsluCounter, 3166 mSDsCounter, 0 mSdLazyCounter, 3165 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 3367 SdHoareTripleChecker+Invalid, 3193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:43,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 3367 Invalid, 3193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3165 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-25 07:36:43,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7751 states. [2023-12-25 07:36:43,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7751 to 5872. [2023-12-25 07:36:43,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5872 states, 5871 states have (on average 1.13779594617612) internal successors, (6680), 5871 states have internal predecessors, (6680), 0 states have call successors, (0), 0 states have 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:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5872 states to 5872 states and 6680 transitions. [2023-12-25 07:36:43,684 INFO L78 Accepts]: Start accepts. Automaton has 5872 states and 6680 transitions. Word has length 107 [2023-12-25 07:36:43,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:43,685 INFO L495 AbstractCegarLoop]: Abstraction has 5872 states and 6680 transitions. [2023-12-25 07:36:43,685 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:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 5872 states and 6680 transitions. [2023-12-25 07:36:43,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-25 07:36:43,686 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:43,686 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, 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:43,689 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 (29)] Ended with exit code 0 [2023-12-25 07:36:43,886 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:43,887 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:43,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:43,887 INFO L85 PathProgramCache]: Analyzing trace with hash -204975588, now seen corresponding path program 1 times [2023-12-25 07:36:43,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:43,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114090521] [2023-12-25 07:36:43,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:43,888 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:43,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:43,889 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:43,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-25 07:36:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:43,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:36:43,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 23 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:44,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 23 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:45,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:45,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114090521] [2023-12-25 07:36:45,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114090521] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:45,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:45,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-25 07:36:45,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152087682] [2023-12-25 07:36:45,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:45,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:36:45,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:45,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:36:45,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:36:45,204 INFO L87 Difference]: Start difference. First operand 5872 states and 6680 transitions. Second operand has 26 states, 26 states have (on average 7.923076923076923) internal successors, (206), 26 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have 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:49,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:49,860 INFO L93 Difference]: Finished difference Result 9329 states and 10563 transitions. [2023-12-25 07:36:49,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-12-25 07:36:49,860 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.923076923076923) internal successors, (206), 26 states have internal predecessors, (206), 0 states have call successors, (0), 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 109 [2023-12-25 07:36:49,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:49,869 INFO L225 Difference]: With dead ends: 9329 [2023-12-25 07:36:49,869 INFO L226 Difference]: Without dead ends: 8880 [2023-12-25 07:36:49,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=962, Invalid=4588, Unknown=0, NotChecked=0, Total=5550 [2023-12-25 07:36:49,873 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 845 mSDsluCounter, 2299 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 2471 SdHoareTripleChecker+Invalid, 2197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:49,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 2471 Invalid, 2197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-25 07:36:49,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8880 states. [2023-12-25 07:36:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8880 to 7306. [2023-12-25 07:36:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7306 states, 7305 states have (on average 1.1351129363449692) internal successors, (8292), 7305 states have internal predecessors, (8292), 0 states have call successors, (0), 0 states have 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:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7306 states to 7306 states and 8292 transitions. [2023-12-25 07:36:50,240 INFO L78 Accepts]: Start accepts. Automaton has 7306 states and 8292 transitions. Word has length 109 [2023-12-25 07:36:50,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:50,240 INFO L495 AbstractCegarLoop]: Abstraction has 7306 states and 8292 transitions. [2023-12-25 07:36:50,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.923076923076923) internal successors, (206), 26 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have 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:50,240 INFO L276 IsEmpty]: Start isEmpty. Operand 7306 states and 8292 transitions. [2023-12-25 07:36:50,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-25 07:36:50,244 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:50,244 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, 1, 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:50,247 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:50,447 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:50,447 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:50,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:50,448 INFO L85 PathProgramCache]: Analyzing trace with hash 988804817, now seen corresponding path program 2 times [2023-12-25 07:36:50,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:50,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294698157] [2023-12-25 07:36:50,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 07:36:50,448 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:50,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:50,449 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:50,451 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:50,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 07:36:50,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 07:36:50,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 07:36:50,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:51,085 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 132 proven. 30 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-25 07:36:51,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 132 proven. 30 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-25 07:36:51,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:51,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294698157] [2023-12-25 07:36:51,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294698157] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:51,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:51,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2023-12-25 07:36:51,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249520366] [2023-12-25 07:36:51,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:51,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 07:36:51,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:51,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 07:36:51,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-12-25 07:36:51,313 INFO L87 Difference]: Start difference. First operand 7306 states and 8292 transitions. Second operand has 18 states, 18 states have (on average 10.055555555555555) internal successors, (181), 18 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have 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:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:53,171 INFO L93 Difference]: Finished difference Result 10281 states and 11696 transitions. [2023-12-25 07:36:53,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-25 07:36:53,171 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 10.055555555555555) internal successors, (181), 18 states have internal predecessors, (181), 0 states have call successors, (0), 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 142 [2023-12-25 07:36:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:53,178 INFO L225 Difference]: With dead ends: 10281 [2023-12-25 07:36:53,178 INFO L226 Difference]: Without dead ends: 7995 [2023-12-25 07:36:53,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=392, Invalid=1414, Unknown=0, NotChecked=0, Total=1806 [2023-12-25 07:36:53,181 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 919 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:53,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 1183 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 07:36:53,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7995 states. [2023-12-25 07:36:53,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7995 to 7442. [2023-12-25 07:36:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7442 states, 7441 states have (on average 1.132240290283564) internal successors, (8425), 7441 states have internal predecessors, (8425), 0 states have call successors, (0), 0 states have 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:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7442 states to 7442 states and 8425 transitions. [2023-12-25 07:36:53,529 INFO L78 Accepts]: Start accepts. Automaton has 7442 states and 8425 transitions. Word has length 142 [2023-12-25 07:36:53,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:53,529 INFO L495 AbstractCegarLoop]: Abstraction has 7442 states and 8425 transitions. [2023-12-25 07:36:53,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.055555555555555) internal successors, (181), 18 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have 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:53,529 INFO L276 IsEmpty]: Start isEmpty. Operand 7442 states and 8425 transitions. [2023-12-25 07:36:53,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-25 07:36:53,532 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:53,532 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, 1, 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:53,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-12-25 07:36:53,735 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:53,735 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:53,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:53,735 INFO L85 PathProgramCache]: Analyzing trace with hash 317505678, now seen corresponding path program 1 times [2023-12-25 07:36:53,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:53,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520812841] [2023-12-25 07:36:53,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:53,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:53,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:53,737 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:53,738 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:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 07:36:53,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 07:36:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 07:36:53,918 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 07:36:53,919 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 07:36:53,919 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 07:36:53,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-12-25 07:36:54,123 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:54,127 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] [2023-12-25 07:36:54,130 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 07:36:54,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 07:36:54 BoogieIcfgContainer [2023-12-25 07:36:54,257 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 07:36:54,257 INFO L158 Benchmark]: Toolchain (without parser) took 60264.28ms. Allocated memory was 348.1MB in the beginning and 4.9GB in the end (delta: 4.6GB). Free memory was 305.5MB in the beginning and 3.0GB in the end (delta: -2.7GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2023-12-25 07:36:54,257 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 240.1MB. Free memory is still 190.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 07:36:54,258 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.31ms. Allocated memory is still 348.1MB. Free memory was 305.2MB in the beginning and 290.8MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-25 07:36:54,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.32ms. Allocated memory is still 348.1MB. Free memory was 290.8MB in the beginning and 288.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 07:36:54,261 INFO L158 Benchmark]: Boogie Preprocessor took 39.06ms. Allocated memory is still 348.1MB. Free memory was 288.4MB in the beginning and 285.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 07:36:54,261 INFO L158 Benchmark]: RCFGBuilder took 554.94ms. Allocated memory is still 348.1MB. Free memory was 285.9MB in the beginning and 262.9MB in the end (delta: 23.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-25 07:36:54,261 INFO L158 Benchmark]: TraceAbstraction took 59360.20ms. Allocated memory was 348.1MB in the beginning and 4.9GB in the end (delta: 4.6GB). Free memory was 262.2MB in the beginning and 3.0GB in the end (delta: -2.7GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2023-12-25 07:36:54,267 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.15ms. Allocated memory is still 240.1MB. Free memory is still 190.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 261.31ms. Allocated memory is still 348.1MB. Free memory was 305.2MB in the beginning and 290.8MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.32ms. Allocated memory is still 348.1MB. Free memory was 290.8MB in the beginning and 288.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.06ms. Allocated memory is still 348.1MB. Free memory was 288.4MB in the beginning and 285.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 554.94ms. Allocated memory is still 348.1MB. Free memory was 285.9MB in the beginning and 262.9MB in the end (delta: 23.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 59360.20ms. Allocated memory was 348.1MB in the beginning and 4.9GB in the end (delta: 4.6GB). Free memory was 262.2MB in the beginning and 3.0GB in the end (delta: -2.7GB). 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: 311]: 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 ; [L256] int c1 ; [L257] int i2 ; [L260] c1 = 0 [L261] r1 = __VERIFIER_nondet_uchar() [L262] id1 = __VERIFIER_nondet_char() [L263] st1 = __VERIFIER_nondet_char() [L264] send1 = __VERIFIER_nondet_char() [L265] mode1 = __VERIFIER_nondet_bool() [L266] alive1 = __VERIFIER_nondet_bool() [L267] id2 = __VERIFIER_nondet_char() [L268] st2 = __VERIFIER_nondet_char() [L269] send2 = __VERIFIER_nondet_char() [L270] mode2 = __VERIFIER_nondet_bool() [L271] alive2 = __VERIFIER_nondet_bool() [L272] id3 = __VERIFIER_nondet_char() [L273] st3 = __VERIFIER_nondet_char() [L274] send3 = __VERIFIER_nondet_char() [L275] mode3 = __VERIFIER_nondet_bool() [L276] alive3 = __VERIFIER_nondet_bool() [L277] CALL, EXPR init() [L159] 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] [L162] 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] [L163] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 VAL [alive1=0, alive2=0, alive3=1, 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] [L164] COND TRUE (int )id1 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=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] [L165] COND TRUE (int )st1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, st1=0] [L166] COND TRUE (int )send1 == (int )id1 VAL [alive1=0, alive2=0, alive3=1, id1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, st1=0] [L167] COND TRUE (int )mode1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, st1=0] [L168] COND TRUE (int )id2 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=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=0, st1=0] [L169] COND TRUE (int )st2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=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=0, st1=0, st2=0] [L170] COND TRUE (int )send2 == (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=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=0, send2=64, st1=0, st2=0] [L171] COND TRUE (int )mode2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, st1=0, st2=0] [L172] COND TRUE (int )id3 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, st1=0, st2=0] [L173] COND TRUE (int )st3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, st1=0, st2=0, st3=0] [L174] COND TRUE (int )send3 == (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L175] COND TRUE (int )mode3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L176] COND TRUE (int )id1 != (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L177] COND TRUE (int )id1 != (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L178] COND TRUE (int )id2 != (int )id3 [L179] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0, tmp=1] [L231] return (tmp); [L277] RET, EXPR init() [L277] i2 = init() [L278] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, alive1=0, alive2=0, alive3=1, cond=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L278] RET assume_abort_if_not(i2) [L279] p1_old = nomsg [L280] p1_new = nomsg [L281] p2_old = nomsg [L282] p2_new = nomsg [L283] p3_old = nomsg [L284] p3_new = nomsg [L285] i2 = 0 VAL [alive1=0, alive2=0, alive3=1, c1=0, i2=0, id1=0, id2=64, id3=96, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L286] COND TRUE 1 [L288] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L60] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L81] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L84] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L95] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L112] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L115] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L118] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=1, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L129] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L146] COND TRUE \read(alive3) [L147] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L152] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, 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=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, 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=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L240] COND TRUE (int )r1 < 3 [L241] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, 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=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0, tmp=1] [L251] return (tmp); [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, 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=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L298] RET assert(c1) [L286] COND TRUE 1 [L288] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, mode2=1, 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=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L60] COND TRUE \read(mode1) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, mode2=1, 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=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L61] COND FALSE !(r1 == 255) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, mode2=1, 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=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L64] r1 = r1 + 1 [L65] m1 = p3_old [L66] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L67] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L68] COND FALSE !(\read(alive1)) [L76] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L79] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=0, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L95] COND TRUE \read(mode2) [L96] m2 = p1_old [L97] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L98] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L110] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L129] COND TRUE \read(mode3) [L130] m3 = p2_old [L131] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L132] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L144] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L240] COND TRUE (int )r1 < 3 [L241] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0, tmp=1] [L251] return (tmp); [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=64, id3=96, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L298] RET assert(c1) [L286] COND TRUE 1 [L288] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L60] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L81] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L84] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L95] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L112] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L115] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L118] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L129] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L146] COND TRUE \read(alive3) [L147] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L152] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, 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=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, 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=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L240] COND TRUE (int )r1 < 3 [L241] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, 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=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0, tmp=1] [L251] return (tmp); [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, 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=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L298] RET assert(c1) [L286] COND TRUE 1 [L288] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, mode2=1, 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=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L60] COND TRUE \read(mode1) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, mode2=1, 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=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L61] COND FALSE !(r1 == 255) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, mode2=1, 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=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L64] r1 = r1 + 1 [L65] m1 = p3_old [L66] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L67] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L68] COND FALSE !(\read(alive1)) [L76] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L79] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=0, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L95] COND TRUE \read(mode2) [L96] m2 = p1_old [L97] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L98] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L110] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L129] COND TRUE \read(mode3) [L130] m3 = p2_old [L131] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L132] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L144] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L240] COND TRUE (int )r1 < 3 [L241] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0, tmp=1] [L251] return (tmp); [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=64, id3=96, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L298] RET assert(c1) [L286] COND TRUE 1 [L288] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L60] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L81] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L84] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L95] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L112] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L115] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L118] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L129] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L146] COND TRUE \read(alive3) [L147] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L152] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, 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=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, 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=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L240] COND TRUE (int )r1 < 3 [L241] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, 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=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0, tmp=1] [L251] return (tmp); [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, 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=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L298] RET assert(c1) [L286] COND TRUE 1 [L288] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, mode2=1, 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=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L60] COND TRUE \read(mode1) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, mode2=1, 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=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L61] COND FALSE !(r1 == 255) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, mode2=1, 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=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L64] r1 = r1 + 1 [L65] m1 = p3_old [L66] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L67] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L68] COND FALSE !(\read(alive1)) [L76] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L79] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=0, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L95] COND TRUE \read(mode2) [L96] m2 = p1_old [L97] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L98] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L110] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L129] COND TRUE \read(mode3) [L130] m3 = p2_old [L131] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L132] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L144] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-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=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L240] COND FALSE !((int )r1 < 3) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L243] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 1) [L246] tmp = 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0, tmp=0] [L251] return (tmp); [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND TRUE ! arg VAL [\old(arg)=0, alive1=0, alive2=0, alive3=1, arg=0, id1=0, id2=64, id3=96, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L311] reach_error() VAL [\old(arg)=0, alive1=0, alive2=0, alive3=1, arg=0, id1=0, id2=64, id3=96, 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=96, send2=64, send3=96, st1=0, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 59.2s, OverallIterations: 31, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 31.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9747 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9747 mSDsluCounter, 17259 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14076 mSDsCounter, 270 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11920 IncrementalHoareTripleChecker+Invalid, 12190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 270 mSolverCounterUnsat, 3183 mSDtfsCounter, 11920 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3404 GetRequests, 2887 SyntacticMatches, 0 SemanticMatches, 517 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6743 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43101occurred in iteration=19, InterpolantAutomatonStates: 416, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.7s AutomataMinimizationTime, 30 MinimizatonAttempts, 27082 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 2206 NumberOfCodeBlocks, 2206 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3104 ConstructedInterpolants, 589 QuantifiedInterpolants, 25714 SizeOfPredicates, 83 NumberOfNonLiveVariables, 3980 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 44 InterpolantComputations, 16 PerfectInterpolantSequences, 1058/1576 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:36:54,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...