/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 09:19:28,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 09:19:28,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 09:19:28,760 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 09:19:28,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 09:19:28,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 09:19:28,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 09:19:28,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 09:19:28,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 09:19:28,789 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 09:19:28,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 09:19:28,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 09:19:28,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 09:19:28,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 09:19:28,791 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 09:19:28,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 09:19:28,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 09:19:28,792 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 09:19:28,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 09:19:28,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 09:19:28,792 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 09:19:28,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 09:19:28,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 09:19:28,793 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 09:19:28,793 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 09:19:28,793 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 09:19:28,793 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 09:19:28,793 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 09:19:28,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 09:19:28,794 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 09:19:28,795 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 09:19:28,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 09:19:28,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 09:19:28,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 09:19:28,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 09:19:28,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 09:19:28,795 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 09:19:28,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 09:19:28,795 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 09:19:28,796 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 09:19:28,796 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 09:19:28,796 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 09:19:28,796 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 09:19:28,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 09:19:28,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 09:19:28,796 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 09:19:28,796 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 09:19:28,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 09:19:28,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 09:19:28,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 09:19:28,974 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 09:19:28,974 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 09:19:28,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2023-12-25 09:19:30,154 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 09:19:30,319 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 09:19:30,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2023-12-25 09:19:30,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44846ca8/7e7cccf9bf8745638ac34dda1423a465/FLAG415a4a061 [2023-12-25 09:19:30,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44846ca8/7e7cccf9bf8745638ac34dda1423a465 [2023-12-25 09:19:30,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 09:19:30,356 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 09:19:30,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 09:19:30,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 09:19:30,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 09:19:30,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 09:19:30" (1/1) ... [2023-12-25 09:19:30,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a84adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:30, skipping insertion in model container [2023-12-25 09:19:30,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 09:19:30" (1/1) ... [2023-12-25 09:19:30,408 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 09:19:30,547 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4373,4386] [2023-12-25 09:19:30,577 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 09:19:30,592 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 09:19:30,638 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4373,4386] [2023-12-25 09:19:30,647 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 09:19:30,660 INFO L206 MainTranslator]: Completed translation [2023-12-25 09:19:30,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:30 WrapperNode [2023-12-25 09:19:30,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 09:19:30,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 09:19:30,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 09:19:30,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 09:19:30,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:30" (1/1) ... [2023-12-25 09:19:30,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:30" (1/1) ... [2023-12-25 09:19:30,695 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 351 [2023-12-25 09:19:30,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 09:19:30,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 09:19:30,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 09:19:30,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 09:19:30,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:30" (1/1) ... [2023-12-25 09:19:30,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:30" (1/1) ... [2023-12-25 09:19:30,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:30" (1/1) ... [2023-12-25 09:19:30,724 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 09:19:30,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:30" (1/1) ... [2023-12-25 09:19:30,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:30" (1/1) ... [2023-12-25 09:19:30,729 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:30" (1/1) ... [2023-12-25 09:19:30,731 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:30" (1/1) ... [2023-12-25 09:19:30,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:30" (1/1) ... [2023-12-25 09:19:30,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:30" (1/1) ... [2023-12-25 09:19:30,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 09:19:30,745 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 09:19:30,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 09:19:30,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 09:19:30,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:30" (1/1) ... [2023-12-25 09:19:30,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 09:19:30,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 09:19:30,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 09:19:30,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 09:19:30,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 09:19:30,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 09:19:30,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 09:19:30,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 09:19:30,963 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 09:19:30,965 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 09:19:31,268 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 09:19:31,297 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 09:19:31,297 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 09:19:31,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 09:19:31 BoogieIcfgContainer [2023-12-25 09:19:31,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 09:19:31,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 09:19:31,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 09:19:31,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 09:19:31,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 09:19:30" (1/3) ... [2023-12-25 09:19:31,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8bc680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 09:19:31, skipping insertion in model container [2023-12-25 09:19:31,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:30" (2/3) ... [2023-12-25 09:19:31,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8bc680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 09:19:31, skipping insertion in model container [2023-12-25 09:19:31,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 09:19:31" (3/3) ... [2023-12-25 09:19:31,305 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2023-12-25 09:19:31,317 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 09:19:31,317 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 09:19:31,360 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 09:19:31,364 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;@1f7da7d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 09:19:31,365 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 09:19:31,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 81 states have (on average 1.7037037037037037) internal successors, (138), 82 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:31,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 09:19:31,386 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:31,386 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] [2023-12-25 09:19:31,387 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:31,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:31,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1085213270, now seen corresponding path program 1 times [2023-12-25 09:19:31,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:31,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678364913] [2023-12-25 09:19:31,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:31,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:31,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:31,408 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:19:31,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 09:19:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:31,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:19:31,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:31,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:19:31,566 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:31,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:31,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678364913] [2023-12-25 09:19:31,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678364913] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:31,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:31,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:19:31,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185448974] [2023-12-25 09:19:31,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:31,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:19:31,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:31,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:19:31,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:31,590 INFO L87 Difference]: Start difference. First operand has 83 states, 81 states have (on average 1.7037037037037037) internal successors, (138), 82 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:31,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:31,657 INFO L93 Difference]: Finished difference Result 195 states and 314 transitions. [2023-12-25 09:19:31,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:19:31,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2023-12-25 09:19:31,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:31,667 INFO L225 Difference]: With dead ends: 195 [2023-12-25 09:19:31,667 INFO L226 Difference]: Without dead ends: 127 [2023-12-25 09:19:31,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:31,672 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 100 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 292 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 09:19:31,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 292 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:19:31,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-12-25 09:19:31,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2023-12-25 09:19:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.5080645161290323) internal successors, (187), 124 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 187 transitions. [2023-12-25 09:19:31,700 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 187 transitions. Word has length 36 [2023-12-25 09:19:31,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:31,700 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 187 transitions. [2023-12-25 09:19:31,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 187 transitions. [2023-12-25 09:19:31,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 09:19:31,706 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:31,706 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] [2023-12-25 09:19:31,711 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 09:19:31,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:31,910 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:31,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:31,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1921613256, now seen corresponding path program 1 times [2023-12-25 09:19:31,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:31,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751322579] [2023-12-25 09:19:31,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:31,911 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:31,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:31,913 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:19:31,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 09:19:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:31,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:19:31,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:19:32,031 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:32,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:32,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751322579] [2023-12-25 09:19:32,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751322579] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:32,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:32,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:19:32,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545871696] [2023-12-25 09:19:32,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:32,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:19:32,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:32,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:19:32,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:32,034 INFO L87 Difference]: Start difference. First operand 125 states and 187 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:32,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:32,066 INFO L93 Difference]: Finished difference Result 305 states and 471 transitions. [2023-12-25 09:19:32,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:19:32,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2023-12-25 09:19:32,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:32,073 INFO L225 Difference]: With dead ends: 305 [2023-12-25 09:19:32,073 INFO L226 Difference]: Without dead ends: 199 [2023-12-25 09:19:32,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:32,074 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 81 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:32,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 252 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:19:32,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-12-25 09:19:32,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2023-12-25 09:19:32,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.530612244897959) internal successors, (300), 196 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:32,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 300 transitions. [2023-12-25 09:19:32,090 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 300 transitions. Word has length 37 [2023-12-25 09:19:32,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:32,090 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 300 transitions. [2023-12-25 09:19:32,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:32,090 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 300 transitions. [2023-12-25 09:19:32,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 09:19:32,091 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:32,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:19:32,101 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 (3)] Ended with exit code 0 [2023-12-25 09:19:32,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:32,304 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:32,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:32,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1122057593, now seen corresponding path program 1 times [2023-12-25 09:19:32,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:32,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [928370367] [2023-12-25 09:19:32,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:32,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:32,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:32,306 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:19:32,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 09:19:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:32,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:19:32,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:19:32,414 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:32,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:32,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [928370367] [2023-12-25 09:19:32,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [928370367] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:32,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:32,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:19:32,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456706383] [2023-12-25 09:19:32,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:32,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:19:32,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:32,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:19:32,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:32,416 INFO L87 Difference]: Start difference. First operand 197 states and 300 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:32,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:32,446 INFO L93 Difference]: Finished difference Result 489 states and 758 transitions. [2023-12-25 09:19:32,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:19:32,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-12-25 09:19:32,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:32,450 INFO L225 Difference]: With dead ends: 489 [2023-12-25 09:19:32,450 INFO L226 Difference]: Without dead ends: 311 [2023-12-25 09:19:32,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:32,452 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 76 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:32,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 237 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:19:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-12-25 09:19:32,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2023-12-25 09:19:32,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.5324675324675325) internal successors, (472), 308 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 472 transitions. [2023-12-25 09:19:32,473 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 472 transitions. Word has length 38 [2023-12-25 09:19:32,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:32,473 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 472 transitions. [2023-12-25 09:19:32,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 472 transitions. [2023-12-25 09:19:32,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-25 09:19:32,474 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:32,474 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 09:19:32,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 09:19:32,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:32,702 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:32,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:32,706 INFO L85 PathProgramCache]: Analyzing trace with hash -664411233, now seen corresponding path program 1 times [2023-12-25 09:19:32,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:32,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245583875] [2023-12-25 09:19:32,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:32,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:32,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:32,708 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:19:32,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 09:19:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:32,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:19:32,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:19:32,889 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:32,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:32,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245583875] [2023-12-25 09:19:32,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245583875] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:32,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:32,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:19:32,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675156077] [2023-12-25 09:19:32,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:32,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:19:32,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:32,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:19:32,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:19:32,896 INFO L87 Difference]: Start difference. First operand 309 states and 472 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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 09:19:32,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:32,950 INFO L93 Difference]: Finished difference Result 1047 states and 1615 transitions. [2023-12-25 09:19:32,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:19:32,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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 09:19:32,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:32,953 INFO L225 Difference]: With dead ends: 1047 [2023-12-25 09:19:32,953 INFO L226 Difference]: Without dead ends: 757 [2023-12-25 09:19:32,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:19:32,955 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 323 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:32,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 328 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:19:32,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2023-12-25 09:19:32,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 753. [2023-12-25 09:19:33,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 752 states have (on average 1.5319148936170213) internal successors, (1152), 752 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:33,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1152 transitions. [2023-12-25 09:19:33,004 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1152 transitions. Word has length 39 [2023-12-25 09:19:33,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:33,005 INFO L495 AbstractCegarLoop]: Abstraction has 753 states and 1152 transitions. [2023-12-25 09:19:33,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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 09:19:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1152 transitions. [2023-12-25 09:19:33,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-25 09:19:33,006 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:33,006 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 09:19:33,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 09:19:33,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:33,209 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:33,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:33,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1419799384, now seen corresponding path program 1 times [2023-12-25 09:19:33,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:33,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473166957] [2023-12-25 09:19:33,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:33,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:33,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:33,224 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:19:33,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 09:19:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:33,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:19:33,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:33,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:19:33,548 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:33,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:33,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473166957] [2023-12-25 09:19:33,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473166957] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:33,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:33,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:19:33,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946610543] [2023-12-25 09:19:33,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:33,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:19:33,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:33,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:19:33,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:19:33,552 INFO L87 Difference]: Start difference. First operand 753 states and 1152 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 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 09:19:33,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:33,695 INFO L93 Difference]: Finished difference Result 2221 states and 3418 transitions. [2023-12-25 09:19:33,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:19:33,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 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 09:19:33,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:33,700 INFO L225 Difference]: With dead ends: 2221 [2023-12-25 09:19:33,701 INFO L226 Difference]: Without dead ends: 1487 [2023-12-25 09:19:33,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-25 09:19:33,703 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 290 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:33,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 137 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:19:33,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2023-12-25 09:19:33,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1485. [2023-12-25 09:19:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1485 states, 1484 states have (on average 1.528301886792453) internal successors, (2268), 1484 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:33,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 2268 transitions. [2023-12-25 09:19:33,732 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 2268 transitions. Word has length 41 [2023-12-25 09:19:33,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:33,732 INFO L495 AbstractCegarLoop]: Abstraction has 1485 states and 2268 transitions. [2023-12-25 09:19:33,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 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 09:19:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 2268 transitions. [2023-12-25 09:19:33,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-25 09:19:33,733 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:33,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:19:33,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 09:19:33,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:33,936 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:33,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:33,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1090247795, now seen corresponding path program 1 times [2023-12-25 09:19:33,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:33,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023867029] [2023-12-25 09:19:33,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:33,938 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:33,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:33,939 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:19:33,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 09:19:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:33,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:19:33,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:19:34,172 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:34,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:34,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023867029] [2023-12-25 09:19:34,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023867029] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:34,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:34,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:19:34,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897665602] [2023-12-25 09:19:34,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:34,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:19:34,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:34,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:19:34,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:19:34,174 INFO L87 Difference]: Start difference. First operand 1485 states and 2268 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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 09:19:34,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:34,243 INFO L93 Difference]: Finished difference Result 5981 states and 9156 transitions. [2023-12-25 09:19:34,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:19:34,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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 09:19:34,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:34,257 INFO L225 Difference]: With dead ends: 5981 [2023-12-25 09:19:34,258 INFO L226 Difference]: Without dead ends: 4515 [2023-12-25 09:19:34,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:19:34,261 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 261 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:34,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 642 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:19:34,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2023-12-25 09:19:34,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 2949. [2023-12-25 09:19:34,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2948 states have (on average 1.4993215739484396) internal successors, (4420), 2948 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:34,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4420 transitions. [2023-12-25 09:19:34,321 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4420 transitions. Word has length 41 [2023-12-25 09:19:34,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:34,323 INFO L495 AbstractCegarLoop]: Abstraction has 2949 states and 4420 transitions. [2023-12-25 09:19:34,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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 09:19:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4420 transitions. [2023-12-25 09:19:34,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 09:19:34,327 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:34,327 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 09:19:34,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 09:19:34,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:34,530 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:34,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:34,531 INFO L85 PathProgramCache]: Analyzing trace with hash 542600406, now seen corresponding path program 1 times [2023-12-25 09:19:34,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:34,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714122588] [2023-12-25 09:19:34,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:34,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:34,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:34,533 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:19:34,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 09:19:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:34,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 09:19:34,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:19:34,624 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:34,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:34,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714122588] [2023-12-25 09:19:34,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714122588] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:34,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:34,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:19:34,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088991832] [2023-12-25 09:19:34,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:34,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 09:19:34,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:34,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 09:19:34,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 09:19:34,627 INFO L87 Difference]: Start difference. First operand 2949 states and 4420 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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 09:19:34,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:34,669 INFO L93 Difference]: Finished difference Result 6071 states and 9013 transitions. [2023-12-25 09:19:34,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:19:34,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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 09:19:34,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:34,684 INFO L225 Difference]: With dead ends: 6071 [2023-12-25 09:19:34,684 INFO L226 Difference]: Without dead ends: 6069 [2023-12-25 09:19:34,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:19:34,687 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 184 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:34,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 399 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:19:34,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6069 states. [2023-12-25 09:19:34,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6069 to 3141. [2023-12-25 09:19:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3140 states have (on average 1.4687898089171973) internal successors, (4612), 3140 states have internal predecessors, (4612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:34,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 4612 transitions. [2023-12-25 09:19:34,749 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 4612 transitions. Word has length 42 [2023-12-25 09:19:34,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:34,750 INFO L495 AbstractCegarLoop]: Abstraction has 3141 states and 4612 transitions. [2023-12-25 09:19:34,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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 09:19:34,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 4612 transitions. [2023-12-25 09:19:34,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-25 09:19:34,752 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:34,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:19:34,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-25 09:19:34,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:34,957 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:34,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:34,958 INFO L85 PathProgramCache]: Analyzing trace with hash -348683587, now seen corresponding path program 1 times [2023-12-25 09:19:34,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:34,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699122783] [2023-12-25 09:19:34,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:34,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:34,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:34,966 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:19:34,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 09:19:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:35,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:19:35,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:19:35,061 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:35,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:35,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699122783] [2023-12-25 09:19:35,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699122783] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:35,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:35,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:19:35,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593328707] [2023-12-25 09:19:35,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:35,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:19:35,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:35,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:19:35,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:35,067 INFO L87 Difference]: Start difference. First operand 3141 states and 4612 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:35,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:35,130 INFO L93 Difference]: Finished difference Result 7603 states and 11170 transitions. [2023-12-25 09:19:35,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:19:35,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2023-12-25 09:19:35,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:35,141 INFO L225 Difference]: With dead ends: 7603 [2023-12-25 09:19:35,141 INFO L226 Difference]: Without dead ends: 4481 [2023-12-25 09:19:35,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:35,144 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 66 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:35,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 234 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:19:35,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4481 states. [2023-12-25 09:19:35,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4481 to 4479. [2023-12-25 09:19:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4479 states, 4478 states have (on average 1.4595801697186244) internal successors, (6536), 4478 states have internal predecessors, (6536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:35,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4479 states to 4479 states and 6536 transitions. [2023-12-25 09:19:35,208 INFO L78 Accepts]: Start accepts. Automaton has 4479 states and 6536 transitions. Word has length 43 [2023-12-25 09:19:35,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:35,208 INFO L495 AbstractCegarLoop]: Abstraction has 4479 states and 6536 transitions. [2023-12-25 09:19:35,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:35,209 INFO L276 IsEmpty]: Start isEmpty. Operand 4479 states and 6536 transitions. [2023-12-25 09:19:35,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 09:19:35,210 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:35,210 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] [2023-12-25 09:19:35,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-25 09:19:35,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:35,413 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:35,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:35,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1611610844, now seen corresponding path program 1 times [2023-12-25 09:19:35,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:35,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533330683] [2023-12-25 09:19:35,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:35,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:35,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:35,415 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:19:35,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 09:19:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:35,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:19:35,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:35,971 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 09:19:35,971 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:19:36,172 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 09:19:36,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:36,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533330683] [2023-12-25 09:19:36,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533330683] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:19:36,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:19:36,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 09:19:36,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736200635] [2023-12-25 09:19:36,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:19:36,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:19:36,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:36,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:19:36,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:19:36,175 INFO L87 Difference]: Start difference. First operand 4479 states and 6536 transitions. Second operand has 16 states, 16 states have (on average 7.0) internal successors, (112), 15 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 09:19:41,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:41,640 INFO L93 Difference]: Finished difference Result 29254 states and 42028 transitions. [2023-12-25 09:19:41,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2023-12-25 09:19:41,641 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.0) internal successors, (112), 15 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 60 [2023-12-25 09:19:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:41,694 INFO L225 Difference]: With dead ends: 29254 [2023-12-25 09:19:41,694 INFO L226 Difference]: Without dead ends: 24796 [2023-12-25 09:19:41,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4688 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2821, Invalid=10061, Unknown=0, NotChecked=0, Total=12882 [2023-12-25 09:19:41,706 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 2545 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 1722 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2545 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:41,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2545 Valid, 1762 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1722 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-25 09:19:41,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24796 states. [2023-12-25 09:19:41,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24796 to 4929. [2023-12-25 09:19:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4929 states, 4928 states have (on average 1.4496753246753247) internal successors, (7144), 4928 states have internal predecessors, (7144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:41,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4929 states to 4929 states and 7144 transitions. [2023-12-25 09:19:41,877 INFO L78 Accepts]: Start accepts. Automaton has 4929 states and 7144 transitions. Word has length 60 [2023-12-25 09:19:41,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:41,878 INFO L495 AbstractCegarLoop]: Abstraction has 4929 states and 7144 transitions. [2023-12-25 09:19:41,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.0) internal successors, (112), 15 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 09:19:41,878 INFO L276 IsEmpty]: Start isEmpty. Operand 4929 states and 7144 transitions. [2023-12-25 09:19:41,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 09:19:41,880 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:41,880 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] [2023-12-25 09:19:41,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 09:19:42,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:42,104 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:42,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:42,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1763306829, now seen corresponding path program 1 times [2023-12-25 09:19:42,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:42,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007251310] [2023-12-25 09:19:42,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:42,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:42,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:42,106 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:19:42,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 09:19:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:42,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:19:42,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:42,309 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 09:19:42,309 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:42,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:42,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007251310] [2023-12-25 09:19:42,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007251310] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:42,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:42,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:19:42,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825790494] [2023-12-25 09:19:42,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:42,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:19:42,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:42,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:19:42,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:19:42,311 INFO L87 Difference]: Start difference. First operand 4929 states and 7144 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:42,500 INFO L93 Difference]: Finished difference Result 14745 states and 21390 transitions. [2023-12-25 09:19:42,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:19:42,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 09:19:42,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:42,514 INFO L225 Difference]: With dead ends: 14745 [2023-12-25 09:19:42,514 INFO L226 Difference]: Without dead ends: 9837 [2023-12-25 09:19:42,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-25 09:19:42,521 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 378 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:42,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 145 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:19:42,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9837 states. [2023-12-25 09:19:42,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9837 to 9835. [2023-12-25 09:19:42,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9835 states, 9834 states have (on average 1.4431563961765304) internal successors, (14192), 9834 states have internal predecessors, (14192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:42,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9835 states to 9835 states and 14192 transitions. [2023-12-25 09:19:42,637 INFO L78 Accepts]: Start accepts. Automaton has 9835 states and 14192 transitions. Word has length 60 [2023-12-25 09:19:42,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:42,637 INFO L495 AbstractCegarLoop]: Abstraction has 9835 states and 14192 transitions. [2023-12-25 09:19:42,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:42,638 INFO L276 IsEmpty]: Start isEmpty. Operand 9835 states and 14192 transitions. [2023-12-25 09:19:42,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 09:19:42,642 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:42,643 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] [2023-12-25 09:19:42,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 09:19:42,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:42,846 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:42,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:42,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1849676584, now seen corresponding path program 1 times [2023-12-25 09:19:42,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:42,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884087982] [2023-12-25 09:19:42,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:42,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:42,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:42,848 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:19:42,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 09:19:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:42,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:19:42,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:43,166 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:19:43,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:19:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:19:43,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:43,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884087982] [2023-12-25 09:19:43,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884087982] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:19:43,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:19:43,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 09:19:43,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302957050] [2023-12-25 09:19:43,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:19:43,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:19:43,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:43,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:19:43,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:19:43,376 INFO L87 Difference]: Start difference. First operand 9835 states and 14192 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 09:19:46,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:46,096 INFO L93 Difference]: Finished difference Result 33805 states and 48090 transitions. [2023-12-25 09:19:46,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-12-25 09:19:46,097 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 09:19:46,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:46,133 INFO L225 Difference]: With dead ends: 33805 [2023-12-25 09:19:46,134 INFO L226 Difference]: Without dead ends: 23991 [2023-12-25 09:19:46,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=977, Invalid=3183, Unknown=0, NotChecked=0, Total=4160 [2023-12-25 09:19:46,149 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 1535 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1535 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:46,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1535 Valid, 1616 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-25 09:19:46,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23991 states. [2023-12-25 09:19:46,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23991 to 9761. [2023-12-25 09:19:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9761 states, 9760 states have (on average 1.4379098360655738) internal successors, (14034), 9760 states have internal predecessors, (14034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:46,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9761 states to 9761 states and 14034 transitions. [2023-12-25 09:19:46,324 INFO L78 Accepts]: Start accepts. Automaton has 9761 states and 14034 transitions. Word has length 60 [2023-12-25 09:19:46,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:46,324 INFO L495 AbstractCegarLoop]: Abstraction has 9761 states and 14034 transitions. [2023-12-25 09:19:46,324 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 09:19:46,324 INFO L276 IsEmpty]: Start isEmpty. Operand 9761 states and 14034 transitions. [2023-12-25 09:19:46,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 09:19:46,326 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:46,326 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] [2023-12-25 09:19:46,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 09:19:46,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:46,530 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:46,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:46,531 INFO L85 PathProgramCache]: Analyzing trace with hash -247028584, now seen corresponding path program 1 times [2023-12-25 09:19:46,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:46,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335925991] [2023-12-25 09:19:46,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:46,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:46,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:46,533 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:19:46,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 09:19:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:46,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:19:46,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:19:47,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:19:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:19:47,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:47,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335925991] [2023-12-25 09:19:47,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335925991] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:19:47,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:19:47,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 09:19:47,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844920510] [2023-12-25 09:19:47,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:19:47,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:19:47,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:47,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:19:47,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:19:47,177 INFO L87 Difference]: Start difference. First operand 9761 states and 14034 transitions. Second operand has 16 states, 16 states have (on average 6.75) internal successors, (108), 15 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:53,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:53,276 INFO L93 Difference]: Finished difference Result 140220 states and 197318 transitions. [2023-12-25 09:19:53,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2023-12-25 09:19:53,276 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 15 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 60 [2023-12-25 09:19:53,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:53,660 INFO L225 Difference]: With dead ends: 140220 [2023-12-25 09:19:53,660 INFO L226 Difference]: Without dead ends: 130480 [2023-12-25 09:19:53,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4645 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2821, Invalid=10061, Unknown=0, NotChecked=0, Total=12882 [2023-12-25 09:19:53,725 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 2404 mSDsluCounter, 2034 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2404 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 2318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:53,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2404 Valid, 2330 Invalid, 2318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2291 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-25 09:19:53,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130480 states. [2023-12-25 09:19:54,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130480 to 20558. [2023-12-25 09:19:54,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20558 states, 20557 states have (on average 1.401809602568468) internal successors, (28817), 20557 states have internal predecessors, (28817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:54,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20558 states to 20558 states and 28817 transitions. [2023-12-25 09:19:54,826 INFO L78 Accepts]: Start accepts. Automaton has 20558 states and 28817 transitions. Word has length 60 [2023-12-25 09:19:54,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:54,827 INFO L495 AbstractCegarLoop]: Abstraction has 20558 states and 28817 transitions. [2023-12-25 09:19:54,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 15 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:54,827 INFO L276 IsEmpty]: Start isEmpty. Operand 20558 states and 28817 transitions. [2023-12-25 09:19:54,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 09:19:54,830 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:54,830 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:19:54,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-25 09:19:55,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:55,033 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:55,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:55,033 INFO L85 PathProgramCache]: Analyzing trace with hash -44135606, now seen corresponding path program 1 times [2023-12-25 09:19:55,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:55,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123032532] [2023-12-25 09:19:55,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:55,034 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:55,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:55,049 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:19:55,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 09:19:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:55,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:19:55,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:55,119 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 09:19:55,120 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:55,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:55,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123032532] [2023-12-25 09:19:55,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123032532] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:55,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:55,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:19:55,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826005081] [2023-12-25 09:19:55,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:55,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:19:55,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:55,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:19:55,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:55,122 INFO L87 Difference]: Start difference. First operand 20558 states and 28817 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:55,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:55,217 INFO L93 Difference]: Finished difference Result 41089 states and 57604 transitions. [2023-12-25 09:19:55,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:19:55,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-25 09:19:55,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:55,245 INFO L225 Difference]: With dead ends: 41089 [2023-12-25 09:19:55,245 INFO L226 Difference]: Without dead ends: 20560 [2023-12-25 09:19:55,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:55,267 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 65 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:55,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 263 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:19:55,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20560 states. [2023-12-25 09:19:55,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20560 to 20390. [2023-12-25 09:19:55,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20390 states, 20389 states have (on average 1.383834420520869) internal successors, (28215), 20389 states have internal predecessors, (28215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20390 states to 20390 states and 28215 transitions. [2023-12-25 09:19:55,561 INFO L78 Accepts]: Start accepts. Automaton has 20390 states and 28215 transitions. Word has length 61 [2023-12-25 09:19:55,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:55,561 INFO L495 AbstractCegarLoop]: Abstraction has 20390 states and 28215 transitions. [2023-12-25 09:19:55,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 20390 states and 28215 transitions. [2023-12-25 09:19:55,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 09:19:55,563 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:55,563 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] [2023-12-25 09:19:55,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-25 09:19:55,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:55,766 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:55,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:55,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1774270321, now seen corresponding path program 1 times [2023-12-25 09:19:55,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:55,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205714193] [2023-12-25 09:19:55,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:55,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:55,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:55,768 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:19:55,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-25 09:19:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:55,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:19:55,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:55,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:19:55,960 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:55,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:55,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205714193] [2023-12-25 09:19:55,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205714193] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:55,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:55,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:19:55,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000639487] [2023-12-25 09:19:55,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:55,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:19:55,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:55,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:19:55,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:55,962 INFO L87 Difference]: Start difference. First operand 20390 states and 28215 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:56,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:56,029 INFO L93 Difference]: Finished difference Result 28853 states and 39613 transitions. [2023-12-25 09:19:56,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:19:56,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-25 09:19:56,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:56,048 INFO L225 Difference]: With dead ends: 28853 [2023-12-25 09:19:56,048 INFO L226 Difference]: Without dead ends: 16959 [2023-12-25 09:19:56,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:56,061 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 67 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:56,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 259 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:19:56,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16959 states. [2023-12-25 09:19:56,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16959 to 15415. [2023-12-25 09:19:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15415 states, 15414 states have (on average 1.359413520176463) internal successors, (20954), 15414 states have internal predecessors, (20954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15415 states to 15415 states and 20954 transitions. [2023-12-25 09:19:56,211 INFO L78 Accepts]: Start accepts. Automaton has 15415 states and 20954 transitions. Word has length 61 [2023-12-25 09:19:56,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:56,211 INFO L495 AbstractCegarLoop]: Abstraction has 15415 states and 20954 transitions. [2023-12-25 09:19:56,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 15415 states and 20954 transitions. [2023-12-25 09:19:56,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 09:19:56,217 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:56,217 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 09:19:56,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-25 09:19:56,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:56,420 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:56,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:56,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1873896420, now seen corresponding path program 1 times [2023-12-25 09:19:56,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:56,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145829199] [2023-12-25 09:19:56,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:56,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:56,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:56,422 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:19:56,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-25 09:19:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:56,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 09:19:56,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:56,580 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 09:19:56,580 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:19:56,648 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 09:19:56,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:56,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145829199] [2023-12-25 09:19:56,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145829199] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:19:56,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:19:56,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-25 09:19:56,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570035278] [2023-12-25 09:19:56,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:19:56,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 09:19:56,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:56,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 09:19:56,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 09:19:56,650 INFO L87 Difference]: Start difference. First operand 15415 states and 20954 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 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 09:19:56,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:56,748 INFO L93 Difference]: Finished difference Result 48363 states and 65983 transitions. [2023-12-25 09:19:56,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:19:56,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 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 61 [2023-12-25 09:19:56,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:56,806 INFO L225 Difference]: With dead ends: 48363 [2023-12-25 09:19:56,806 INFO L226 Difference]: Without dead ends: 36189 [2023-12-25 09:19:56,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 116 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 09:19:56,851 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 342 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:56,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 572 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:19:56,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36189 states. [2023-12-25 09:19:57,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36189 to 36147. [2023-12-25 09:19:57,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36147 states, 36146 states have (on average 1.3413932385326177) internal successors, (48486), 36146 states have internal predecessors, (48486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36147 states to 36147 states and 48486 transitions. [2023-12-25 09:19:57,449 INFO L78 Accepts]: Start accepts. Automaton has 36147 states and 48486 transitions. Word has length 61 [2023-12-25 09:19:57,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:57,449 INFO L495 AbstractCegarLoop]: Abstraction has 36147 states and 48486 transitions. [2023-12-25 09:19:57,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 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 09:19:57,450 INFO L276 IsEmpty]: Start isEmpty. Operand 36147 states and 48486 transitions. [2023-12-25 09:19:57,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 09:19:57,452 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:57,452 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] [2023-12-25 09:19:57,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-25 09:19:57,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:57,655 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:57,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:57,655 INFO L85 PathProgramCache]: Analyzing trace with hash -774824593, now seen corresponding path program 1 times [2023-12-25 09:19:57,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:57,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862481850] [2023-12-25 09:19:57,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:57,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:57,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:57,657 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:19:57,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-25 09:19:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:57,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:19:57,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:19:57,734 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:57,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:57,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862481850] [2023-12-25 09:19:57,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862481850] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:57,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:57,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:19:57,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662272492] [2023-12-25 09:19:57,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:57,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:19:57,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:57,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:19:57,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:57,735 INFO L87 Difference]: Start difference. First operand 36147 states and 48486 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:57,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:57,991 INFO L93 Difference]: Finished difference Result 74815 states and 99880 transitions. [2023-12-25 09:19:57,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:19:57,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-25 09:19:57,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:58,057 INFO L225 Difference]: With dead ends: 74815 [2023-12-25 09:19:58,057 INFO L226 Difference]: Without dead ends: 49178 [2023-12-25 09:19:58,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:58,245 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 62 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:58,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 222 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:19:58,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49178 states. [2023-12-25 09:19:58,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49178 to 49011. [2023-12-25 09:19:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49011 states, 49010 states have (on average 1.322832075086717) internal successors, (64832), 49010 states have internal predecessors, (64832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49011 states to 49011 states and 64832 transitions. [2023-12-25 09:19:58,916 INFO L78 Accepts]: Start accepts. Automaton has 49011 states and 64832 transitions. Word has length 61 [2023-12-25 09:19:58,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:58,916 INFO L495 AbstractCegarLoop]: Abstraction has 49011 states and 64832 transitions. [2023-12-25 09:19:58,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 49011 states and 64832 transitions. [2023-12-25 09:19:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 09:19:58,933 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:58,933 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] [2023-12-25 09:19:58,948 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 09:19:59,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:59,134 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:59,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:59,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1680834964, now seen corresponding path program 1 times [2023-12-25 09:19:59,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:59,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228260728] [2023-12-25 09:19:59,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:59,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:59,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:59,135 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:19:59,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 (18)] Waiting until timeout for monitored process [2023-12-25 09:19:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:59,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:19:59,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:19:59,234 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:59,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:59,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228260728] [2023-12-25 09:19:59,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228260728] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:59,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:59,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:19:59,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188535425] [2023-12-25 09:19:59,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:59,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:19:59,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:59,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:19:59,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:59,235 INFO L87 Difference]: Start difference. First operand 49011 states and 64832 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:59,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:59,391 INFO L93 Difference]: Finished difference Result 81644 states and 107436 transitions. [2023-12-25 09:19:59,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:19:59,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-25 09:19:59,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:59,436 INFO L225 Difference]: With dead ends: 81644 [2023-12-25 09:19:59,437 INFO L226 Difference]: Without dead ends: 40803 [2023-12-25 09:19:59,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:59,465 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 65 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:59,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 263 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:19:59,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40803 states. [2023-12-25 09:19:59,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40803 to 39085. [2023-12-25 09:19:59,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39085 states, 39084 states have (on average 1.2944427387166104) internal successors, (50592), 39084 states have internal predecessors, (50592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39085 states to 39085 states and 50592 transitions. [2023-12-25 09:20:00,039 INFO L78 Accepts]: Start accepts. Automaton has 39085 states and 50592 transitions. Word has length 61 [2023-12-25 09:20:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:00,039 INFO L495 AbstractCegarLoop]: Abstraction has 39085 states and 50592 transitions. [2023-12-25 09:20:00,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 39085 states and 50592 transitions. [2023-12-25 09:20:00,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 09:20:00,057 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:00,057 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 09:20:00,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-12-25 09:20:00,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:00,260 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:00,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:00,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1318326088, now seen corresponding path program 1 times [2023-12-25 09:20:00,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:00,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057078345] [2023-12-25 09:20:00,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:00,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:00,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:00,262 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:00,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-25 09:20:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:00,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 09:20:00,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:00,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:00,415 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:00,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:00,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:00,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057078345] [2023-12-25 09:20:00,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057078345] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:00,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:00,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 09:20:00,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308949449] [2023-12-25 09:20:00,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:00,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:20:00,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:00,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:20:00,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:20:00,456 INFO L87 Difference]: Start difference. First operand 39085 states and 50592 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:00,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:00,988 INFO L93 Difference]: Finished difference Result 108421 states and 139810 transitions. [2023-12-25 09:20:00,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 09:20:00,988 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-12-25 09:20:00,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:01,073 INFO L225 Difference]: With dead ends: 108421 [2023-12-25 09:20:01,073 INFO L226 Difference]: Without dead ends: 69363 [2023-12-25 09:20:01,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-25 09:20:01,111 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 1221 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:01,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 331 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 09:20:01,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69363 states. [2023-12-25 09:20:01,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69363 to 44190. [2023-12-25 09:20:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44190 states, 44189 states have (on average 1.2812690941184457) internal successors, (56618), 44189 states have internal predecessors, (56618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:01,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44190 states to 44190 states and 56618 transitions. [2023-12-25 09:20:01,921 INFO L78 Accepts]: Start accepts. Automaton has 44190 states and 56618 transitions. Word has length 62 [2023-12-25 09:20:01,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:01,921 INFO L495 AbstractCegarLoop]: Abstraction has 44190 states and 56618 transitions. [2023-12-25 09:20:01,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:01,921 INFO L276 IsEmpty]: Start isEmpty. Operand 44190 states and 56618 transitions. [2023-12-25 09:20:01,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 09:20:01,923 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:01,923 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:01,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:02,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:02,126 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:02,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:02,126 INFO L85 PathProgramCache]: Analyzing trace with hash 2068852225, now seen corresponding path program 1 times [2023-12-25 09:20:02,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:02,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424191278] [2023-12-25 09:20:02,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:02,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:02,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:02,128 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:02,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-25 09:20:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:02,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:20:02,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:02,205 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:02,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:02,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424191278] [2023-12-25 09:20:02,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424191278] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:02,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:02,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:20:02,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808285204] [2023-12-25 09:20:02,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:02,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:20:02,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:02,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:20:02,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:02,208 INFO L87 Difference]: Start difference. First operand 44190 states and 56618 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 09:20:02,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:02,343 INFO L93 Difference]: Finished difference Result 60136 states and 76841 transitions. [2023-12-25 09:20:02,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:20:02,343 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 09:20:02,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:02,361 INFO L225 Difference]: With dead ends: 60136 [2023-12-25 09:20:02,361 INFO L226 Difference]: Without dead ends: 16020 [2023-12-25 09:20:02,382 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 09:20:02,383 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 42 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:02,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 203 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16020 states. [2023-12-25 09:20:02,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16020 to 14554. [2023-12-25 09:20:02,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14554 states, 14553 states have (on average 1.2558922558922558) internal successors, (18277), 14553 states have internal predecessors, (18277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:02,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14554 states to 14554 states and 18277 transitions. [2023-12-25 09:20:02,657 INFO L78 Accepts]: Start accepts. Automaton has 14554 states and 18277 transitions. Word has length 62 [2023-12-25 09:20:02,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:02,657 INFO L495 AbstractCegarLoop]: Abstraction has 14554 states and 18277 transitions. [2023-12-25 09:20:02,657 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 09:20:02,657 INFO L276 IsEmpty]: Start isEmpty. Operand 14554 states and 18277 transitions. [2023-12-25 09:20:02,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 09:20:02,658 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:02,659 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 09:20:02,684 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 09:20:02,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:02,861 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:02,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:02,862 INFO L85 PathProgramCache]: Analyzing trace with hash 976647389, now seen corresponding path program 1 times [2023-12-25 09:20:02,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:02,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817813130] [2023-12-25 09:20:02,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:02,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:02,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:02,863 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:02,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-25 09:20:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:02,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 09:20:02,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:03,017 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 09:20:03,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:03,063 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 09:20:03,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:03,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817813130] [2023-12-25 09:20:03,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817813130] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:03,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:03,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 09:20:03,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75197455] [2023-12-25 09:20:03,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:03,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:20:03,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:03,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:20:03,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:20:03,065 INFO L87 Difference]: Start difference. First operand 14554 states and 18277 transitions. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:03,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:03,304 INFO L93 Difference]: Finished difference Result 39141 states and 48970 transitions. [2023-12-25 09:20:03,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 09:20:03,305 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-12-25 09:20:03,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:03,333 INFO L225 Difference]: With dead ends: 39141 [2023-12-25 09:20:03,333 INFO L226 Difference]: Without dead ends: 24643 [2023-12-25 09:20:03,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-25 09:20:03,347 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 427 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:03,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 437 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:20:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24643 states. [2023-12-25 09:20:03,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24643 to 16216. [2023-12-25 09:20:03,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16216 states, 16215 states have (on average 1.2345975948196115) internal successors, (20019), 16215 states have internal predecessors, (20019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16216 states to 16216 states and 20019 transitions. [2023-12-25 09:20:03,692 INFO L78 Accepts]: Start accepts. Automaton has 16216 states and 20019 transitions. Word has length 62 [2023-12-25 09:20:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:03,692 INFO L495 AbstractCegarLoop]: Abstraction has 16216 states and 20019 transitions. [2023-12-25 09:20:03,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 16216 states and 20019 transitions. [2023-12-25 09:20:03,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 09:20:03,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:03,694 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:03,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-12-25 09:20:03,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:03,897 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:03,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:03,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1679878672, now seen corresponding path program 1 times [2023-12-25 09:20:03,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:03,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644951550] [2023-12-25 09:20:03,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:03,897 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:03,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:03,899 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:03,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-25 09:20:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:03,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 09:20:03,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:04,123 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:04,123 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:04,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:04,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644951550] [2023-12-25 09:20:04,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644951550] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:04,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:04,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 09:20:04,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625642493] [2023-12-25 09:20:04,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:04,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:20:04,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:04,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:20:04,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:20:04,165 INFO L87 Difference]: Start difference. First operand 16216 states and 20019 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:04,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:04,316 INFO L93 Difference]: Finished difference Result 35335 states and 43575 transitions. [2023-12-25 09:20:04,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 09:20:04,317 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-12-25 09:20:04,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:04,337 INFO L225 Difference]: With dead ends: 35335 [2023-12-25 09:20:04,337 INFO L226 Difference]: Without dead ends: 19250 [2023-12-25 09:20:04,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-25 09:20:04,350 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 521 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:04,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 193 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:20:04,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19250 states. [2023-12-25 09:20:04,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19250 to 16986. [2023-12-25 09:20:04,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16986 states, 16985 states have (on average 1.2180747718575213) internal successors, (20689), 16985 states have internal predecessors, (20689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:04,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16986 states to 16986 states and 20689 transitions. [2023-12-25 09:20:04,591 INFO L78 Accepts]: Start accepts. Automaton has 16986 states and 20689 transitions. Word has length 62 [2023-12-25 09:20:04,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:04,591 INFO L495 AbstractCegarLoop]: Abstraction has 16986 states and 20689 transitions. [2023-12-25 09:20:04,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:04,591 INFO L276 IsEmpty]: Start isEmpty. Operand 16986 states and 20689 transitions. [2023-12-25 09:20:04,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 09:20:04,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:04,592 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:04,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:04,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:04,795 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:04,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:04,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1836329263, now seen corresponding path program 1 times [2023-12-25 09:20:04,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:04,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817763781] [2023-12-25 09:20:04,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:04,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:04,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:04,797 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:04,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-25 09:20:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:04,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:20:04,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:05,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 09:20:05,016 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:05,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:05,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817763781] [2023-12-25 09:20:05,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817763781] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:05,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:05,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:20:05,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253496428] [2023-12-25 09:20:05,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:05,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:20:05,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:05,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:20:05,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:20:05,018 INFO L87 Difference]: Start difference. First operand 16986 states and 20689 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:05,101 INFO L93 Difference]: Finished difference Result 27335 states and 33511 transitions. [2023-12-25 09:20:05,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:20:05,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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 64 [2023-12-25 09:20:05,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:05,127 INFO L225 Difference]: With dead ends: 27335 [2023-12-25 09:20:05,127 INFO L226 Difference]: Without dead ends: 23242 [2023-12-25 09:20:05,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:20:05,136 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 251 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:05,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 446 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23242 states. [2023-12-25 09:20:05,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23242 to 19001. [2023-12-25 09:20:05,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19001 states, 19000 states have (on average 1.2106842105263158) internal successors, (23003), 19000 states have internal predecessors, (23003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19001 states to 19001 states and 23003 transitions. [2023-12-25 09:20:05,362 INFO L78 Accepts]: Start accepts. Automaton has 19001 states and 23003 transitions. Word has length 64 [2023-12-25 09:20:05,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:05,362 INFO L495 AbstractCegarLoop]: Abstraction has 19001 states and 23003 transitions. [2023-12-25 09:20:05,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:05,362 INFO L276 IsEmpty]: Start isEmpty. Operand 19001 states and 23003 transitions. [2023-12-25 09:20:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 09:20:05,363 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:05,364 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:05,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-12-25 09:20:05,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:05,566 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:05,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:05,566 INFO L85 PathProgramCache]: Analyzing trace with hash -732049210, now seen corresponding path program 1 times [2023-12-25 09:20:05,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:05,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685589385] [2023-12-25 09:20:05,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:05,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:05,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:05,568 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:05,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-25 09:20:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:05,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:20:05,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:05,778 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 09:20:05,778 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:05,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:05,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685589385] [2023-12-25 09:20:05,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1685589385] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:05,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:05,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:20:05,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776028792] [2023-12-25 09:20:05,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:05,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:20:05,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:05,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:20:05,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:20:05,780 INFO L87 Difference]: Start difference. First operand 19001 states and 23003 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:05,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:05,870 INFO L93 Difference]: Finished difference Result 30151 states and 36814 transitions. [2023-12-25 09:20:05,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:20:05,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 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 64 [2023-12-25 09:20:05,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:05,901 INFO L225 Difference]: With dead ends: 30151 [2023-12-25 09:20:05,901 INFO L226 Difference]: Without dead ends: 24821 [2023-12-25 09:20:05,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:20:05,914 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 255 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:05,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 450 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:05,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24821 states. [2023-12-25 09:20:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24821 to 22210. [2023-12-25 09:20:06,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22210 states, 22209 states have (on average 1.204061416542843) internal successors, (26741), 22209 states have internal predecessors, (26741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:06,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22210 states to 22210 states and 26741 transitions. [2023-12-25 09:20:06,179 INFO L78 Accepts]: Start accepts. Automaton has 22210 states and 26741 transitions. Word has length 64 [2023-12-25 09:20:06,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:06,179 INFO L495 AbstractCegarLoop]: Abstraction has 22210 states and 26741 transitions. [2023-12-25 09:20:06,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:06,179 INFO L276 IsEmpty]: Start isEmpty. Operand 22210 states and 26741 transitions. [2023-12-25 09:20:06,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 09:20:06,181 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:06,181 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:06,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:06,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:06,384 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:06,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:06,384 INFO L85 PathProgramCache]: Analyzing trace with hash 654929470, now seen corresponding path program 1 times [2023-12-25 09:20:06,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:06,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345027483] [2023-12-25 09:20:06,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:06,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:06,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:06,386 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:06,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-25 09:20:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:06,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:20:06,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:06,459 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:06,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:06,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345027483] [2023-12-25 09:20:06,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345027483] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:06,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:06,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:20:06,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416666526] [2023-12-25 09:20:06,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:06,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:20:06,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:06,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:20:06,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:06,461 INFO L87 Difference]: Start difference. First operand 22210 states and 26741 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:06,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:06,523 INFO L93 Difference]: Finished difference Result 31950 states and 38537 transitions. [2023-12-25 09:20:06,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:20:06,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2023-12-25 09:20:06,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:06,536 INFO L225 Difference]: With dead ends: 31950 [2023-12-25 09:20:06,536 INFO L226 Difference]: Without dead ends: 12139 [2023-12-25 09:20:06,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:06,550 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 27 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:06,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 182 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:06,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12139 states. [2023-12-25 09:20:06,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12139 to 11531. [2023-12-25 09:20:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11531 states, 11530 states have (on average 1.1755420641803989) internal successors, (13554), 11530 states have internal predecessors, (13554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11531 states to 11531 states and 13554 transitions. [2023-12-25 09:20:06,640 INFO L78 Accepts]: Start accepts. Automaton has 11531 states and 13554 transitions. Word has length 64 [2023-12-25 09:20:06,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:06,642 INFO L495 AbstractCegarLoop]: Abstraction has 11531 states and 13554 transitions. [2023-12-25 09:20:06,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 11531 states and 13554 transitions. [2023-12-25 09:20:06,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 09:20:06,643 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:06,643 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:06,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:06,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:06,846 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:06,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:06,846 INFO L85 PathProgramCache]: Analyzing trace with hash 470464413, now seen corresponding path program 1 times [2023-12-25 09:20:06,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:06,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561067923] [2023-12-25 09:20:06,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:06,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:06,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:06,861 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:06,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-25 09:20:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:06,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:20:06,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 09:20:07,137 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:07,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:07,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561067923] [2023-12-25 09:20:07,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561067923] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:07,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:07,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:20:07,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662473977] [2023-12-25 09:20:07,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:07,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:20:07,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:07,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:20:07,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:20:07,140 INFO L87 Difference]: Start difference. First operand 11531 states and 13554 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:07,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:07,205 INFO L93 Difference]: Finished difference Result 18752 states and 22312 transitions. [2023-12-25 09:20:07,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:20:07,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2023-12-25 09:20:07,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:07,218 INFO L225 Difference]: With dead ends: 18752 [2023-12-25 09:20:07,218 INFO L226 Difference]: Without dead ends: 14072 [2023-12-25 09:20:07,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:20:07,226 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 256 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:07,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 449 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:07,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14072 states. [2023-12-25 09:20:07,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14072 to 12019. [2023-12-25 09:20:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12019 states, 12018 states have (on average 1.163754368447329) internal successors, (13986), 12018 states have internal predecessors, (13986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12019 states to 12019 states and 13986 transitions. [2023-12-25 09:20:07,353 INFO L78 Accepts]: Start accepts. Automaton has 12019 states and 13986 transitions. Word has length 64 [2023-12-25 09:20:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:07,354 INFO L495 AbstractCegarLoop]: Abstraction has 12019 states and 13986 transitions. [2023-12-25 09:20:07,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 12019 states and 13986 transitions. [2023-12-25 09:20:07,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-25 09:20:07,355 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:07,355 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:07,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:07,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:07,558 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:07,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:07,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1172816724, now seen corresponding path program 1 times [2023-12-25 09:20:07,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:07,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254120563] [2023-12-25 09:20:07,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:07,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:07,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:07,560 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:07,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-25 09:20:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:07,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:20:07,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:07,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:07,658 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:07,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:07,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254120563] [2023-12-25 09:20:07,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254120563] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:07,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:07,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:20:07,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733326995] [2023-12-25 09:20:07,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:07,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:20:07,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:07,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:20:07,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:07,659 INFO L87 Difference]: Start difference. First operand 12019 states and 13986 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:07,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:07,690 INFO L93 Difference]: Finished difference Result 16073 states and 18683 transitions. [2023-12-25 09:20:07,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:20:07,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2023-12-25 09:20:07,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:07,711 INFO L225 Difference]: With dead ends: 16073 [2023-12-25 09:20:07,711 INFO L226 Difference]: Without dead ends: 11241 [2023-12-25 09:20:07,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:07,716 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 51 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:07,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 234 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:07,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11241 states. [2023-12-25 09:20:07,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11241 to 11239. [2023-12-25 09:20:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11239 states, 11238 states have (on average 1.1565225129026517) internal successors, (12997), 11238 states have internal predecessors, (12997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:07,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11239 states to 11239 states and 12997 transitions. [2023-12-25 09:20:07,816 INFO L78 Accepts]: Start accepts. Automaton has 11239 states and 12997 transitions. Word has length 69 [2023-12-25 09:20:07,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:07,816 INFO L495 AbstractCegarLoop]: Abstraction has 11239 states and 12997 transitions. [2023-12-25 09:20:07,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:07,816 INFO L276 IsEmpty]: Start isEmpty. Operand 11239 states and 12997 transitions. [2023-12-25 09:20:07,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-25 09:20:07,818 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:07,818 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:07,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:08,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:08,021 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:08,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:08,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1998809573, now seen corresponding path program 1 times [2023-12-25 09:20:08,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:08,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845649260] [2023-12-25 09:20:08,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:08,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:08,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:08,023 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:08,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-25 09:20:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:08,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:20:08,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:08,107 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:08,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:08,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845649260] [2023-12-25 09:20:08,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1845649260] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:08,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:08,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:20:08,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560045197] [2023-12-25 09:20:08,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:08,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:20:08,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:08,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:20:08,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:08,109 INFO L87 Difference]: Start difference. First operand 11239 states and 12997 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:08,152 INFO L93 Difference]: Finished difference Result 13124 states and 15100 transitions. [2023-12-25 09:20:08,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:20:08,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2023-12-25 09:20:08,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:08,160 INFO L225 Difference]: With dead ends: 13124 [2023-12-25 09:20:08,160 INFO L226 Difference]: Without dead ends: 8983 [2023-12-25 09:20:08,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:08,164 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 52 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:08,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 255 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:08,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8983 states. [2023-12-25 09:20:08,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8983 to 8981. [2023-12-25 09:20:08,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8981 states, 8980 states have (on average 1.1430957683741647) internal successors, (10265), 8980 states have internal predecessors, (10265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8981 states to 8981 states and 10265 transitions. [2023-12-25 09:20:08,242 INFO L78 Accepts]: Start accepts. Automaton has 8981 states and 10265 transitions. Word has length 69 [2023-12-25 09:20:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:08,242 INFO L495 AbstractCegarLoop]: Abstraction has 8981 states and 10265 transitions. [2023-12-25 09:20:08,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 8981 states and 10265 transitions. [2023-12-25 09:20:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-25 09:20:08,243 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:08,243 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:08,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:08,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:08,446 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:08,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:08,446 INFO L85 PathProgramCache]: Analyzing trace with hash -97707833, now seen corresponding path program 1 times [2023-12-25 09:20:08,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:08,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304115015] [2023-12-25 09:20:08,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:08,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:08,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:08,450 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:08,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-25 09:20:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:08,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:20:08,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:08,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 09:20:08,532 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:08,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:08,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304115015] [2023-12-25 09:20:08,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304115015] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:08,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:08,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:20:08,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538932280] [2023-12-25 09:20:08,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:08,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:20:08,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:08,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:20:08,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:08,533 INFO L87 Difference]: Start difference. First operand 8981 states and 10265 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:08,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:08,595 INFO L93 Difference]: Finished difference Result 12309 states and 14028 transitions. [2023-12-25 09:20:08,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:20:08,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 70 [2023-12-25 09:20:08,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:08,601 INFO L225 Difference]: With dead ends: 12309 [2023-12-25 09:20:08,601 INFO L226 Difference]: Without dead ends: 10264 [2023-12-25 09:20:08,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:08,602 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 74 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:08,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 182 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:08,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10264 states. [2023-12-25 09:20:08,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10264 to 8650. [2023-12-25 09:20:08,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8650 states, 8649 states have (on average 1.1438316568389408) internal successors, (9893), 8649 states have internal predecessors, (9893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:08,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8650 states to 8650 states and 9893 transitions. [2023-12-25 09:20:08,652 INFO L78 Accepts]: Start accepts. Automaton has 8650 states and 9893 transitions. Word has length 70 [2023-12-25 09:20:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:08,653 INFO L495 AbstractCegarLoop]: Abstraction has 8650 states and 9893 transitions. [2023-12-25 09:20:08,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:08,653 INFO L276 IsEmpty]: Start isEmpty. Operand 8650 states and 9893 transitions. [2023-12-25 09:20:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-25 09:20:08,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:08,654 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:08,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:08,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:08,857 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:08,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:08,857 INFO L85 PathProgramCache]: Analyzing trace with hash 30985211, now seen corresponding path program 1 times [2023-12-25 09:20:08,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:08,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377863373] [2023-12-25 09:20:08,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:08,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:08,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:08,859 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:08,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-25 09:20:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:08,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 09:20:08,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:10,215 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 09:20:10,216 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:10,910 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 09:20:10,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:10,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377863373] [2023-12-25 09:20:10,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377863373] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:10,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:10,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2023-12-25 09:20:10,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750779718] [2023-12-25 09:20:10,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:10,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-25 09:20:10,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:10,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-25 09:20:10,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=985, Unknown=0, NotChecked=0, Total=1190 [2023-12-25 09:20:10,913 INFO L87 Difference]: Start difference. First operand 8650 states and 9893 transitions. Second operand has 35 states, 35 states have (on average 3.742857142857143) internal successors, (131), 35 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:23,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:23,121 INFO L93 Difference]: Finished difference Result 22333 states and 25541 transitions. [2023-12-25 09:20:23,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2023-12-25 09:20:23,121 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.742857142857143) internal successors, (131), 35 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2023-12-25 09:20:23,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:23,136 INFO L225 Difference]: With dead ends: 22333 [2023-12-25 09:20:23,136 INFO L226 Difference]: Without dead ends: 15217 [2023-12-25 09:20:23,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11229 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=4617, Invalid=23775, Unknown=0, NotChecked=0, Total=28392 [2023-12-25 09:20:23,158 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 4255 mSDsluCounter, 4607 mSDsCounter, 0 mSdLazyCounter, 3005 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4255 SdHoareTripleChecker+Valid, 4923 SdHoareTripleChecker+Invalid, 3129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 3005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:23,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4255 Valid, 4923 Invalid, 3129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 3005 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-12-25 09:20:23,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15217 states. [2023-12-25 09:20:23,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15217 to 7654. [2023-12-25 09:20:23,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7654 states, 7653 states have (on average 1.1432118123611656) internal successors, (8749), 7653 states have internal predecessors, (8749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7654 states to 7654 states and 8749 transitions. [2023-12-25 09:20:23,266 INFO L78 Accepts]: Start accepts. Automaton has 7654 states and 8749 transitions. Word has length 70 [2023-12-25 09:20:23,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:23,266 INFO L495 AbstractCegarLoop]: Abstraction has 7654 states and 8749 transitions. [2023-12-25 09:20:23,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.742857142857143) internal successors, (131), 35 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 7654 states and 8749 transitions. [2023-12-25 09:20:23,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-25 09:20:23,270 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:23,270 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:23,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:23,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:23,473 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:23,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:23,473 INFO L85 PathProgramCache]: Analyzing trace with hash 474770853, now seen corresponding path program 1 times [2023-12-25 09:20:23,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:23,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396687614] [2023-12-25 09:20:23,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:23,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:23,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:23,475 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:23,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-25 09:20:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:23,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:20:23,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:24,090 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 60 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 09:20:24,091 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 60 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 09:20:24,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:24,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396687614] [2023-12-25 09:20:24,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396687614] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:24,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:24,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-25 09:20:24,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569723823] [2023-12-25 09:20:24,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:24,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 09:20:24,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:24,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 09:20:24,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-12-25 09:20:24,283 INFO L87 Difference]: Start difference. First operand 7654 states and 8749 transitions. Second operand has 18 states, 18 states have (on average 9.944444444444445) internal successors, (179), 17 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:25,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:25,634 INFO L93 Difference]: Finished difference Result 12735 states and 14567 transitions. [2023-12-25 09:20:25,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-25 09:20:25,634 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 9.944444444444445) internal successors, (179), 17 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2023-12-25 09:20:25,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:25,640 INFO L225 Difference]: With dead ends: 12735 [2023-12-25 09:20:25,640 INFO L226 Difference]: Without dead ends: 6343 [2023-12-25 09:20:25,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=456, Invalid=1436, Unknown=0, NotChecked=0, Total=1892 [2023-12-25 09:20:25,645 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 1133 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:25,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1133 Valid, 1284 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 09:20:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6343 states. [2023-12-25 09:20:25,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6343 to 4156. [2023-12-25 09:20:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4156 states, 4155 states have (on average 1.1208182912154032) internal successors, (4657), 4155 states have internal predecessors, (4657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4156 states to 4156 states and 4657 transitions. [2023-12-25 09:20:25,693 INFO L78 Accepts]: Start accepts. Automaton has 4156 states and 4657 transitions. Word has length 114 [2023-12-25 09:20:25,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:25,694 INFO L495 AbstractCegarLoop]: Abstraction has 4156 states and 4657 transitions. [2023-12-25 09:20:25,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.944444444444445) internal successors, (179), 17 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 4156 states and 4657 transitions. [2023-12-25 09:20:25,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-25 09:20:25,696 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:25,696 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:25,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:25,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:25,900 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:25,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:25,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2073769782, now seen corresponding path program 1 times [2023-12-25 09:20:25,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:25,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992932712] [2023-12-25 09:20:25,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:25,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:25,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:25,902 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:25,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-12-25 09:20:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:25,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:20:25,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:26,838 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 27 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:26,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:27,194 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 40 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:27,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:27,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992932712] [2023-12-25 09:20:27,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992932712] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:27,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:27,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2023-12-25 09:20:27,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214936390] [2023-12-25 09:20:27,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:27,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 09:20:27,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:27,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 09:20:27,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2023-12-25 09:20:27,196 INFO L87 Difference]: Start difference. First operand 4156 states and 4657 transitions. Second operand has 23 states, 23 states have (on average 9.347826086956522) internal successors, (215), 23 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:29,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:29,407 INFO L93 Difference]: Finished difference Result 10617 states and 11784 transitions. [2023-12-25 09:20:29,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-25 09:20:29,407 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.347826086956522) internal successors, (215), 23 states have internal predecessors, (215), 0 states have call successors, (0), 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 114 [2023-12-25 09:20:29,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:29,415 INFO L225 Difference]: With dead ends: 10617 [2023-12-25 09:20:29,415 INFO L226 Difference]: Without dead ends: 9557 [2023-12-25 09:20:29,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=780, Invalid=3126, Unknown=0, NotChecked=0, Total=3906 [2023-12-25 09:20:29,418 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 1439 mSDsluCounter, 3057 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1439 SdHoareTripleChecker+Valid, 3263 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:29,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1439 Valid, 3263 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 09:20:29,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9557 states. [2023-12-25 09:20:29,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9557 to 6048. [2023-12-25 09:20:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6048 states, 6047 states have (on average 1.1132793120555649) internal successors, (6732), 6047 states have internal predecessors, (6732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:29,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6048 states to 6048 states and 6732 transitions. [2023-12-25 09:20:29,480 INFO L78 Accepts]: Start accepts. Automaton has 6048 states and 6732 transitions. Word has length 114 [2023-12-25 09:20:29,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:29,480 INFO L495 AbstractCegarLoop]: Abstraction has 6048 states and 6732 transitions. [2023-12-25 09:20:29,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.347826086956522) internal successors, (215), 23 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:29,480 INFO L276 IsEmpty]: Start isEmpty. Operand 6048 states and 6732 transitions. [2023-12-25 09:20:29,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-25 09:20:29,482 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:29,482 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:29,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:29,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:29,686 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:29,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:29,687 INFO L85 PathProgramCache]: Analyzing trace with hash -919171148, now seen corresponding path program 2 times [2023-12-25 09:20:29,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:29,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811598549] [2023-12-25 09:20:29,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 09:20:29,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:29,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:29,688 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:29,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-12-25 09:20:29,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 09:20:29,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 09:20:29,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:20:29,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 27 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:30,678 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 40 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:30,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:30,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811598549] [2023-12-25 09:20:30,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811598549] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:30,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:30,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2023-12-25 09:20:30,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513305912] [2023-12-25 09:20:30,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:30,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 09:20:30,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:30,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 09:20:30,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2023-12-25 09:20:30,980 INFO L87 Difference]: Start difference. First operand 6048 states and 6732 transitions. Second operand has 23 states, 23 states have (on average 9.347826086956522) internal successors, (215), 23 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:33,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:33,245 INFO L93 Difference]: Finished difference Result 12932 states and 14316 transitions. [2023-12-25 09:20:33,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-25 09:20:33,246 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.347826086956522) internal successors, (215), 23 states have internal predecessors, (215), 0 states have call successors, (0), 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 114 [2023-12-25 09:20:33,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:33,254 INFO L225 Difference]: With dead ends: 12932 [2023-12-25 09:20:33,254 INFO L226 Difference]: Without dead ends: 10167 [2023-12-25 09:20:33,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=737, Invalid=2923, Unknown=0, NotChecked=0, Total=3660 [2023-12-25 09:20:33,258 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 1350 mSDsluCounter, 3292 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 3494 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:33,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 3494 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 09:20:33,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10167 states. [2023-12-25 09:20:33,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10167 to 6962. [2023-12-25 09:20:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6962 states, 6961 states have (on average 1.1071685102715128) internal successors, (7707), 6961 states have internal predecessors, (7707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:33,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6962 states to 6962 states and 7707 transitions. [2023-12-25 09:20:33,315 INFO L78 Accepts]: Start accepts. Automaton has 6962 states and 7707 transitions. Word has length 114 [2023-12-25 09:20:33,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:33,315 INFO L495 AbstractCegarLoop]: Abstraction has 6962 states and 7707 transitions. [2023-12-25 09:20:33,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.347826086956522) internal successors, (215), 23 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:33,315 INFO L276 IsEmpty]: Start isEmpty. Operand 6962 states and 7707 transitions. [2023-12-25 09:20:33,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-25 09:20:33,317 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:33,317 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:33,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:33,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:33,520 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:33,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:33,521 INFO L85 PathProgramCache]: Analyzing trace with hash -199893434, now seen corresponding path program 1 times [2023-12-25 09:20:33,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:33,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69588244] [2023-12-25 09:20:33,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:33,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:33,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:33,522 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:33,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-12-25 09:20:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:33,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:20:33,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 46 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 09:20:34,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 46 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 09:20:34,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:34,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69588244] [2023-12-25 09:20:34,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69588244] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:34,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:34,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-25 09:20:34,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520226156] [2023-12-25 09:20:34,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:34,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 09:20:34,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:34,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 09:20:34,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-12-25 09:20:34,300 INFO L87 Difference]: Start difference. First operand 6962 states and 7707 transitions. Second operand has 18 states, 18 states have (on average 10.777777777777779) internal successors, (194), 17 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:35,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:35,807 INFO L93 Difference]: Finished difference Result 11476 states and 12739 transitions. [2023-12-25 09:20:35,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-25 09:20:35,807 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 10.777777777777779) internal successors, (194), 17 states have internal predecessors, (194), 0 states have call successors, (0), 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 114 [2023-12-25 09:20:35,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:35,816 INFO L225 Difference]: With dead ends: 11476 [2023-12-25 09:20:35,816 INFO L226 Difference]: Without dead ends: 10466 [2023-12-25 09:20:35,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=487, Invalid=1405, Unknown=0, NotChecked=0, Total=1892 [2023-12-25 09:20:35,821 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 1119 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:35,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 1167 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 09:20:35,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10466 states. [2023-12-25 09:20:35,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10466 to 6816. [2023-12-25 09:20:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6816 states, 6815 states have (on average 1.1038884812912693) internal successors, (7523), 6815 states have internal predecessors, (7523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:35,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6816 states to 6816 states and 7523 transitions. [2023-12-25 09:20:35,888 INFO L78 Accepts]: Start accepts. Automaton has 6816 states and 7523 transitions. Word has length 114 [2023-12-25 09:20:35,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:35,888 INFO L495 AbstractCegarLoop]: Abstraction has 6816 states and 7523 transitions. [2023-12-25 09:20:35,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.777777777777779) internal successors, (194), 17 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:35,889 INFO L276 IsEmpty]: Start isEmpty. Operand 6816 states and 7523 transitions. [2023-12-25 09:20:35,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-25 09:20:35,891 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:35,892 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:35,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:36,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:36,095 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:36,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:36,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1521437441, now seen corresponding path program 1 times [2023-12-25 09:20:36,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:36,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406492450] [2023-12-25 09:20:36,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:36,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:36,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:36,097 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:36,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-12-25 09:20:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:36,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:20:36,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:36,856 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 29 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:36,856 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:37,133 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 40 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:37,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:37,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406492450] [2023-12-25 09:20:37,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406492450] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:37,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:37,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2023-12-25 09:20:37,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874500124] [2023-12-25 09:20:37,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:37,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 09:20:37,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:37,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 09:20:37,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2023-12-25 09:20:37,135 INFO L87 Difference]: Start difference. First operand 6816 states and 7523 transitions. Second operand has 23 states, 23 states have (on average 9.304347826086957) internal successors, (214), 23 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:40,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:40,861 INFO L93 Difference]: Finished difference Result 23484 states and 26199 transitions. [2023-12-25 09:20:40,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2023-12-25 09:20:40,861 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.304347826086957) internal successors, (214), 23 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2023-12-25 09:20:40,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:40,881 INFO L225 Difference]: With dead ends: 23484 [2023-12-25 09:20:40,881 INFO L226 Difference]: Without dead ends: 22351 [2023-12-25 09:20:40,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3085 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1669, Invalid=8431, Unknown=0, NotChecked=0, Total=10100 [2023-12-25 09:20:40,889 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 1751 mSDsluCounter, 3989 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1751 SdHoareTripleChecker+Valid, 4209 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:40,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1751 Valid, 4209 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 09:20:40,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22351 states. [2023-12-25 09:20:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22351 to 12410. [2023-12-25 09:20:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12410 states, 12409 states have (on average 1.1100813925376742) internal successors, (13775), 12409 states have internal predecessors, (13775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:41,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12410 states to 12410 states and 13775 transitions. [2023-12-25 09:20:41,059 INFO L78 Accepts]: Start accepts. Automaton has 12410 states and 13775 transitions. Word has length 114 [2023-12-25 09:20:41,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:41,060 INFO L495 AbstractCegarLoop]: Abstraction has 12410 states and 13775 transitions. [2023-12-25 09:20:41,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.304347826086957) internal successors, (214), 23 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:41,060 INFO L276 IsEmpty]: Start isEmpty. Operand 12410 states and 13775 transitions. [2023-12-25 09:20:41,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-25 09:20:41,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:41,063 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:41,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:41,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:41,266 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:41,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:41,266 INFO L85 PathProgramCache]: Analyzing trace with hash 528741611, now seen corresponding path program 2 times [2023-12-25 09:20:41,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:41,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626351363] [2023-12-25 09:20:41,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 09:20:41,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:41,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:41,268 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:41,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-12-25 09:20:41,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 09:20:41,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 09:20:41,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 09:20:41,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 31 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:41,700 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 40 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:41,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:41,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626351363] [2023-12-25 09:20:41,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626351363] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:41,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:41,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2023-12-25 09:20:41,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056329635] [2023-12-25 09:20:41,949 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:41,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 09:20:41,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:41,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 09:20:41,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2023-12-25 09:20:41,950 INFO L87 Difference]: Start difference. First operand 12410 states and 13775 transitions. Second operand has 21 states, 21 states have (on average 10.0) internal successors, (210), 21 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:42,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:42,932 INFO L93 Difference]: Finished difference Result 22251 states and 24862 transitions. [2023-12-25 09:20:42,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-25 09:20:42,932 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.0) internal successors, (210), 21 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2023-12-25 09:20:42,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:42,950 INFO L225 Difference]: With dead ends: 22251 [2023-12-25 09:20:42,950 INFO L226 Difference]: Without dead ends: 17224 [2023-12-25 09:20:42,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=454, Invalid=1996, Unknown=0, NotChecked=0, Total=2450 [2023-12-25 09:20:42,958 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 971 mSDsluCounter, 3060 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 3371 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:42,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 3371 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 09:20:42,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17224 states. [2023-12-25 09:20:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17224 to 14368. [2023-12-25 09:20:43,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14368 states, 14367 states have (on average 1.1080949397925801) internal successors, (15920), 14367 states have internal predecessors, (15920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:43,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14368 states to 14368 states and 15920 transitions. [2023-12-25 09:20:43,097 INFO L78 Accepts]: Start accepts. Automaton has 14368 states and 15920 transitions. Word has length 114 [2023-12-25 09:20:43,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:43,098 INFO L495 AbstractCegarLoop]: Abstraction has 14368 states and 15920 transitions. [2023-12-25 09:20:43,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.0) internal successors, (210), 21 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:43,098 INFO L276 IsEmpty]: Start isEmpty. Operand 14368 states and 15920 transitions. [2023-12-25 09:20:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-25 09:20:43,101 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:43,101 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:43,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:43,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:43,304 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:43,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:43,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1183025586, now seen corresponding path program 1 times [2023-12-25 09:20:43,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:43,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436128572] [2023-12-25 09:20:43,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:43,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:43,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:43,306 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:43,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-12-25 09:20:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:43,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:20:43,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 53 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 09:20:44,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 62 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 09:20:44,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:44,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436128572] [2023-12-25 09:20:44,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436128572] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:44,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:44,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2023-12-25 09:20:44,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349079295] [2023-12-25 09:20:44,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:44,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 09:20:44,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:44,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 09:20:44,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-12-25 09:20:44,293 INFO L87 Difference]: Start difference. First operand 14368 states and 15920 transitions. Second operand has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:45,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:45,709 INFO L93 Difference]: Finished difference Result 25066 states and 27729 transitions. [2023-12-25 09:20:45,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-25 09:20:45,709 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 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 114 [2023-12-25 09:20:45,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:45,725 INFO L225 Difference]: With dead ends: 25066 [2023-12-25 09:20:45,725 INFO L226 Difference]: Without dead ends: 19662 [2023-12-25 09:20:45,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=455, Invalid=1897, Unknown=0, NotChecked=0, Total=2352 [2023-12-25 09:20:45,732 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 1120 mSDsluCounter, 2872 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 3089 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:45,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 3089 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 09:20:45,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2023-12-25 09:20:45,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 15999. [2023-12-25 09:20:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15999 states, 15998 states have (on average 1.1055756969621202) internal successors, (17687), 15998 states have internal predecessors, (17687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15999 states to 15999 states and 17687 transitions. [2023-12-25 09:20:45,864 INFO L78 Accepts]: Start accepts. Automaton has 15999 states and 17687 transitions. Word has length 114 [2023-12-25 09:20:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:45,864 INFO L495 AbstractCegarLoop]: Abstraction has 15999 states and 17687 transitions. [2023-12-25 09:20:45,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 15999 states and 17687 transitions. [2023-12-25 09:20:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-25 09:20:45,867 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:45,867 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:45,870 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 (37)] Ended with exit code 0 [2023-12-25 09:20:46,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:46,070 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:46,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:46,070 INFO L85 PathProgramCache]: Analyzing trace with hash 955676176, now seen corresponding path program 2 times [2023-12-25 09:20:46,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:46,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610586918] [2023-12-25 09:20:46,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 09:20:46,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:46,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:46,072 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:46,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-12-25 09:20:46,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 09:20:46,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 09:20:46,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:20:46,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:46,651 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 53 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 09:20:46,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:46,818 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 62 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 09:20:46,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:46,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610586918] [2023-12-25 09:20:46,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610586918] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:46,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:46,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2023-12-25 09:20:46,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349787408] [2023-12-25 09:20:46,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:46,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 09:20:46,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:46,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 09:20:46,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-12-25 09:20:46,821 INFO L87 Difference]: Start difference. First operand 15999 states and 17687 transitions. Second operand has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:48,067 INFO L93 Difference]: Finished difference Result 26339 states and 29065 transitions. [2023-12-25 09:20:48,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-25 09:20:48,067 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 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 114 [2023-12-25 09:20:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:48,085 INFO L225 Difference]: With dead ends: 26339 [2023-12-25 09:20:48,085 INFO L226 Difference]: Without dead ends: 19372 [2023-12-25 09:20:48,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=454, Invalid=1898, Unknown=0, NotChecked=0, Total=2352 [2023-12-25 09:20:48,093 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 1230 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 2912 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:48,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 2912 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 09:20:48,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19372 states. [2023-12-25 09:20:48,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19372 to 16886. [2023-12-25 09:20:48,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16886 states, 16885 states have (on average 1.1009771986970684) internal successors, (18590), 16885 states have internal predecessors, (18590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16886 states to 16886 states and 18590 transitions. [2023-12-25 09:20:48,235 INFO L78 Accepts]: Start accepts. Automaton has 16886 states and 18590 transitions. Word has length 114 [2023-12-25 09:20:48,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:48,236 INFO L495 AbstractCegarLoop]: Abstraction has 16886 states and 18590 transitions. [2023-12-25 09:20:48,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:48,237 INFO L276 IsEmpty]: Start isEmpty. Operand 16886 states and 18590 transitions. [2023-12-25 09:20:48,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-25 09:20:48,239 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:48,246 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:48,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:48,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:48,449 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:48,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:48,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1748757209, now seen corresponding path program 1 times [2023-12-25 09:20:48,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:48,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563754587] [2023-12-25 09:20:48,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:48,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:48,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:48,451 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:48,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-12-25 09:20:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:48,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:20:48,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:48,937 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-25 09:20:48,937 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-25 09:20:49,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:49,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563754587] [2023-12-25 09:20:49,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563754587] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:49,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:49,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2023-12-25 09:20:49,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583044164] [2023-12-25 09:20:49,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:49,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 09:20:49,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:49,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 09:20:49,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-12-25 09:20:49,108 INFO L87 Difference]: Start difference. First operand 16886 states and 18590 transitions. Second operand has 17 states, 17 states have (on average 9.117647058823529) internal successors, (155), 17 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:49,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:49,791 INFO L93 Difference]: Finished difference Result 25648 states and 28189 transitions. [2023-12-25 09:20:49,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 09:20:49,791 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.117647058823529) internal successors, (155), 17 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2023-12-25 09:20:49,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:49,814 INFO L225 Difference]: With dead ends: 25648 [2023-12-25 09:20:49,814 INFO L226 Difference]: Without dead ends: 24032 [2023-12-25 09:20:49,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=622, Unknown=0, NotChecked=0, Total=812 [2023-12-25 09:20:49,821 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 1016 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:49,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 1237 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:20:49,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24032 states. [2023-12-25 09:20:49,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24032 to 16759. [2023-12-25 09:20:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16759 states, 16758 states have (on average 1.1011457214464733) internal successors, (18453), 16758 states have internal predecessors, (18453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16759 states to 16759 states and 18453 transitions. [2023-12-25 09:20:49,987 INFO L78 Accepts]: Start accepts. Automaton has 16759 states and 18453 transitions. Word has length 115 [2023-12-25 09:20:49,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:49,988 INFO L495 AbstractCegarLoop]: Abstraction has 16759 states and 18453 transitions. [2023-12-25 09:20:49,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.117647058823529) internal successors, (155), 17 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:49,988 INFO L276 IsEmpty]: Start isEmpty. Operand 16759 states and 18453 transitions. [2023-12-25 09:20:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-25 09:20:49,990 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:49,991 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:49,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:50,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:50,193 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:50,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:50,193 INFO L85 PathProgramCache]: Analyzing trace with hash 260744624, now seen corresponding path program 1 times [2023-12-25 09:20:50,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:50,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773058597] [2023-12-25 09:20:50,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:50,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:50,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:50,195 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:50,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-12-25 09:20:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:50,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:20:50,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:50,759 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 55 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-25 09:20:50,759 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:50,909 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 55 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-25 09:20:50,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:50,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773058597] [2023-12-25 09:20:50,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773058597] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:50,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:50,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2023-12-25 09:20:50,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729409725] [2023-12-25 09:20:50,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:50,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 09:20:50,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:50,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 09:20:50,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-12-25 09:20:50,911 INFO L87 Difference]: Start difference. First operand 16759 states and 18453 transitions. Second operand has 17 states, 17 states have (on average 8.764705882352942) internal successors, (149), 17 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:51,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:51,511 INFO L93 Difference]: Finished difference Result 24649 states and 27275 transitions. [2023-12-25 09:20:51,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 09:20:51,512 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.764705882352942) internal successors, (149), 17 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2023-12-25 09:20:51,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:51,528 INFO L225 Difference]: With dead ends: 24649 [2023-12-25 09:20:51,529 INFO L226 Difference]: Without dead ends: 18984 [2023-12-25 09:20:51,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=622, Unknown=0, NotChecked=0, Total=812 [2023-12-25 09:20:51,536 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 848 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:51,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1240 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:20:51,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18984 states. [2023-12-25 09:20:51,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18984 to 16343. [2023-12-25 09:20:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16343 states, 16342 states have (on average 1.1015787541304614) internal successors, (18002), 16342 states have internal predecessors, (18002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16343 states to 16343 states and 18002 transitions. [2023-12-25 09:20:51,705 INFO L78 Accepts]: Start accepts. Automaton has 16343 states and 18002 transitions. Word has length 115 [2023-12-25 09:20:51,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:51,705 INFO L495 AbstractCegarLoop]: Abstraction has 16343 states and 18002 transitions. [2023-12-25 09:20:51,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.764705882352942) internal successors, (149), 17 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:51,705 INFO L276 IsEmpty]: Start isEmpty. Operand 16343 states and 18002 transitions. [2023-12-25 09:20:51,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-25 09:20:51,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:51,707 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:51,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Ended with exit code 0 [2023-12-25 09:20:51,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:51,910 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:51,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:51,911 INFO L85 PathProgramCache]: Analyzing trace with hash 253182607, now seen corresponding path program 1 times [2023-12-25 09:20:51,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:51,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329228781] [2023-12-25 09:20:51,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:51,911 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:51,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:51,912 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:51,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2023-12-25 09:20:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:51,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:20:51,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-25 09:20:52,398 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-25 09:20:52,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:52,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329228781] [2023-12-25 09:20:52,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [329228781] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:52,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:52,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-12-25 09:20:52,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368488646] [2023-12-25 09:20:52,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:52,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:20:52,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:52,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:20:52,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:20:52,499 INFO L87 Difference]: Start difference. First operand 16343 states and 18002 transitions. Second operand has 16 states, 16 states have (on average 8.875) internal successors, (142), 16 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:53,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:53,125 INFO L93 Difference]: Finished difference Result 24313 states and 26732 transitions. [2023-12-25 09:20:53,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 09:20:53,125 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.875) internal successors, (142), 16 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2023-12-25 09:20:53,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:53,148 INFO L225 Difference]: With dead ends: 24313 [2023-12-25 09:20:53,150 INFO L226 Difference]: Without dead ends: 23041 [2023-12-25 09:20:53,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2023-12-25 09:20:53,158 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 667 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:53,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1417 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 09:20:53,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23041 states. [2023-12-25 09:20:53,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23041 to 16291. [2023-12-25 09:20:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16291 states, 16290 states have (on average 1.1014732965009209) internal successors, (17943), 16290 states have internal predecessors, (17943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16291 states to 16291 states and 17943 transitions. [2023-12-25 09:20:53,322 INFO L78 Accepts]: Start accepts. Automaton has 16291 states and 17943 transitions. Word has length 115 [2023-12-25 09:20:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:53,322 INFO L495 AbstractCegarLoop]: Abstraction has 16291 states and 17943 transitions. [2023-12-25 09:20:53,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.875) internal successors, (142), 16 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:53,323 INFO L276 IsEmpty]: Start isEmpty. Operand 16291 states and 17943 transitions. [2023-12-25 09:20:53,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-25 09:20:53,325 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:53,325 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 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] [2023-12-25 09:20:53,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:53,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:53,528 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:53,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:53,528 INFO L85 PathProgramCache]: Analyzing trace with hash 2018757295, now seen corresponding path program 1 times [2023-12-25 09:20:53,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:53,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217061595] [2023-12-25 09:20:53,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:53,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:53,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:53,530 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:53,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-12-25 09:20:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:53,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-25 09:20:53,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:55,571 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 33 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:55,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 13 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:56,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:56,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217061595] [2023-12-25 09:20:56,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217061595] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:56,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:56,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 42 [2023-12-25 09:20:56,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775787192] [2023-12-25 09:20:56,770 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:56,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-25 09:20:56,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:56,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-25 09:20:56,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1519, Unknown=0, NotChecked=0, Total=1722 [2023-12-25 09:20:56,771 INFO L87 Difference]: Start difference. First operand 16291 states and 17943 transitions. Second operand has 42 states, 42 states have (on average 5.4523809523809526) internal successors, (229), 42 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:10,296 INFO L93 Difference]: Finished difference Result 38464 states and 42239 transitions. [2023-12-25 09:22:10,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 384 states. [2023-12-25 09:22:10,297 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 5.4523809523809526) internal successors, (229), 42 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2023-12-25 09:22:10,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:10,321 INFO L225 Difference]: With dead ends: 38464 [2023-12-25 09:22:10,322 INFO L226 Difference]: Without dead ends: 31424 [2023-12-25 09:22:10,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 422 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77888 ImplicationChecksByTransitivity, 68.0s TimeCoverageRelationStatistics Valid=16380, Invalid=162972, Unknown=0, NotChecked=0, Total=179352 [2023-12-25 09:22:10,338 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 5637 mSDsluCounter, 6477 mSDsCounter, 0 mSdLazyCounter, 4304 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5637 SdHoareTripleChecker+Valid, 6879 SdHoareTripleChecker+Invalid, 4409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 4304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:10,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5637 Valid, 6879 Invalid, 4409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 4304 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2023-12-25 09:22:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31424 states. [2023-12-25 09:22:10,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31424 to 18176. [2023-12-25 09:22:10,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18176 states, 18175 states have (on average 1.0993122420907842) internal successors, (19980), 18175 states have internal predecessors, (19980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18176 states to 18176 states and 19980 transitions. [2023-12-25 09:22:10,515 INFO L78 Accepts]: Start accepts. Automaton has 18176 states and 19980 transitions. Word has length 119 [2023-12-25 09:22:10,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:10,515 INFO L495 AbstractCegarLoop]: Abstraction has 18176 states and 19980 transitions. [2023-12-25 09:22:10,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 5.4523809523809526) internal successors, (229), 42 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand 18176 states and 19980 transitions. [2023-12-25 09:22:10,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-25 09:22:10,517 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:10,518 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 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 09:22:10,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2023-12-25 09:22:10,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:10,720 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:10,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:10,721 INFO L85 PathProgramCache]: Analyzing trace with hash 492441362, now seen corresponding path program 1 times [2023-12-25 09:22:10,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:10,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324801871] [2023-12-25 09:22:10,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:10,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:10,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:10,722 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:22:10,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2023-12-25 09:22:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:10,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-25 09:22:10,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 24 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:13,080 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:22:14,366 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 13 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:14,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:14,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324801871] [2023-12-25 09:22:14,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324801871] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:22:14,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:22:14,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20] total 43 [2023-12-25 09:22:14,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565724365] [2023-12-25 09:22:14,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:22:14,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-25 09:22:14,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:14,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-25 09:22:14,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1596, Unknown=0, NotChecked=0, Total=1806 [2023-12-25 09:22:14,368 INFO L87 Difference]: Start difference. First operand 18176 states and 19980 transitions. Second operand has 43 states, 43 states have (on average 5.372093023255814) internal successors, (231), 43 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:09,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:09,176 INFO L93 Difference]: Finished difference Result 37146 states and 40795 transitions. [2023-12-25 09:23:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 311 states. [2023-12-25 09:23:09,178 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 5.372093023255814) internal successors, (231), 43 states have internal predecessors, (231), 0 states have call successors, (0), 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 120 [2023-12-25 09:23:09,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:09,209 INFO L225 Difference]: With dead ends: 37146 [2023-12-25 09:23:09,209 INFO L226 Difference]: Without dead ends: 28352 [2023-12-25 09:23:09,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52419 ImplicationChecksByTransitivity, 50.5s TimeCoverageRelationStatistics Valid=11998, Invalid=111554, Unknown=0, NotChecked=0, Total=123552 [2023-12-25 09:23:09,223 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 5608 mSDsluCounter, 5465 mSDsCounter, 0 mSdLazyCounter, 3399 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5608 SdHoareTripleChecker+Valid, 5698 SdHoareTripleChecker+Invalid, 3528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 3399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:09,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5608 Valid, 5698 Invalid, 3528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 3399 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2023-12-25 09:23:09,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28352 states. [2023-12-25 09:23:09,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28352 to 20334. [2023-12-25 09:23:09,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20334 states, 20333 states have (on average 1.0986573550386072) internal successors, (22339), 20333 states have internal predecessors, (22339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:09,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20334 states to 20334 states and 22339 transitions. [2023-12-25 09:23:09,449 INFO L78 Accepts]: Start accepts. Automaton has 20334 states and 22339 transitions. Word has length 120 [2023-12-25 09:23:09,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:09,449 INFO L495 AbstractCegarLoop]: Abstraction has 20334 states and 22339 transitions. [2023-12-25 09:23:09,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 5.372093023255814) internal successors, (231), 43 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:09,449 INFO L276 IsEmpty]: Start isEmpty. Operand 20334 states and 22339 transitions. [2023-12-25 09:23:09,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-25 09:23:09,452 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:09,452 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 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 09:23:09,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2023-12-25 09:23:09,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:09,657 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:09,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:09,657 INFO L85 PathProgramCache]: Analyzing trace with hash 18892082, now seen corresponding path program 1 times [2023-12-25 09:23:09,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:09,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875733198] [2023-12-25 09:23:09,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:09,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:09,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:09,659 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:09,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2023-12-25 09:23:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:09,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-25 09:23:09,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:12,486 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 34 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:12,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:23:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:14,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:14,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875733198] [2023-12-25 09:23:14,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875733198] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:23:14,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:23:14,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 55 [2023-12-25 09:23:14,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074255337] [2023-12-25 09:23:14,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:23:14,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-12-25 09:23:14,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:14,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-12-25 09:23:14,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=2635, Unknown=0, NotChecked=0, Total=2970 [2023-12-25 09:23:14,584 INFO L87 Difference]: Start difference. First operand 20334 states and 22339 transitions. Second operand has 55 states, 55 states have (on average 4.090909090909091) internal successors, (225), 55 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:24:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:24:44,658 INFO L93 Difference]: Finished difference Result 39943 states and 43902 transitions. [2023-12-25 09:24:44,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 376 states. [2023-12-25 09:24:44,658 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 4.090909090909091) internal successors, (225), 55 states have internal predecessors, (225), 0 states have call successors, (0), 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 120 [2023-12-25 09:24:44,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:24:44,685 INFO L225 Difference]: With dead ends: 39943 [2023-12-25 09:24:44,686 INFO L226 Difference]: Without dead ends: 30444 [2023-12-25 09:24:44,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 427 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77132 ImplicationChecksByTransitivity, 83.0s TimeCoverageRelationStatistics Valid=18425, Invalid=165187, Unknown=0, NotChecked=0, Total=183612 [2023-12-25 09:24:44,707 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 8120 mSDsluCounter, 8747 mSDsCounter, 0 mSdLazyCounter, 5507 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8120 SdHoareTripleChecker+Valid, 9053 SdHoareTripleChecker+Invalid, 5744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 5507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2023-12-25 09:24:44,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8120 Valid, 9053 Invalid, 5744 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [237 Valid, 5507 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2023-12-25 09:24:44,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30444 states. [2023-12-25 09:24:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30444 to 20662. [2023-12-25 09:24:44,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20662 states, 20661 states have (on average 1.0985431489279318) internal successors, (22697), 20661 states have internal predecessors, (22697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:24:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20662 states to 20662 states and 22697 transitions. [2023-12-25 09:24:44,885 INFO L78 Accepts]: Start accepts. Automaton has 20662 states and 22697 transitions. Word has length 120 [2023-12-25 09:24:44,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:24:44,887 INFO L495 AbstractCegarLoop]: Abstraction has 20662 states and 22697 transitions. [2023-12-25 09:24:44,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 4.090909090909091) internal successors, (225), 55 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:24:44,887 INFO L276 IsEmpty]: Start isEmpty. Operand 20662 states and 22697 transitions. [2023-12-25 09:24:44,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-25 09:24:44,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:24:44,893 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:24:44,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Ended with exit code 0 [2023-12-25 09:24:45,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:24:45,095 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:24:45,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:24:45,096 INFO L85 PathProgramCache]: Analyzing trace with hash -459182034, now seen corresponding path program 2 times [2023-12-25 09:24:45,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:24:45,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136357709] [2023-12-25 09:24:45,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 09:24:45,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:24:45,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:24:45,098 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:24:45,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2023-12-25 09:24:45,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 09:24:45,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 09:24:45,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 09:24:45,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:24:45,734 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 19 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-25 09:24:45,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:24:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 130 proven. 33 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-25 09:24:45,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:24:45,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136357709] [2023-12-25 09:24:45,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136357709] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:24:45,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:24:45,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2023-12-25 09:24:45,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537901438] [2023-12-25 09:24:45,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:24:45,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 09:24:45,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:24:45,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 09:24:45,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2023-12-25 09:24:45,891 INFO L87 Difference]: Start difference. First operand 20662 states and 22697 transitions. Second operand has 19 states, 19 states have (on average 9.421052631578947) internal successors, (179), 19 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:24:46,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:24:46,674 INFO L93 Difference]: Finished difference Result 37813 states and 41564 transitions. [2023-12-25 09:24:46,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-25 09:24:46,674 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 9.421052631578947) internal successors, (179), 19 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2023-12-25 09:24:46,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:24:46,705 INFO L225 Difference]: With dead ends: 37813 [2023-12-25 09:24:46,705 INFO L226 Difference]: Without dead ends: 33998 [2023-12-25 09:24:46,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=371, Invalid=1269, Unknown=0, NotChecked=0, Total=1640 [2023-12-25 09:24:46,719 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 1051 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:24:46,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 2006 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 09:24:46,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33998 states. [2023-12-25 09:24:46,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33998 to 23547. [2023-12-25 09:24:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23547 states, 23546 states have (on average 1.0964495031003143) internal successors, (25817), 23546 states have internal predecessors, (25817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:24:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23547 states to 23547 states and 25817 transitions. [2023-12-25 09:24:46,939 INFO L78 Accepts]: Start accepts. Automaton has 23547 states and 25817 transitions. Word has length 141 [2023-12-25 09:24:46,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:24:46,940 INFO L495 AbstractCegarLoop]: Abstraction has 23547 states and 25817 transitions. [2023-12-25 09:24:46,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.421052631578947) internal successors, (179), 19 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:24:46,940 INFO L276 IsEmpty]: Start isEmpty. Operand 23547 states and 25817 transitions. [2023-12-25 09:24:46,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-25 09:24:46,944 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:24:46,944 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:24:46,946 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 (45)] Ended with exit code 0 [2023-12-25 09:24:47,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:24:47,147 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:24:47,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:24:47,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1501730028, now seen corresponding path program 1 times [2023-12-25 09:24:47,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:24:47,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541314787] [2023-12-25 09:24:47,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:24:47,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:24:47,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:24:47,148 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:24:47,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2023-12-25 09:24:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:24:47,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 09:24:47,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:24:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 126 proven. 17 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-25 09:24:47,717 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:24:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 126 proven. 17 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-25 09:24:47,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:24:47,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541314787] [2023-12-25 09:24:47,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541314787] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:24:47,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:24:47,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2023-12-25 09:24:47,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793781836] [2023-12-25 09:24:47,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:24:47,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 09:24:47,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:24:47,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 09:24:47,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2023-12-25 09:24:47,832 INFO L87 Difference]: Start difference. First operand 23547 states and 25817 transitions. Second operand has 18 states, 18 states have (on average 8.833333333333334) internal successors, (159), 18 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:24:48,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:24:48,970 INFO L93 Difference]: Finished difference Result 39185 states and 43033 transitions. [2023-12-25 09:24:48,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-25 09:24:48,971 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.833333333333334) internal successors, (159), 18 states have internal predecessors, (159), 0 states have call successors, (0), 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 141 [2023-12-25 09:24:48,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:24:49,005 INFO L225 Difference]: With dead ends: 39185 [2023-12-25 09:24:49,005 INFO L226 Difference]: Without dead ends: 36355 [2023-12-25 09:24:49,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2023-12-25 09:24:49,020 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 1078 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:24:49,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 1785 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 09:24:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36355 states. [2023-12-25 09:24:49,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36355 to 24849. [2023-12-25 09:24:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24849 states, 24848 states have (on average 1.0971506761107535) internal successors, (27262), 24848 states have internal predecessors, (27262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:24:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24849 states to 24849 states and 27262 transitions. [2023-12-25 09:24:49,328 INFO L78 Accepts]: Start accepts. Automaton has 24849 states and 27262 transitions. Word has length 141 [2023-12-25 09:24:49,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:24:49,328 INFO L495 AbstractCegarLoop]: Abstraction has 24849 states and 27262 transitions. [2023-12-25 09:24:49,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.833333333333334) internal successors, (159), 18 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:24:49,328 INFO L276 IsEmpty]: Start isEmpty. Operand 24849 states and 27262 transitions. [2023-12-25 09:24:49,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-25 09:24:49,331 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:24:49,331 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:24:49,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2023-12-25 09:24:49,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:24:49,534 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:24:49,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:24:49,536 INFO L85 PathProgramCache]: Analyzing trace with hash 58516788, now seen corresponding path program 1 times [2023-12-25 09:24:49,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:24:49,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541566529] [2023-12-25 09:24:49,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:24:49,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:24:49,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:24:49,537 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:24:49,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2023-12-25 09:24:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:24:49,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 09:24:49,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:24:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 128 proven. 26 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-25 09:24:50,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:24:50,351 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 128 proven. 26 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-25 09:24:50,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:24:50,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541566529] [2023-12-25 09:24:50,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541566529] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:24:50,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:24:50,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2023-12-25 09:24:50,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122547318] [2023-12-25 09:24:50,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:24:50,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 09:24:50,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:24:50,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 09:24:50,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2023-12-25 09:24:50,353 INFO L87 Difference]: Start difference. First operand 24849 states and 27262 transitions. Second operand has 19 states, 19 states have (on average 9.105263157894736) internal successors, (173), 19 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:24:51,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:24:51,992 INFO L93 Difference]: Finished difference Result 48037 states and 52793 transitions. [2023-12-25 09:24:51,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-25 09:24:51,993 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 9.105263157894736) internal successors, (173), 19 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2023-12-25 09:24:51,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:24:52,033 INFO L225 Difference]: With dead ends: 48037 [2023-12-25 09:24:52,033 INFO L226 Difference]: Without dead ends: 45336 [2023-12-25 09:24:52,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=424, Invalid=1556, Unknown=0, NotChecked=0, Total=1980 [2023-12-25 09:24:52,048 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 1221 mSDsluCounter, 2147 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 2329 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:24:52,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 2329 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 09:24:52,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45336 states. [2023-12-25 09:24:52,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45336 to 25157. [2023-12-25 09:24:52,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25157 states, 25156 states have (on average 1.0971537605342663) internal successors, (27600), 25156 states have internal predecessors, (27600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:24:52,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25157 states to 25157 states and 27600 transitions. [2023-12-25 09:24:52,328 INFO L78 Accepts]: Start accepts. Automaton has 25157 states and 27600 transitions. Word has length 141 [2023-12-25 09:24:52,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:24:52,328 INFO L495 AbstractCegarLoop]: Abstraction has 25157 states and 27600 transitions. [2023-12-25 09:24:52,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.105263157894736) internal successors, (173), 19 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:24:52,328 INFO L276 IsEmpty]: Start isEmpty. Operand 25157 states and 27600 transitions. [2023-12-25 09:24:52,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-25 09:24:52,331 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:24:52,331 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-25 09:24:52,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2023-12-25 09:24:52,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:24:52,535 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:24:52,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:24:52,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1584685116, now seen corresponding path program 1 times [2023-12-25 09:24:52,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:24:52,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918132793] [2023-12-25 09:24:52,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:24:52,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:24:52,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:24:52,536 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:24:52,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2023-12-25 09:24:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:24:52,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:24:52,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:24:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 136 proven. 51 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-25 09:24:53,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:24:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 136 proven. 51 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-25 09:24:53,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:24:53,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918132793] [2023-12-25 09:24:53,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918132793] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:24:53,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:24:53,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-25 09:24:53,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029075816] [2023-12-25 09:24:53,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:24:53,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 09:24:53,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:24:53,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 09:24:53,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2023-12-25 09:24:53,565 INFO L87 Difference]: Start difference. First operand 25157 states and 27600 transitions. Second operand has 26 states, 26 states have (on average 8.192307692307692) internal successors, (213), 25 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:24:58,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:24:58,667 INFO L93 Difference]: Finished difference Result 35273 states and 38749 transitions. [2023-12-25 09:24:58,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-12-25 09:24:58,667 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.192307692307692) internal successors, (213), 25 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2023-12-25 09:24:58,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:24:58,693 INFO L225 Difference]: With dead ends: 35273 [2023-12-25 09:24:58,693 INFO L226 Difference]: Without dead ends: 28232 [2023-12-25 09:24:58,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1810 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1314, Invalid=5996, Unknown=0, NotChecked=0, Total=7310 [2023-12-25 09:24:58,703 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 1683 mSDsluCounter, 2519 mSDsCounter, 0 mSdLazyCounter, 2627 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1683 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 2644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:24:58,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1683 Valid, 2687 Invalid, 2644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2627 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-25 09:24:58,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28232 states. [2023-12-25 09:24:58,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28232 to 24214. [2023-12-25 09:24:58,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24214 states, 24213 states have (on average 1.0961053979267337) internal successors, (26540), 24213 states have internal predecessors, (26540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:24:58,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24214 states to 24214 states and 26540 transitions. [2023-12-25 09:24:58,884 INFO L78 Accepts]: Start accepts. Automaton has 24214 states and 26540 transitions. Word has length 147 [2023-12-25 09:24:58,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:24:58,884 INFO L495 AbstractCegarLoop]: Abstraction has 24214 states and 26540 transitions. [2023-12-25 09:24:58,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.192307692307692) internal successors, (213), 25 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:24:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 24214 states and 26540 transitions. [2023-12-25 09:24:58,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-25 09:24:58,887 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:24:58,887 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-25 09:24:58,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Forceful destruction successful, exit code 0 [2023-12-25 09:24:59,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:24:59,091 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:24:59,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:24:59,091 INFO L85 PathProgramCache]: Analyzing trace with hash 365295534, now seen corresponding path program 1 times [2023-12-25 09:24:59,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:24:59,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785783502] [2023-12-25 09:24:59,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:24:59,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:24:59,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:24:59,093 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:24:59,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2023-12-25 09:24:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:24:59,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:24:59,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:24:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 134 proven. 60 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 09:24:59,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:25:00,184 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 134 proven. 60 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 09:25:00,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:25:00,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785783502] [2023-12-25 09:25:00,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785783502] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:25:00,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:25:00,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-25 09:25:00,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355222114] [2023-12-25 09:25:00,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:25:00,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 09:25:00,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:25:00,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 09:25:00,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2023-12-25 09:25:00,186 INFO L87 Difference]: Start difference. First operand 24214 states and 26540 transitions. Second operand has 26 states, 26 states have (on average 8.576923076923077) internal successors, (223), 25 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:25:05,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:25:05,150 INFO L93 Difference]: Finished difference Result 29134 states and 31937 transitions. [2023-12-25 09:25:05,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-12-25 09:25:05,151 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.576923076923077) internal successors, (223), 25 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2023-12-25 09:25:05,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:25:05,171 INFO L225 Difference]: With dead ends: 29134 [2023-12-25 09:25:05,171 INFO L226 Difference]: Without dead ends: 24976 [2023-12-25 09:25:05,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1879 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1362, Invalid=6120, Unknown=0, NotChecked=0, Total=7482 [2023-12-25 09:25:05,180 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 1413 mSDsluCounter, 2612 mSDsCounter, 0 mSdLazyCounter, 2600 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 2781 SdHoareTripleChecker+Invalid, 2617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:25:05,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1413 Valid, 2781 Invalid, 2617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2600 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-25 09:25:05,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24976 states. [2023-12-25 09:25:05,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24976 to 23979. [2023-12-25 09:25:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23979 states, 23978 states have (on average 1.09479522895988) internal successors, (26251), 23978 states have internal predecessors, (26251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:25:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23979 states to 23979 states and 26251 transitions. [2023-12-25 09:25:05,358 INFO L78 Accepts]: Start accepts. Automaton has 23979 states and 26251 transitions. Word has length 147 [2023-12-25 09:25:05,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:25:05,358 INFO L495 AbstractCegarLoop]: Abstraction has 23979 states and 26251 transitions. [2023-12-25 09:25:05,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.576923076923077) internal successors, (223), 25 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:25:05,358 INFO L276 IsEmpty]: Start isEmpty. Operand 23979 states and 26251 transitions. [2023-12-25 09:25:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-25 09:25:05,361 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:25:05,361 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-25 09:25:05,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Forceful destruction successful, exit code 0 [2023-12-25 09:25:05,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:25:05,564 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:25:05,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:25:05,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2012307994, now seen corresponding path program 1 times [2023-12-25 09:25:05,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:25:05,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200162984] [2023-12-25 09:25:05,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:25:05,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:25:05,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:25:05,566 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:25:05,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2023-12-25 09:25:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:25:05,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:25:05,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:25:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 132 proven. 68 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 09:25:06,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:25:06,650 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 132 proven. 68 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 09:25:06,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:25:06,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200162984] [2023-12-25 09:25:06,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200162984] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:25:06,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:25:06,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-25 09:25:06,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592925980] [2023-12-25 09:25:06,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:25:06,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 09:25:06,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:25:06,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 09:25:06,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2023-12-25 09:25:06,652 INFO L87 Difference]: Start difference. First operand 23979 states and 26251 transitions. Second operand has 26 states, 26 states have (on average 8.884615384615385) internal successors, (231), 25 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:25:26,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:25:26,029 INFO L93 Difference]: Finished difference Result 52927 states and 58309 transitions. [2023-12-25 09:25:26,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 264 states. [2023-12-25 09:25:26,030 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.884615384615385) internal successors, (231), 25 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2023-12-25 09:25:26,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:25:26,083 INFO L225 Difference]: With dead ends: 52927 [2023-12-25 09:25:26,083 INFO L226 Difference]: Without dead ends: 50096 [2023-12-25 09:25:26,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33121 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=9030, Invalid=73052, Unknown=0, NotChecked=0, Total=82082 [2023-12-25 09:25:26,108 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 3349 mSDsluCounter, 3245 mSDsCounter, 0 mSdLazyCounter, 3334 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3349 SdHoareTripleChecker+Valid, 3432 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 3334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-25 09:25:26,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3349 Valid, 3432 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 3334 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-12-25 09:25:26,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50096 states. [2023-12-25 09:25:26,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50096 to 23750. [2023-12-25 09:25:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23750 states, 23749 states have (on average 1.0923828371720914) internal successors, (25943), 23749 states have internal predecessors, (25943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:25:26,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23750 states to 23750 states and 25943 transitions. [2023-12-25 09:25:26,401 INFO L78 Accepts]: Start accepts. Automaton has 23750 states and 25943 transitions. Word has length 147 [2023-12-25 09:25:26,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:25:26,401 INFO L495 AbstractCegarLoop]: Abstraction has 23750 states and 25943 transitions. [2023-12-25 09:25:26,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.884615384615385) internal successors, (231), 25 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:25:26,402 INFO L276 IsEmpty]: Start isEmpty. Operand 23750 states and 25943 transitions. [2023-12-25 09:25:26,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-25 09:25:26,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:25:26,405 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2023-12-25 09:25:26,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Forceful destruction successful, exit code 0 [2023-12-25 09:25:26,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:25:26,611 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:25:26,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:25:26,611 INFO L85 PathProgramCache]: Analyzing trace with hash 681120718, now seen corresponding path program 1 times [2023-12-25 09:25:26,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:25:26,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689920701] [2023-12-25 09:25:26,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:25:26,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:25:26,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:25:26,614 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:25:26,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (51)] Waiting until timeout for monitored process [2023-12-25 09:25:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:25:26,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 09:25:26,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:25:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 118 proven. 96 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 09:25:27,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:25:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 118 proven. 96 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 09:25:28,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:25:28,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689920701] [2023-12-25 09:25:28,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689920701] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:25:28,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:25:28,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2023-12-25 09:25:28,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579829062] [2023-12-25 09:25:28,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:25:28,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-25 09:25:28,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:25:28,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-25 09:25:28,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2023-12-25 09:25:28,080 INFO L87 Difference]: Start difference. First operand 23750 states and 25943 transitions. Second operand has 28 states, 28 states have (on average 8.857142857142858) internal successors, (248), 28 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 09:25:39,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:25:39,512 INFO L93 Difference]: Finished difference Result 44608 states and 48856 transitions. [2023-12-25 09:25:39,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2023-12-25 09:25:39,513 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.857142857142858) internal successors, (248), 28 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) Word has length 149 [2023-12-25 09:25:39,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:25:39,549 INFO L225 Difference]: With dead ends: 44608 [2023-12-25 09:25:39,549 INFO L226 Difference]: Without dead ends: 41164 [2023-12-25 09:25:39,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5231 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=2600, Invalid=14430, Unknown=0, NotChecked=0, Total=17030 [2023-12-25 09:25:39,563 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 2142 mSDsluCounter, 5141 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2142 SdHoareTripleChecker+Valid, 5477 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:25:39,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2142 Valid, 5477 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2343 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-25 09:25:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41164 states. [2023-12-25 09:25:39,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41164 to 22447. [2023-12-25 09:25:39,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22447 states, 22446 states have (on average 1.0924886394012296) internal successors, (24522), 22446 states have internal predecessors, (24522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:25:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22447 states to 22447 states and 24522 transitions. [2023-12-25 09:25:39,794 INFO L78 Accepts]: Start accepts. Automaton has 22447 states and 24522 transitions. Word has length 149 [2023-12-25 09:25:39,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:25:39,795 INFO L495 AbstractCegarLoop]: Abstraction has 22447 states and 24522 transitions. [2023-12-25 09:25:39,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.857142857142858) internal successors, (248), 28 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 09:25:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 22447 states and 24522 transitions. [2023-12-25 09:25:39,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-25 09:25:39,798 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:25:39,798 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2023-12-25 09:25:39,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (51)] Ended with exit code 0 [2023-12-25 09:25:40,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:25:40,002 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:25:40,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:25:40,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1025408648, now seen corresponding path program 1 times [2023-12-25 09:25:40,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:25:40,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979628176] [2023-12-25 09:25:40,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:25:40,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:25:40,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:25:40,004 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:25:40,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2023-12-25 09:25:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:25:40,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 09:25:40,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:25:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 103 proven. 113 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 09:25:41,270 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:25:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 103 proven. 113 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 09:25:41,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:25:41,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979628176] [2023-12-25 09:25:41,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979628176] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:25:41,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:25:41,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2023-12-25 09:25:41,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838485972] [2023-12-25 09:25:41,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:25:41,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-25 09:25:41,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:25:41,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-25 09:25:41,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2023-12-25 09:25:41,531 INFO L87 Difference]: Start difference. First operand 22447 states and 24522 transitions. Second operand has 28 states, 28 states have (on average 9.035714285714286) internal successors, (253), 28 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:25:51,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:25:51,455 INFO L93 Difference]: Finished difference Result 36409 states and 39768 transitions. [2023-12-25 09:25:51,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-12-25 09:25:51,455 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.035714285714286) internal successors, (253), 28 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2023-12-25 09:25:51,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:25:51,486 INFO L225 Difference]: With dead ends: 36409 [2023-12-25 09:25:51,486 INFO L226 Difference]: Without dead ends: 34465 [2023-12-25 09:25:51,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3996 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=2308, Invalid=11264, Unknown=0, NotChecked=0, Total=13572 [2023-12-25 09:25:51,496 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 2192 mSDsluCounter, 5060 mSDsCounter, 0 mSdLazyCounter, 2245 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2192 SdHoareTripleChecker+Valid, 5386 SdHoareTripleChecker+Invalid, 2270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:25:51,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2192 Valid, 5386 Invalid, 2270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2245 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-25 09:25:51,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34465 states. [2023-12-25 09:25:51,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34465 to 22153. [2023-12-25 09:25:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22153 states, 22152 states have (on average 1.0910978692668833) internal successors, (24170), 22152 states have internal predecessors, (24170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:25:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22153 states to 22153 states and 24170 transitions. [2023-12-25 09:25:51,709 INFO L78 Accepts]: Start accepts. Automaton has 22153 states and 24170 transitions. Word has length 149 [2023-12-25 09:25:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:25:51,709 INFO L495 AbstractCegarLoop]: Abstraction has 22153 states and 24170 transitions. [2023-12-25 09:25:51,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.035714285714286) internal successors, (253), 28 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:25:51,710 INFO L276 IsEmpty]: Start isEmpty. Operand 22153 states and 24170 transitions. [2023-12-25 09:25:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-25 09:25:51,713 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:25:51,713 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2023-12-25 09:25:51,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Forceful destruction successful, exit code 0 [2023-12-25 09:25:51,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:25:51,916 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:25:51,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:25:51,916 INFO L85 PathProgramCache]: Analyzing trace with hash 714007454, now seen corresponding path program 1 times [2023-12-25 09:25:51,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:25:51,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825964192] [2023-12-25 09:25:51,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:25:51,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:25:51,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:25:51,918 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:25:51,946 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 (53)] Waiting until timeout for monitored process [2023-12-25 09:25:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:25:52,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 09:25:52,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:25:53,174 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 87 proven. 131 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 09:25:53,175 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:25:53,613 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 87 proven. 131 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 09:25:53,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:25:53,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825964192] [2023-12-25 09:25:53,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825964192] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:25:53,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:25:53,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2023-12-25 09:25:53,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564794764] [2023-12-25 09:25:53,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:25:53,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-25 09:25:53,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:25:53,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-25 09:25:53,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2023-12-25 09:25:53,625 INFO L87 Difference]: Start difference. First operand 22153 states and 24170 transitions. Second operand has 29 states, 29 states have (on average 9.137931034482758) internal successors, (265), 29 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:26:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:26:01,162 INFO L93 Difference]: Finished difference Result 44809 states and 48959 transitions. [2023-12-25 09:26:01,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2023-12-25 09:26:01,162 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.137931034482758) internal successors, (265), 29 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2023-12-25 09:26:01,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:26:01,203 INFO L225 Difference]: With dead ends: 44809 [2023-12-25 09:26:01,203 INFO L226 Difference]: Without dead ends: 43561 [2023-12-25 09:26:01,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3006 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1725, Invalid=9617, Unknown=0, NotChecked=0, Total=11342 [2023-12-25 09:26:01,217 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 2326 mSDsluCounter, 4454 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 4776 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:26:01,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2326 Valid, 4776 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-25 09:26:01,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43561 states. [2023-12-25 09:26:01,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43561 to 22134. [2023-12-25 09:26:01,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22134 states, 22133 states have (on average 1.0908598021054534) internal successors, (24144), 22133 states have internal predecessors, (24144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:26:01,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22134 states to 22134 states and 24144 transitions. [2023-12-25 09:26:01,503 INFO L78 Accepts]: Start accepts. Automaton has 22134 states and 24144 transitions. Word has length 149 [2023-12-25 09:26:01,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:26:01,504 INFO L495 AbstractCegarLoop]: Abstraction has 22134 states and 24144 transitions. [2023-12-25 09:26:01,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.137931034482758) internal successors, (265), 29 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:26:01,504 INFO L276 IsEmpty]: Start isEmpty. Operand 22134 states and 24144 transitions. [2023-12-25 09:26:01,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-25 09:26:01,507 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:26:01,507 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:26:01,513 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 (53)] Forceful destruction successful, exit code 0 [2023-12-25 09:26:01,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:26:01,711 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:26:01,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:26:01,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1845046883, now seen corresponding path program 1 times [2023-12-25 09:26:01,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:26:01,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097383393] [2023-12-25 09:26:01,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:26:01,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:26:01,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:26:01,713 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:26:01,713 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 (54)] Waiting until timeout for monitored process [2023-12-25 09:26:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:26:01,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 09:26:01,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:26:02,676 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 43 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:26:02,677 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:26:03,135 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 43 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:26:03,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:26:03,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097383393] [2023-12-25 09:26:03,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097383393] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:26:03,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:26:03,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2023-12-25 09:26:03,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059846220] [2023-12-25 09:26:03,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:26:03,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 09:26:03,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:26:03,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 09:26:03,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 09:26:03,137 INFO L87 Difference]: Start difference. First operand 22134 states and 24144 transitions. Second operand has 33 states, 33 states have (on average 8.727272727272727) internal successors, (288), 33 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:26:09,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:26:09,593 INFO L93 Difference]: Finished difference Result 39304 states and 42956 transitions. [2023-12-25 09:26:09,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-12-25 09:26:09,594 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.727272727272727) internal successors, (288), 33 states have internal predecessors, (288), 0 states have call successors, (0), 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 154 [2023-12-25 09:26:09,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:26:09,627 INFO L225 Difference]: With dead ends: 39304 [2023-12-25 09:26:09,628 INFO L226 Difference]: Without dead ends: 38817 [2023-12-25 09:26:09,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3204 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1774, Invalid=10658, Unknown=0, NotChecked=0, Total=12432 [2023-12-25 09:26:09,640 INFO L413 NwaCegarLoop]: 403 mSDtfsCounter, 1549 mSDsluCounter, 7195 mSDsCounter, 0 mSdLazyCounter, 2226 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 7598 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-25 09:26:09,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 7598 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2226 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-25 09:26:09,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38817 states. [2023-12-25 09:26:09,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38817 to 21690. [2023-12-25 09:26:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21690 states, 21689 states have (on average 1.0912444096085574) internal successors, (23668), 21689 states have internal predecessors, (23668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:26:09,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21690 states to 21690 states and 23668 transitions. [2023-12-25 09:26:09,878 INFO L78 Accepts]: Start accepts. Automaton has 21690 states and 23668 transitions. Word has length 154 [2023-12-25 09:26:09,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:26:09,878 INFO L495 AbstractCegarLoop]: Abstraction has 21690 states and 23668 transitions. [2023-12-25 09:26:09,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.727272727272727) internal successors, (288), 33 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:26:09,879 INFO L276 IsEmpty]: Start isEmpty. Operand 21690 states and 23668 transitions. [2023-12-25 09:26:09,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-25 09:26:09,881 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:26:09,882 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:26:09,885 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 (54)] Forceful destruction successful, exit code 0 [2023-12-25 09:26:10,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:26:10,085 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:26:10,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:26:10,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1738553045, now seen corresponding path program 1 times [2023-12-25 09:26:10,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:26:10,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961556406] [2023-12-25 09:26:10,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:26:10,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:26:10,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:26:10,087 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:26:10,088 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 (55)] Waiting until timeout for monitored process [2023-12-25 09:26:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:26:10,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 09:26:10,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:26:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 27 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:26:11,023 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:26:11,487 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 27 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:26:11,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:26:11,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961556406] [2023-12-25 09:26:11,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961556406] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:26:11,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:26:11,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2023-12-25 09:26:11,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60739516] [2023-12-25 09:26:11,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:26:11,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 09:26:11,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:26:11,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 09:26:11,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 09:26:11,488 INFO L87 Difference]: Start difference. First operand 21690 states and 23668 transitions. Second operand has 33 states, 33 states have (on average 8.757575757575758) internal successors, (289), 33 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:26:18,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:26:18,313 INFO L93 Difference]: Finished difference Result 33066 states and 36046 transitions. [2023-12-25 09:26:18,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-12-25 09:26:18,314 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.757575757575758) internal successors, (289), 33 states have internal predecessors, (289), 0 states have call successors, (0), 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 154 [2023-12-25 09:26:18,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:26:18,341 INFO L225 Difference]: With dead ends: 33066 [2023-12-25 09:26:18,341 INFO L226 Difference]: Without dead ends: 32482 [2023-12-25 09:26:18,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3498 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2022, Invalid=11318, Unknown=0, NotChecked=0, Total=13340 [2023-12-25 09:26:18,353 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 1593 mSDsluCounter, 6514 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1593 SdHoareTripleChecker+Valid, 6850 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:26:18,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1593 Valid, 6850 Invalid, 2244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2234 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-25 09:26:18,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32482 states. [2023-12-25 09:26:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32482 to 21154. [2023-12-25 09:26:18,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21154 states, 21153 states have (on average 1.0918545832742401) internal successors, (23096), 21153 states have internal predecessors, (23096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:26:18,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21154 states to 21154 states and 23096 transitions. [2023-12-25 09:26:18,546 INFO L78 Accepts]: Start accepts. Automaton has 21154 states and 23096 transitions. Word has length 154 [2023-12-25 09:26:18,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:26:18,546 INFO L495 AbstractCegarLoop]: Abstraction has 21154 states and 23096 transitions. [2023-12-25 09:26:18,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.757575757575758) internal successors, (289), 33 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:26:18,547 INFO L276 IsEmpty]: Start isEmpty. Operand 21154 states and 23096 transitions. [2023-12-25 09:26:18,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-25 09:26:18,549 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:26:18,550 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:26:18,552 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 (55)] Ended with exit code 0 [2023-12-25 09:26:18,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:26:18,752 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:26:18,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:26:18,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1984906376, now seen corresponding path program 1 times [2023-12-25 09:26:18,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:26:18,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206680238] [2023-12-25 09:26:18,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:26:18,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:26:18,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:26:18,754 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:26:18,755 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 (56)] Waiting until timeout for monitored process [2023-12-25 09:26:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:26:18,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 09:26:18,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:26:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 58 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:26:19,512 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:26:19,890 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 58 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:26:19,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:26:19,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206680238] [2023-12-25 09:26:19,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206680238] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:26:19,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:26:19,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2023-12-25 09:26:19,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036743470] [2023-12-25 09:26:19,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:26:19,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 09:26:19,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:26:19,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 09:26:19,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 09:26:19,892 INFO L87 Difference]: Start difference. First operand 21154 states and 23096 transitions. Second operand has 33 states, 33 states have (on average 8.696969696969697) internal successors, (287), 33 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:26:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:26:50,467 INFO L93 Difference]: Finished difference Result 56991 states and 62502 transitions. [2023-12-25 09:26:50,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 367 states. [2023-12-25 09:26:50,468 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.696969696969697) internal successors, (287), 33 states have internal predecessors, (287), 0 states have call successors, (0), 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 154 [2023-12-25 09:26:50,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:26:50,522 INFO L225 Difference]: With dead ends: 56991 [2023-12-25 09:26:50,523 INFO L226 Difference]: Without dead ends: 56513 [2023-12-25 09:26:50,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 388 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65614 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=12223, Invalid=139487, Unknown=0, NotChecked=0, Total=151710 [2023-12-25 09:26:50,550 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 3512 mSDsluCounter, 9892 mSDsCounter, 0 mSdLazyCounter, 3339 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3512 SdHoareTripleChecker+Valid, 10336 SdHoareTripleChecker+Invalid, 3373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:26:50,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3512 Valid, 10336 Invalid, 3373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3339 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-25 09:26:50,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56513 states. [2023-12-25 09:26:50,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56513 to 20678. [2023-12-25 09:26:50,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20678 states, 20677 states have (on average 1.0923731682545823) internal successors, (22587), 20677 states have internal predecessors, (22587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:26:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20678 states to 20678 states and 22587 transitions. [2023-12-25 09:26:50,846 INFO L78 Accepts]: Start accepts. Automaton has 20678 states and 22587 transitions. Word has length 154 [2023-12-25 09:26:50,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:26:50,846 INFO L495 AbstractCegarLoop]: Abstraction has 20678 states and 22587 transitions. [2023-12-25 09:26:50,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.696969696969697) internal successors, (287), 33 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:26:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand 20678 states and 22587 transitions. [2023-12-25 09:26:50,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-25 09:26:50,849 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:26:50,849 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:26:50,854 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 (56)] Forceful destruction successful, exit code 0 [2023-12-25 09:26:51,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:26:51,055 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:26:51,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:26:51,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1496487255, now seen corresponding path program 1 times [2023-12-25 09:26:51,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:26:51,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372219946] [2023-12-25 09:26:51,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:26:51,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:26:51,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:26:51,057 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:26:51,058 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 (57)] Waiting until timeout for monitored process [2023-12-25 09:26:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:26:51,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 09:26:51,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:26:52,493 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 122 proven. 100 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 09:26:52,493 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:26:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 122 proven. 100 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 09:26:52,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:26:52,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372219946] [2023-12-25 09:26:52,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372219946] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:26:52,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:26:52,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2023-12-25 09:26:52,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586324217] [2023-12-25 09:26:52,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:26:52,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-25 09:26:52,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:26:52,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-25 09:26:52,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2023-12-25 09:26:52,792 INFO L87 Difference]: Start difference. First operand 20678 states and 22587 transitions. Second operand has 28 states, 28 states have (on average 9.5) internal successors, (266), 28 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:03,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:27:03,693 INFO L93 Difference]: Finished difference Result 41596 states and 45530 transitions. [2023-12-25 09:27:03,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2023-12-25 09:27:03,694 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.5) internal successors, (266), 28 states have internal predecessors, (266), 0 states have call successors, (0), 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 158 [2023-12-25 09:27:03,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:27:03,724 INFO L225 Difference]: With dead ends: 41596 [2023-12-25 09:27:03,724 INFO L226 Difference]: Without dead ends: 33844 [2023-12-25 09:27:03,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4844 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=2521, Invalid=13481, Unknown=0, NotChecked=0, Total=16002 [2023-12-25 09:27:03,737 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 2050 mSDsluCounter, 5013 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2050 SdHoareTripleChecker+Valid, 5325 SdHoareTripleChecker+Invalid, 2393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:27:03,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2050 Valid, 5325 Invalid, 2393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-25 09:27:03,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33844 states. [2023-12-25 09:27:03,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33844 to 22520. [2023-12-25 09:27:03,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22520 states, 22519 states have (on average 1.0911674585905236) internal successors, (24572), 22519 states have internal predecessors, (24572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:03,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22520 states to 22520 states and 24572 transitions. [2023-12-25 09:27:03,948 INFO L78 Accepts]: Start accepts. Automaton has 22520 states and 24572 transitions. Word has length 158 [2023-12-25 09:27:03,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:27:03,948 INFO L495 AbstractCegarLoop]: Abstraction has 22520 states and 24572 transitions. [2023-12-25 09:27:03,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.5) internal successors, (266), 28 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:03,948 INFO L276 IsEmpty]: Start isEmpty. Operand 22520 states and 24572 transitions. [2023-12-25 09:27:03,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-25 09:27:03,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:27:03,967 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:27:03,980 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 (57)] Forceful destruction successful, exit code 0 [2023-12-25 09:27:04,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:27:04,167 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:27:04,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:27:04,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1809582153, now seen corresponding path program 1 times [2023-12-25 09:27:04,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:27:04,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459080829] [2023-12-25 09:27:04,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:27:04,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:27:04,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:27:04,169 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:27:04,176 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 (58)] Waiting until timeout for monitored process [2023-12-25 09:27:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:27:04,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 09:27:04,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:27:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 90 proven. 136 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 09:27:05,568 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:27:06,029 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 90 proven. 136 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 09:27:06,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:27:06,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459080829] [2023-12-25 09:27:06,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459080829] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:27:06,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:27:06,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2023-12-25 09:27:06,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808898154] [2023-12-25 09:27:06,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:27:06,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-25 09:27:06,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:27:06,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-25 09:27:06,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2023-12-25 09:27:06,030 INFO L87 Difference]: Start difference. First operand 22520 states and 24572 transitions. Second operand has 29 states, 29 states have (on average 9.724137931034482) internal successors, (282), 29 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:27:12,356 INFO L93 Difference]: Finished difference Result 48715 states and 53345 transitions. [2023-12-25 09:27:12,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-12-25 09:27:12,357 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.724137931034482) internal successors, (282), 29 states have internal predecessors, (282), 0 states have call successors, (0), 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 158 [2023-12-25 09:27:12,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:27:12,393 INFO L225 Difference]: With dead ends: 48715 [2023-12-25 09:27:12,393 INFO L226 Difference]: Without dead ends: 42041 [2023-12-25 09:27:12,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2089 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1136, Invalid=7420, Unknown=0, NotChecked=0, Total=8556 [2023-12-25 09:27:12,408 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 1745 mSDsluCounter, 4800 mSDsCounter, 0 mSdLazyCounter, 1847 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1745 SdHoareTripleChecker+Valid, 5083 SdHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-25 09:27:12,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1745 Valid, 5083 Invalid, 1866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1847 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-25 09:27:12,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42041 states. [2023-12-25 09:27:12,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42041 to 24346. [2023-12-25 09:27:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24346 states, 24345 states have (on average 1.0904908605463135) internal successors, (26548), 24345 states have internal predecessors, (26548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:12,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24346 states to 24346 states and 26548 transitions. [2023-12-25 09:27:12,651 INFO L78 Accepts]: Start accepts. Automaton has 24346 states and 26548 transitions. Word has length 158 [2023-12-25 09:27:12,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:27:12,652 INFO L495 AbstractCegarLoop]: Abstraction has 24346 states and 26548 transitions. [2023-12-25 09:27:12,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.724137931034482) internal successors, (282), 29 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:12,652 INFO L276 IsEmpty]: Start isEmpty. Operand 24346 states and 26548 transitions. [2023-12-25 09:27:12,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-25 09:27:12,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:27:12,654 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:27:12,657 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 (58)] Ended with exit code 0 [2023-12-25 09:27:12,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:27:12,857 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:27:12,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:27:12,857 INFO L85 PathProgramCache]: Analyzing trace with hash 27647329, now seen corresponding path program 1 times [2023-12-25 09:27:12,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:27:12,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875331214] [2023-12-25 09:27:12,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:27:12,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:27:12,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:27:12,859 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:27:12,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (59)] Waiting until timeout for monitored process [2023-12-25 09:27:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:27:12,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 09:27:12,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:27:13,747 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 57 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:27:13,747 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:27:14,134 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 57 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:27:14,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:27:14,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875331214] [2023-12-25 09:27:14,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875331214] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:27:14,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:27:14,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2023-12-25 09:27:14,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932545217] [2023-12-25 09:27:14,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:27:14,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 09:27:14,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:27:14,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 09:27:14,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 09:27:14,135 INFO L87 Difference]: Start difference. First operand 24346 states and 26548 transitions. Second operand has 33 states, 33 states have (on average 8.969696969696969) internal successors, (296), 33 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:45,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:27:45,028 INFO L93 Difference]: Finished difference Result 57598 states and 63034 transitions. [2023-12-25 09:27:45,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 364 states. [2023-12-25 09:27:45,029 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.969696969696969) internal successors, (296), 33 states have internal predecessors, (296), 0 states have call successors, (0), 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 158 [2023-12-25 09:27:45,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:27:45,080 INFO L225 Difference]: With dead ends: 57598 [2023-12-25 09:27:45,080 INFO L226 Difference]: Without dead ends: 55972 [2023-12-25 09:27:45,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 384 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63554 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=11562, Invalid=137048, Unknown=0, NotChecked=0, Total=148610 [2023-12-25 09:27:45,102 INFO L413 NwaCegarLoop]: 486 mSDtfsCounter, 3673 mSDsluCounter, 10839 mSDsCounter, 0 mSdLazyCounter, 3739 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3673 SdHoareTripleChecker+Valid, 11325 SdHoareTripleChecker+Invalid, 3758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-25 09:27:45,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3673 Valid, 11325 Invalid, 3758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3739 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-12-25 09:27:45,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55972 states. [2023-12-25 09:27:45,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55972 to 27842. [2023-12-25 09:27:45,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27842 states, 27841 states have (on average 1.0915197011601594) internal successors, (30389), 27841 states have internal predecessors, (30389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27842 states to 27842 states and 30389 transitions. [2023-12-25 09:27:45,431 INFO L78 Accepts]: Start accepts. Automaton has 27842 states and 30389 transitions. Word has length 158 [2023-12-25 09:27:45,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:27:45,431 INFO L495 AbstractCegarLoop]: Abstraction has 27842 states and 30389 transitions. [2023-12-25 09:27:45,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.969696969696969) internal successors, (296), 33 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 27842 states and 30389 transitions. [2023-12-25 09:27:45,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-25 09:27:45,434 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:27:45,434 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 09:27:45,437 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 (59)] Forceful destruction successful, exit code 0 [2023-12-25 09:27:45,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:27:45,637 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:27:45,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:27:45,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1517643980, now seen corresponding path program 1 times [2023-12-25 09:27:45,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:27:45,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669146160] [2023-12-25 09:27:45,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:27:45,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:27:45,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:27:45,640 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:27:45,641 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 (60)] Waiting until timeout for monitored process [2023-12-25 09:27:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:27:45,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 09:27:45,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:27:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 106 proven. 118 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 09:27:46,853 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:27:47,143 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 106 proven. 118 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 09:27:47,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:27:47,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669146160] [2023-12-25 09:27:47,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669146160] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:27:47,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:27:47,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2023-12-25 09:27:47,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856970240] [2023-12-25 09:27:47,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:27:47,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-25 09:27:47,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:27:47,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-25 09:27:47,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2023-12-25 09:27:47,145 INFO L87 Difference]: Start difference. First operand 27842 states and 30389 transitions. Second operand has 28 states, 28 states have (on average 9.714285714285714) internal successors, (272), 28 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:58,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:27:58,170 INFO L93 Difference]: Finished difference Result 48590 states and 53232 transitions. [2023-12-25 09:27:58,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-12-25 09:27:58,170 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.714285714285714) internal successors, (272), 28 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2023-12-25 09:27:58,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:27:58,207 INFO L225 Difference]: With dead ends: 48590 [2023-12-25 09:27:58,207 INFO L226 Difference]: Without dead ends: 38283 [2023-12-25 09:27:58,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3840 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=2224, Invalid=10886, Unknown=0, NotChecked=0, Total=13110 [2023-12-25 09:27:58,221 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 2000 mSDsluCounter, 4221 mSDsCounter, 0 mSdLazyCounter, 1872 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2000 SdHoareTripleChecker+Valid, 4512 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:27:58,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2000 Valid, 4512 Invalid, 1891 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [19 Valid, 1872 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-25 09:27:58,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38283 states. [2023-12-25 09:27:58,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38283 to 31400. [2023-12-25 09:27:58,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31400 states, 31399 states have (on average 1.0899073218892321) internal successors, (34222), 31399 states have internal predecessors, (34222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:58,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31400 states to 31400 states and 34222 transitions. [2023-12-25 09:27:58,659 INFO L78 Accepts]: Start accepts. Automaton has 31400 states and 34222 transitions. Word has length 159 [2023-12-25 09:27:58,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:27:58,660 INFO L495 AbstractCegarLoop]: Abstraction has 31400 states and 34222 transitions. [2023-12-25 09:27:58,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.714285714285714) internal successors, (272), 28 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:27:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand 31400 states and 34222 transitions. [2023-12-25 09:27:58,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-25 09:27:58,662 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:27:58,663 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-25 09:27:58,666 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 (60)] Forceful destruction successful, exit code 0 [2023-12-25 09:27:58,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:27:58,866 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:27:58,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:27:58,868 INFO L85 PathProgramCache]: Analyzing trace with hash 152591346, now seen corresponding path program 2 times [2023-12-25 09:27:58,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:27:58,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68506820] [2023-12-25 09:27:58,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 09:27:58,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:27:58,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:27:58,870 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:27:58,871 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 (61)] Waiting until timeout for monitored process [2023-12-25 09:27:58,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 09:27:58,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 09:27:58,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-25 09:27:58,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:28:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 144 proven. 62 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 09:28:00,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:28:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 65 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:28:01,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:28:01,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68506820] [2023-12-25 09:28:01,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68506820] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:28:01,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:28:01,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2023-12-25 09:28:01,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855784410] [2023-12-25 09:28:01,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:28:01,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-25 09:28:01,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:28:01,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-25 09:28:01,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1414, Unknown=0, NotChecked=0, Total=1560 [2023-12-25 09:28:01,415 INFO L87 Difference]: Start difference. First operand 31400 states and 34222 transitions. Second operand has 40 states, 40 states have (on average 7.325) internal successors, (293), 40 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:28:22,621 INFO L93 Difference]: Finished difference Result 41087 states and 44680 transitions. [2023-12-25 09:28:22,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2023-12-25 09:28:22,622 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 7.325) internal successors, (293), 40 states have internal predecessors, (293), 0 states have call successors, (0), 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 163 [2023-12-25 09:28:22,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:28:22,658 INFO L225 Difference]: With dead ends: 41087 [2023-12-25 09:28:22,659 INFO L226 Difference]: Without dead ends: 37849 [2023-12-25 09:28:22,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13044 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=4688, Invalid=32754, Unknown=0, NotChecked=0, Total=37442 [2023-12-25 09:28:22,673 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 2770 mSDsluCounter, 6891 mSDsCounter, 0 mSdLazyCounter, 3639 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2770 SdHoareTripleChecker+Valid, 7174 SdHoareTripleChecker+Invalid, 3687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 3639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:28:22,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2770 Valid, 7174 Invalid, 3687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 3639 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-25 09:28:22,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37849 states. [2023-12-25 09:28:22,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37849 to 31870. [2023-12-25 09:28:22,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31870 states, 31869 states have (on average 1.0893658414132856) internal successors, (34717), 31869 states have internal predecessors, (34717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31870 states to 31870 states and 34717 transitions. [2023-12-25 09:28:22,929 INFO L78 Accepts]: Start accepts. Automaton has 31870 states and 34717 transitions. Word has length 163 [2023-12-25 09:28:22,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:28:22,929 INFO L495 AbstractCegarLoop]: Abstraction has 31870 states and 34717 transitions. [2023-12-25 09:28:22,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.325) internal successors, (293), 40 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:22,929 INFO L276 IsEmpty]: Start isEmpty. Operand 31870 states and 34717 transitions. [2023-12-25 09:28:22,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-25 09:28:22,932 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:28:22,932 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-25 09:28:22,935 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 (61)] Ended with exit code 0 [2023-12-25 09:28:23,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:28:23,135 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:28:23,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:28:23,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1206145515, now seen corresponding path program 1 times [2023-12-25 09:28:23,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:28:23,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684854670] [2023-12-25 09:28:23,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:28:23,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:28:23,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:28:23,137 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:28:23,138 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 (62)] Waiting until timeout for monitored process [2023-12-25 09:28:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:28:23,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 09:28:23,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:28:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 143 proven. 53 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-25 09:28:24,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:28:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 38 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:28:25,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:28:25,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684854670] [2023-12-25 09:28:25,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684854670] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:28:25,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:28:25,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 40 [2023-12-25 09:28:25,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921747302] [2023-12-25 09:28:25,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:28:25,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-25 09:28:25,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:28:25,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-25 09:28:25,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1335, Unknown=0, NotChecked=0, Total=1560 [2023-12-25 09:28:25,339 INFO L87 Difference]: Start difference. First operand 31870 states and 34717 transitions. Second operand has 40 states, 40 states have (on average 7.275) internal successors, (291), 40 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:31:23,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:31:23,934 INFO L93 Difference]: Finished difference Result 93417 states and 102386 transitions. [2023-12-25 09:31:23,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 570 states. [2023-12-25 09:31:23,935 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 7.275) internal successors, (291), 40 states have internal predecessors, (291), 0 states have call successors, (0), 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 163 [2023-12-25 09:31:23,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:31:24,007 INFO L225 Difference]: With dead ends: 93417 [2023-12-25 09:31:24,007 INFO L226 Difference]: Without dead ends: 88250 [2023-12-25 09:31:24,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 891 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 604 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168269 ImplicationChecksByTransitivity, 172.4s TimeCoverageRelationStatistics Valid=33634, Invalid=332996, Unknown=0, NotChecked=0, Total=366630 [2023-12-25 09:31:24,027 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 5253 mSDsluCounter, 7792 mSDsCounter, 0 mSdLazyCounter, 3804 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5253 SdHoareTripleChecker+Valid, 8075 SdHoareTripleChecker+Invalid, 3847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:31:24,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5253 Valid, 8075 Invalid, 3847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3804 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2023-12-25 09:31:24,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88250 states. [2023-12-25 09:31:24,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88250 to 34802. [2023-12-25 09:31:24,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34802 states, 34801 states have (on average 1.0918651762880378) internal successors, (37998), 34801 states have internal predecessors, (37998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:31:24,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34802 states to 34802 states and 37998 transitions. [2023-12-25 09:31:24,582 INFO L78 Accepts]: Start accepts. Automaton has 34802 states and 37998 transitions. Word has length 163 [2023-12-25 09:31:24,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:31:24,582 INFO L495 AbstractCegarLoop]: Abstraction has 34802 states and 37998 transitions. [2023-12-25 09:31:24,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.275) internal successors, (291), 40 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:31:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand 34802 states and 37998 transitions. [2023-12-25 09:31:24,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-25 09:31:24,585 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:31:24,585 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-25 09:31:24,590 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 (62)] Forceful destruction successful, exit code 0 [2023-12-25 09:31:24,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:31:24,788 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:31:24,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:31:24,788 INFO L85 PathProgramCache]: Analyzing trace with hash -527024056, now seen corresponding path program 1 times [2023-12-25 09:31:24,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:31:24,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467532554] [2023-12-25 09:31:24,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:31:24,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:31:24,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:31:24,790 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:31:24,792 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 (63)] Waiting until timeout for monitored process [2023-12-25 09:31:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:31:24,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 09:31:24,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:31:25,999 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 139 proven. 72 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-25 09:31:26,000 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:31:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 54 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:31:27,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:31:27,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467532554] [2023-12-25 09:31:27,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467532554] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:31:27,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:31:27,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 38 [2023-12-25 09:31:27,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870136643] [2023-12-25 09:31:27,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:31:27,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-25 09:31:27,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:31:27,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-25 09:31:27,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2023-12-25 09:31:27,109 INFO L87 Difference]: Start difference. First operand 34802 states and 37998 transitions. Second operand has 38 states, 38 states have (on average 7.7368421052631575) internal successors, (294), 38 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:33:14,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:33:14,099 INFO L93 Difference]: Finished difference Result 81381 states and 89071 transitions. [2023-12-25 09:33:14,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 459 states. [2023-12-25 09:33:14,101 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 7.7368421052631575) internal successors, (294), 38 states have internal predecessors, (294), 0 states have call successors, (0), 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 163 [2023-12-25 09:33:14,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:33:14,172 INFO L225 Difference]: With dead ends: 81381 [2023-12-25 09:33:14,172 INFO L226 Difference]: Without dead ends: 72095 [2023-12-25 09:33:14,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 493 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111325 ImplicationChecksByTransitivity, 103.3s TimeCoverageRelationStatistics Valid=26089, Invalid=218441, Unknown=0, NotChecked=0, Total=244530 [2023-12-25 09:33:14,197 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 3838 mSDsluCounter, 7220 mSDsCounter, 0 mSdLazyCounter, 3079 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3838 SdHoareTripleChecker+Valid, 7457 SdHoareTripleChecker+Invalid, 3130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:33:14,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3838 Valid, 7457 Invalid, 3130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3079 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-25 09:33:14,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72095 states. [2023-12-25 09:33:14,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72095 to 36457. [2023-12-25 09:33:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36457 states, 36456 states have (on average 1.092193328944481) internal successors, (39817), 36456 states have internal predecessors, (39817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:33:14,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36457 states to 36457 states and 39817 transitions. [2023-12-25 09:33:14,670 INFO L78 Accepts]: Start accepts. Automaton has 36457 states and 39817 transitions. Word has length 163 [2023-12-25 09:33:14,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:33:14,670 INFO L495 AbstractCegarLoop]: Abstraction has 36457 states and 39817 transitions. [2023-12-25 09:33:14,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 7.7368421052631575) internal successors, (294), 38 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:33:14,671 INFO L276 IsEmpty]: Start isEmpty. Operand 36457 states and 39817 transitions. [2023-12-25 09:33:14,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-25 09:33:14,673 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:33:14,673 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-25 09:33:14,676 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 (63)] Ended with exit code 0 [2023-12-25 09:33:14,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:33:14,876 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:33:14,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:33:14,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1930629735, now seen corresponding path program 1 times [2023-12-25 09:33:14,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:33:14,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997411207] [2023-12-25 09:33:14,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:33:14,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:33:14,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:33:14,879 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:33:14,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (64)] Waiting until timeout for monitored process [2023-12-25 09:33:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:33:14,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 09:33:14,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:33:15,869 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 45 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:33:15,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:33:16,379 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 45 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:33:16,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:33:16,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997411207] [2023-12-25 09:33:16,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997411207] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:33:16,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:33:16,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2023-12-25 09:33:16,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205112694] [2023-12-25 09:33:16,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:33:16,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 09:33:16,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:33:16,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 09:33:16,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 09:33:16,380 INFO L87 Difference]: Start difference. First operand 36457 states and 39817 transitions. Second operand has 33 states, 33 states have (on average 9.303030303030303) internal successors, (307), 33 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:33:23,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:33:23,033 INFO L93 Difference]: Finished difference Result 48455 states and 52949 transitions. [2023-12-25 09:33:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2023-12-25 09:33:23,033 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 9.303030303030303) internal successors, (307), 33 states have internal predecessors, (307), 0 states have call successors, (0), 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 164 [2023-12-25 09:33:23,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:33:23,075 INFO L225 Difference]: With dead ends: 48455 [2023-12-25 09:33:23,075 INFO L226 Difference]: Without dead ends: 45079 [2023-12-25 09:33:23,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3422 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1974, Invalid=11136, Unknown=0, NotChecked=0, Total=13110 [2023-12-25 09:33:23,090 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 1440 mSDsluCounter, 5895 mSDsCounter, 0 mSdLazyCounter, 1959 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 6186 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:33:23,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1440 Valid, 6186 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1959 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-25 09:33:23,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45079 states. [2023-12-25 09:33:23,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45079 to 35067. [2023-12-25 09:33:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35067 states, 35066 states have (on average 1.0925682997775623) internal successors, (38312), 35066 states have internal predecessors, (38312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:33:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35067 states to 35067 states and 38312 transitions. [2023-12-25 09:33:23,398 INFO L78 Accepts]: Start accepts. Automaton has 35067 states and 38312 transitions. Word has length 164 [2023-12-25 09:33:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:33:23,399 INFO L495 AbstractCegarLoop]: Abstraction has 35067 states and 38312 transitions. [2023-12-25 09:33:23,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 9.303030303030303) internal successors, (307), 33 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:33:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand 35067 states and 38312 transitions. [2023-12-25 09:33:23,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-25 09:33:23,401 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:33:23,402 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-25 09:33:23,405 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 (64)] Forceful destruction successful, exit code 0 [2023-12-25 09:33:23,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:33:23,605 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:33:23,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:33:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1969143938, now seen corresponding path program 1 times [2023-12-25 09:33:23,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:33:23,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239673034] [2023-12-25 09:33:23,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:33:23,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:33:23,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:33:23,608 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:33:23,609 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 (65)] Waiting until timeout for monitored process [2023-12-25 09:33:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 09:33:23,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 09:33:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 09:33:23,852 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 09:33:23,853 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 09:33:23,854 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 09:33:23,872 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 (65)] Forceful destruction successful, exit code 0 [2023-12-25 09:33:24,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:33:24,062 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:33:24,064 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 09:33:24,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 09:33:24 BoogieIcfgContainer [2023-12-25 09:33:24,204 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 09:33:24,204 INFO L158 Benchmark]: Toolchain (without parser) took 833848.49ms. Allocated memory was 300.9MB in the beginning and 6.0GB in the end (delta: 5.7GB). Free memory was 245.4MB in the beginning and 3.3GB in the end (delta: -3.0GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2023-12-25 09:33:24,204 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 213.9MB. Free memory is still 161.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 09:33:24,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.89ms. Allocated memory is still 300.9MB. Free memory was 245.4MB in the beginning and 229.1MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-25 09:33:24,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.07ms. Allocated memory is still 300.9MB. Free memory was 228.6MB in the beginning and 226.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 09:33:24,204 INFO L158 Benchmark]: Boogie Preprocessor took 48.12ms. Allocated memory is still 300.9MB. Free memory was 226.5MB in the beginning and 223.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 09:33:24,204 INFO L158 Benchmark]: RCFGBuilder took 553.04ms. Allocated memory is still 300.9MB. Free memory was 223.9MB in the beginning and 196.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-12-25 09:33:24,204 INFO L158 Benchmark]: TraceAbstraction took 832903.64ms. Allocated memory was 300.9MB in the beginning and 6.0GB in the end (delta: 5.7GB). Free memory was 196.1MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2023-12-25 09:33:24,205 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.14ms. Allocated memory is still 213.9MB. Free memory is still 161.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 303.89ms. Allocated memory is still 300.9MB. Free memory was 245.4MB in the beginning and 229.1MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.07ms. Allocated memory is still 300.9MB. Free memory was 228.6MB in the beginning and 226.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.12ms. Allocated memory is still 300.9MB. Free memory was 226.5MB in the beginning and 223.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 553.04ms. Allocated memory is still 300.9MB. Free memory was 223.9MB in the beginning and 196.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 832903.64ms. Allocated memory was 300.9MB in the beginning and 6.0GB in the end (delta: 5.7GB). Free memory was 196.1MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 2.6GB. 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: 212]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L25] msg_t nomsg = (msg_t )-1; [L26] char r1 = '\x0'; [L27] port_t p1 = 0; [L28] char p1_old = '\x0'; [L29] char p1_new = '\x0'; [L30] char id1 = '\x0'; [L31] char st1 = '\x0'; [L32] msg_t send1 = '\x0'; [L33] _Bool mode1 = 0; [L34] _Bool alive1 = 0; [L35] port_t p2 = 0; [L36] char p2_old = '\x0'; [L37] char p2_new = '\x0'; [L38] char id2 = '\x0'; [L39] char st2 = '\x0'; [L40] msg_t send2 = '\x0'; [L41] _Bool mode2 = 0; [L42] _Bool alive2 = 0; [L43] port_t p3 = 0; [L44] char p3_old = '\x0'; [L45] char p3_new = '\x0'; [L46] char id3 = '\x0'; [L47] char st3 = '\x0'; [L48] msg_t send3 = '\x0'; [L49] _Bool mode3 = 0; [L50] _Bool alive3 = 0; [L54] void (*nodes[3])() = { &node1, &node2, &node3 }; [L58] int __return_6343; [L59] int __return_6448; [L60] int __return_6514; [L63] int main__c1; [L64] int main__i2; [L65] main__c1 = 0 [L66] r1 = __VERIFIER_nondet_char() [L67] id1 = __VERIFIER_nondet_char() [L68] st1 = __VERIFIER_nondet_char() [L69] send1 = __VERIFIER_nondet_char() [L70] mode1 = __VERIFIER_nondet_bool() [L71] alive1 = __VERIFIER_nondet_bool() [L72] id2 = __VERIFIER_nondet_char() [L73] st2 = __VERIFIER_nondet_char() [L74] send2 = __VERIFIER_nondet_char() [L75] mode2 = __VERIFIER_nondet_bool() [L76] alive2 = __VERIFIER_nondet_bool() [L77] id3 = __VERIFIER_nondet_char() [L78] st3 = __VERIFIER_nondet_char() [L79] send3 = __VERIFIER_nondet_char() [L80] mode3 = __VERIFIER_nondet_bool() [L81] alive3 = __VERIFIER_nondet_bool() [L83] int init__tmp; VAL [__return_6343=0, __return_6448=0, __return_6514=0, __return_main=0, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0] [L84] COND TRUE ((int)r1) == 0 VAL [__return_6343=0, __return_6448=0, __return_6514=0, __return_main=0, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0] [L86] COND TRUE ((((int)alive1) + ((int)alive2)) + ((int)alive3)) >= 1 VAL [__return_6343=0, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0] [L88] COND TRUE ((int)id1) >= 0 VAL [__return_6343=0, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0] [L90] COND TRUE ((int)st1) == 0 VAL [__return_6343=0, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, st1=0] [L92] COND TRUE ((int)send1) == ((int)id1) VAL [__return_6343=0, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0] [L94] COND TRUE ((int)mode1) == 0 VAL [__return_6343=0, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, main__c1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0] [L96] COND TRUE ((int)id2) >= 0 VAL [__return_6343=0, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, main__c1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0] [L98] COND TRUE ((int)st2) == 0 VAL [__return_6343=0, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, main__c1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0, st2=0] [L100] COND TRUE ((int)send2) == ((int)id2) VAL [__return_6343=0, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, main__c1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=0, st1=0, st2=0] [L102] COND TRUE ((int)mode2) == 0 VAL [__return_6343=0, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, main__c1=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=0, st1=0, st2=0] [L104] COND TRUE ((int)id3) >= 0 VAL [__return_6343=0, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, main__c1=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=0, st1=0, st2=0] [L106] COND TRUE ((int)st3) == 0 VAL [__return_6343=0, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, main__c1=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=0, st1=0, st2=0, st3=0] [L108] COND TRUE ((int)send3) == ((int)id3) VAL [__return_6343=0, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, main__c1=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L110] COND TRUE ((int)mode3) == 0 VAL [__return_6343=0, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L112] COND TRUE ((int)id1) != ((int)id2) VAL [__return_6343=0, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L114] COND TRUE ((int)id1) != ((int)id3) VAL [__return_6343=0, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L116] COND TRUE ((int)id2) != ((int)id3) [L118] init__tmp = 1 [L119] __return_6343 = init__tmp [L120] main__i2 = __return_6343 VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L121] COND TRUE main__i2 != 0 [L123] p1_old = nomsg [L124] p1_new = nomsg [L125] p2_old = nomsg [L126] p2_new = nomsg [L127] p3_old = nomsg [L128] p3_new = nomsg [L129] main__i2 = 0 VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L131] COND TRUE main__i2 < 6 [L134] msg_t node1__m1; [L135] node1__m1 = nomsg VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L136] COND FALSE !(!(mode1 == 0)) VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L443] COND TRUE !(alive1 == 0) [L445] int node1____CPAchecker_TMP_0; VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L446] COND TRUE send1 != nomsg VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L448] COND TRUE p1_new == nomsg [L450] node1____CPAchecker_TMP_0 = send1 VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L452] p1_new = node1____CPAchecker_TMP_0 VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L454] mode1 = 1 VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L153] msg_t node2__m2; [L154] node2__m2 = nomsg VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L155] COND FALSE !(!(mode2 == 0)) VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L356] COND TRUE !(alive2 == 0) [L358] int node2____CPAchecker_TMP_0; VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L359] COND TRUE send2 != nomsg VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L361] COND TRUE p2_new == nomsg [L363] node2____CPAchecker_TMP_0 = send2 VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L365] p2_new = node2____CPAchecker_TMP_0 VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L367] mode2 = 1 VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L171] msg_t node3__m3; [L172] node3__m3 = nomsg VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L173] COND FALSE !(!(mode3 == 0)) VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L270] COND FALSE !(!(alive3 == 0)) VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L298] COND FALSE !(((int)send3) != ((int)id3)) VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L281] mode3 = 1 VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L188] p1_old = p1_new [L189] p1_new = nomsg [L190] p2_old = p2_new [L191] p2_new = nomsg [L192] p3_old = p3_new [L193] p3_new = nomsg [L195] int check__tmp; VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L196] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)r1) < 3 [L200] check__tmp = 1 VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, alive1=1, alive2=1, alive3=0, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L203] __return_6448 = check__tmp [L204] main__c1 = __return_6448 [L206] _Bool __tmp_1; [L207] __tmp_1 = main__c1 [L208] _Bool assert__arg; [L209] assert__arg = __tmp_1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L210] COND FALSE !(assert__arg == 0) [L217] int main____CPAchecker_TMP_0 = main__i2; [L218] main__i2 = main__i2 + 1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L131] COND TRUE main__i2 < 6 [L134] msg_t node1__m1; [L135] node1__m1 = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L136] COND TRUE !(mode1 == 0) [L138] r1 = (char)(((int)r1) + 1) [L139] node1__m1 = p3_old [L140] p3_old = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L141] COND FALSE !(((int)node1__m1) != ((int)nomsg)) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L150] mode1 = 0 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L153] msg_t node2__m2; [L154] node2__m2 = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L155] COND TRUE !(mode2 == 0) [L157] node2__m2 = p1_old [L158] p1_old = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L159] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L161] COND TRUE !(alive2 == 0) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L163] COND TRUE ((int)node2__m2) > ((int)id2) [L165] send2 = node2__m2 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=32, st1=0, st2=0, st3=0] [L168] mode2 = 0 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=32, st1=0, st2=0, st3=0] [L171] msg_t node3__m3; [L172] node3__m3 = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=32, st1=0, st2=0, st3=0] [L173] COND TRUE !(mode3 == 0) [L175] node3__m3 = p2_old [L176] p2_old = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=32, st1=0, st2=0, st3=0] [L177] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=32, st1=0, st2=0, st3=0] [L179] COND FALSE !(!(alive3 == 0)) [L259] send3 = node3__m3 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L186] mode3 = 0 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L188] p1_old = p1_new [L189] p1_new = nomsg [L190] p2_old = p2_new [L191] p2_new = nomsg [L192] p3_old = p3_new [L193] p3_new = nomsg [L195] int check__tmp; VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L196] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)r1) < 3 [L200] check__tmp = 1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L203] __return_6448 = check__tmp [L204] main__c1 = __return_6448 [L206] _Bool __tmp_1; [L207] __tmp_1 = main__c1 [L208] _Bool assert__arg; [L209] assert__arg = __tmp_1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L210] COND FALSE !(assert__arg == 0) [L217] int main____CPAchecker_TMP_0 = main__i2; [L218] main__i2 = main__i2 + 1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L131] COND TRUE main__i2 < 6 [L134] msg_t node1__m1; [L135] node1__m1 = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L136] COND FALSE !(!(mode1 == 0)) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L443] COND TRUE !(alive1 == 0) [L445] int node1____CPAchecker_TMP_0; VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L446] COND TRUE send1 != nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L448] COND TRUE p1_new == nomsg [L450] node1____CPAchecker_TMP_0 = send1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L452] p1_new = node1____CPAchecker_TMP_0 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L454] mode1 = 1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3__m3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L153] msg_t node2__m2; [L154] node2__m2 = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L155] COND FALSE !(!(mode2 == 0)) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L356] COND TRUE !(alive2 == 0) [L358] int node2____CPAchecker_TMP_0; VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2__m2=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L359] COND TRUE send2 != nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2__m2=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L361] COND TRUE p2_new == nomsg [L363] node2____CPAchecker_TMP_0 = send2 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L365] p2_new = node2____CPAchecker_TMP_0 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L367] mode2 = 1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L171] msg_t node3__m3; [L172] node3__m3 = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L173] COND FALSE !(!(mode3 == 0)) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L270] COND FALSE !(!(alive3 == 0)) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L298] COND TRUE ((int)send3) != ((int)id3) [L300] int node3____CPAchecker_TMP_1; VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L301] COND TRUE send3 != nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L303] COND TRUE p3_new == nomsg [L305] node3____CPAchecker_TMP_1 = send3 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L307] p3_new = node3____CPAchecker_TMP_1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L281] mode3 = 1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L188] p1_old = p1_new [L189] p1_new = nomsg [L190] p2_old = p2_new [L191] p2_new = nomsg [L192] p3_old = p3_new [L193] p3_new = nomsg [L195] int check__tmp; VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=0, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L196] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=0, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)r1) < 3 [L200] check__tmp = 1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=0, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L203] __return_6448 = check__tmp [L204] main__c1 = __return_6448 [L206] _Bool __tmp_1; [L207] __tmp_1 = main__c1 [L208] _Bool assert__arg; [L209] assert__arg = __tmp_1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=0, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L210] COND FALSE !(assert__arg == 0) [L217] int main____CPAchecker_TMP_0 = main__i2; [L218] main__i2 = main__i2 + 1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=0, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L131] COND TRUE main__i2 < 6 [L134] msg_t node1__m1; [L135] node1__m1 = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=0, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L136] COND TRUE !(mode1 == 0) [L138] r1 = (char)(((int)r1) + 1) [L139] node1__m1 = p3_old [L140] p3_old = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L141] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L143] COND TRUE !(alive1 == 0) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L145] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L418] COND FALSE !(((int)node1__m1) == ((int)id1)) [L425] send1 = node1__m1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L150] mode1 = 0 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L153] msg_t node2__m2; [L154] node2__m2 = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L155] COND TRUE !(mode2 == 0) [L157] node2__m2 = p1_old [L158] p1_old = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L159] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L161] COND TRUE !(alive2 == 0) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L163] COND TRUE ((int)node2__m2) > ((int)id2) [L165] send2 = node2__m2 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L168] mode2 = 0 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L171] msg_t node3__m3; [L172] node3__m3 = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L173] COND TRUE !(mode3 == 0) [L175] node3__m3 = p2_old [L176] p2_old = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L177] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L179] COND FALSE !(!(alive3 == 0)) [L259] send3 = node3__m3 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L186] mode3 = 0 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L188] p1_old = p1_new [L189] p1_new = nomsg [L190] p2_old = p2_new [L191] p2_new = nomsg [L192] p3_old = p3_new [L193] p3_new = nomsg [L195] int check__tmp; VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L196] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)r1) < 3 [L200] check__tmp = 1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L203] __return_6448 = check__tmp [L204] main__c1 = __return_6448 [L206] _Bool __tmp_1; [L207] __tmp_1 = main__c1 [L208] _Bool assert__arg; [L209] assert__arg = __tmp_1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L210] COND FALSE !(assert__arg == 0) [L217] int main____CPAchecker_TMP_0 = main__i2; [L218] main__i2 = main__i2 + 1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=0, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L131] COND TRUE main__i2 < 6 [L134] msg_t node1__m1; [L135] node1__m1 = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L136] COND FALSE !(!(mode1 == 0)) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L443] COND TRUE !(alive1 == 0) [L445] int node1____CPAchecker_TMP_0; VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L446] COND TRUE send1 != nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L448] COND TRUE p1_new == nomsg [L450] node1____CPAchecker_TMP_0 = send1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L452] p1_new = node1____CPAchecker_TMP_0 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L454] mode1 = 1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L153] msg_t node2__m2; [L154] node2__m2 = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L155] COND FALSE !(!(mode2 == 0)) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L356] COND TRUE !(alive2 == 0) [L358] int node2____CPAchecker_TMP_0; VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L359] COND TRUE send2 != nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L361] COND TRUE p2_new == nomsg [L363] node2____CPAchecker_TMP_0 = send2 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L365] p2_new = node2____CPAchecker_TMP_0 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L367] mode2 = 1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=64, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L171] msg_t node3__m3; [L172] node3__m3 = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L173] COND FALSE !(!(mode3 == 0)) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L270] COND FALSE !(!(alive3 == 0)) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L298] COND TRUE ((int)send3) != ((int)id3) [L300] int node3____CPAchecker_TMP_1; VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L301] COND TRUE send3 != nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L303] COND TRUE p3_new == nomsg [L305] node3____CPAchecker_TMP_1 = send3 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L307] p3_new = node3____CPAchecker_TMP_1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=64, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L281] mode3 = 1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=64, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L188] p1_old = p1_new [L189] p1_new = nomsg [L190] p2_old = p2_new [L191] p2_new = nomsg [L192] p3_old = p3_new [L193] p3_new = nomsg [L195] int check__tmp; VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L196] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)r1) < 3 [L200] check__tmp = 1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L203] __return_6448 = check__tmp [L204] main__c1 = __return_6448 [L206] _Bool __tmp_1; [L207] __tmp_1 = main__c1 [L208] _Bool assert__arg; [L209] assert__arg = __tmp_1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L210] COND FALSE !(assert__arg == 0) [L217] int main____CPAchecker_TMP_0 = main__i2; [L218] main__i2 = main__i2 + 1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L131] COND TRUE main__i2 < 6 [L134] msg_t node1__m1; [L135] node1__m1 = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L136] COND TRUE !(mode1 == 0) [L138] r1 = (char)(((int)r1) + 1) [L139] node1__m1 = p3_old [L140] p3_old = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L141] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L143] COND TRUE !(alive1 == 0) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L145] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L418] COND TRUE ((int)node1__m1) == ((int)id1) [L420] st1 = 1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L150] mode1 = 0 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L153] msg_t node2__m2; [L154] node2__m2 = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L155] COND TRUE !(mode2 == 0) [L157] node2__m2 = p1_old [L158] p1_old = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=0, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L159] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=0, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L161] COND TRUE !(alive2 == 0) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=0, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L163] COND FALSE !(((int)node2__m2) > ((int)id2)) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=0, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L332] COND TRUE ((int)node2__m2) == ((int)id2) [L334] st2 = 1 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=0, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L168] mode2 = 0 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=0, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L171] msg_t node3__m3; [L172] node3__m3 = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=0, node3____CPAchecker_TMP_1=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L173] COND TRUE !(mode3 == 0) [L175] node3__m3 = p2_old [L176] p2_old = nomsg VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=0, node3____CPAchecker_TMP_1=64, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L177] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=0, node3____CPAchecker_TMP_1=64, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L179] COND FALSE !(!(alive3 == 0)) [L259] send3 = node3__m3 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=0, node3____CPAchecker_TMP_1=64, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L186] mode3 = 0 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=0, node3____CPAchecker_TMP_1=64, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L188] p1_old = p1_new [L189] p1_new = nomsg [L190] p2_old = p2_new [L191] p2_new = nomsg [L192] p3_old = p3_new [L193] p3_new = nomsg [L195] int check__tmp; VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=0, node3____CPAchecker_TMP_1=64, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L196] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L239] check__tmp = 0 VAL [__return_6343=1, __return_6448=1, __return_6514=0, __return_main=0, __tmp_1=1, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=0, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=0, node3____CPAchecker_TMP_1=64, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L203] __return_6448 = check__tmp [L204] main__c1 = __return_6448 [L206] _Bool __tmp_1; [L207] __tmp_1 = main__c1 [L208] _Bool assert__arg; [L209] assert__arg = __tmp_1 VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, __tmp_1=0, alive1=1, alive2=1, alive3=0, assert__arg=0, check__tmp=0, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=0, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=0, node3____CPAchecker_TMP_1=64, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L210] COND TRUE assert__arg == 0 VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, __tmp_1=0, alive1=1, alive2=1, alive3=0, assert__arg=0, check__tmp=0, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=0, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=0, node3____CPAchecker_TMP_1=64, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L212] reach_error() VAL [__return_6343=1, __return_6448=0, __return_6514=0, __return_main=0, __tmp_1=0, alive1=1, alive2=1, alive3=0, assert__arg=0, check__tmp=0, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=0, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1__m1=64, node2____CPAchecker_TMP_0=64, node2__m2=0, node3____CPAchecker_TMP_1=64, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=0, send2=64, send3=64, st1=1, st2=1, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 832.7s, OverallIterations: 64, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 746.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94163 SdHoareTripleChecker+Valid, 84.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94163 mSDsluCounter, 177131 SdHoareTripleChecker+Invalid, 76.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 163960 mSDsCounter, 1404 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 76670 IncrementalHoareTripleChecker+Invalid, 78074 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1404 mSolverCounterUnsat, 13171 mSDtfsCounter, 76670 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16399 GetRequests, 10499 SyntacticMatches, 3 SemanticMatches, 5897 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729187 ImplicationChecksByTransitivity, 666.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49011occurred in iteration=16, InterpolantAutomatonStates: 5160, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.4s AutomataMinimizationTime, 63 MinimizatonAttempts, 646755 StatesRemovedByMinimization, 63 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 53.3s InterpolantComputationTime, 6483 NumberOfCodeBlocks, 6483 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 11386 ConstructedInterpolants, 3059 QuantifiedInterpolants, 128173 SizeOfPredicates, 383 NumberOfNonLiveVariables, 12876 ConjunctsInSsa, 663 ConjunctsInUnsatCore, 105 InterpolantComputations, 21 PerfectInterpolantSequences, 6247/11773 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-25 09:33:24,433 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 09:33:24,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...